Pierre-Cyrille Héam

Mohammed Bakiri

Proceedings of the 17th International Conference on High Performance Computing & Simulation, 2019

A Comparison of Random Task Graph Generation Methods for Scheduling Problems.

[BibT_eX]

[DOI]

Mohamad El Sayah

Proceedings of the Euro-Par 2019: Parallel Processing, 2019

2018

An Approximation-Based Approach for the Random Exploration of Large Models.

[BibT_eX]

[DOI]

Julien Bernard

Proceedings of the Tests and Proofs - 12th International Conference, 2018

A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation.

[BibT_eX]

[DOI]

Mohamad El Sayah

Proceedings of the 2018 International Conference on High Performance Computing & Simulation, 2018

2017

The emptiness problem for tree automata with at least one global disequality constraint is NP-hard.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations.

[BibT_eX]

[DOI]

Sylvain Contassot-Vivier

Christophe Guyeux

Int. J. Bifurc. Chaos, 2017

Traversing a n-cube without Balanced Hamiltonian Cycle to Generate Pseudorandom Numbers.

[BibT_eX]

[DOI]

CoRR, 2017

Controlling the correlation of cost matrices to assess scheduling algorithm performance on heterogeneous platforms.

[BibT_eX]

[DOI]

Laurent Philippe

Concurr. Comput. Pract. Exp., 2017

2016

Controlling and Assessing Correlations of Cost Matrices in Heterogeneous Scheduling.

[BibT_eX]

[DOI]

Laurent Philippe

Proceedings of the Euro-Par 2016: Parallel Processing, 2016

A Model-Based Testing Approach for Security Protocols.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Intl Conference on Computational Science and Engineering, 2016

2015

Efficient and cryptographically secure generation of chaotic pseudorandom numbers on GPU.

[BibT_eX]

[DOI]

J. Supercomput., 2015

Model-based mutation testing from security protocols in HLPSL.

[BibT_eX]

[DOI]

Softw. Test. Verification Reliab., 2015

Random Generation and Enumeration of Accessible Determinisitic Real-time Pushdown Automata.

[BibT_eX]

[DOI]

Jean-Luc Joly

CoRR, 2015

Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata.

[BibT_eX]

[DOI]

Jean-Luc Joly

Proceedings of the Implementation and Application of Automata, 2015

On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism.

[BibT_eX]

[DOI]

Jean-Luc Joly

Proceedings of the Implementation and Application of Automata, 2015

Covering both stack and states while testing push-down systems.

[BibT_eX]

[DOI]

Hana M'Hemdi

Proceedings of the Eighth IEEE International Conference on Software Testing, 2015

2014

A random testing approach using pushdown automata.

[BibT_eX]

[DOI]

Softw. Test. Verification Reliab., 2014

The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard.

[BibT_eX]

[DOI]

CoRR, 2014

Pseudorandom Number Generators with Balanced Gray Codes.

[BibT_eX]

[DOI]

Proceedings of the SECRYPT 2014, 2014

2013

Enhancing Approximations for Regular Reachability Analysis.

[BibT_eX]

[DOI]

Aloïs Dreyfus

Proceedings of the Implementation and Application of Automata, 2013

A Cryptographic Approach for Steganography.

[BibT_eX]

[DOI]

Jacques M. Bahi

Christophe Guyeux

Proceedings of the Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2013

Random Grammar-Based Testing for Covering All Non-terminals.

[BibT_eX]

[DOI]

Aloïs Dreyfus

Proceedings of the Sixth IEEE International Conference on Software Testing, 2013

2012

Loops and overloops for Tree-Walking Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On Positive TAGED with a Bounded Number of Constraints.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2012

From Linear Temporal Logic Properties to Rewrite Propositions.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011

On the complexity of computing the profinite closure of a rational language.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A Complexity Approach for Steganalysis

[BibT_eX]

[DOI]

Jacques M. Bahi

Christophe Guyeux

CoRR, 2011

A Random Testing Approach Using Pushdown Automata.

[BibT_eX]

[DOI]

Catherine Masson

Proceedings of the Tests and Proofs - 5th International Conference, 2011

Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing.

[BibT_eX]

[DOI]

Cyril Nicaud

Proceedings of the Fourth IEEE International Conference on Software Testing, 2011

Mutation-Based Test Generation from Security Protocols in HLPSL.

[BibT_eX]

[DOI]

Frédéric Dadeau

Rafik Kheddam

Proceedings of the Fourth IEEE International Conference on Software Testing, 2011

2010

Parametric random generation of deterministic tree automata.

[BibT_eX]

[DOI]

Cyril Nicaud

Sylvain Schmitz

Theor. Comput. Sci., 2010

Component simulation-based substitutivity managing QoS and composition issues.

[BibT_eX]

[DOI]

Jérôme Voinot

Sci. Comput. Program., 2010

SAT Solvers for Queries over Tree Automata with Constraints.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Software Testing, 2010

Model-Based Testing Using Symbolic Animation and Machine Learning.

[BibT_eX]

[DOI]

Pierre-Christophe Bué

Frédéric Dadeau

Proceedings of the Third International Conference on Software Testing, 2010

2009

Handling Non Left-Linear Rules when Completing Tree Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

On the Use of Uniform Random Generation of Automata for Testing.

[BibT_eX]

[DOI]

Frédéric Dadeau

Jocelyn Levrey

Proceedings of Fifth Workshop on Model Based Testing, 2009

Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives.

[BibT_eX]

[DOI]

Proceedings of the Joint Proceedings of the 8th, 2009

Composition of Services with Constraints.

[BibT_eX]

[DOI]

Proceedings of the 6th International Workshop on Formal Aspects of Component Software, 2009

Random Generation of Deterministic Tree (Walking) Automata.

[BibT_eX]

[DOI]

Cyril Nicaud

Sylvain Schmitz

Proceedings of the Implementation and Application of Automata, 2009

TAGED Approximations for Temporal Properties Model-Checking.

[BibT_eX]

[DOI]

Roméo Courbis

Proceedings of the Implementation and Application of Automata, 2009

How to Tackle Integer Weighted Automata Positivity.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems, 3rd International Workshop, 2009

Automates finis pour la fiabilité logicielle et l'analyse d'accessibilité. (Finite Automata for Software Realiability and Reachability Analyses).

[BibT_eX]

[DOI]

, 2009

2008

Clôtures transitives de semi-commutations et model-checking régulier.

[BibT_eX]

[DOI]

Gérard Cécé

Yann Mainier

Tech. Sci. Informatiques, 2008

Approximation-based Tree Regular Model-Checking.

[BibT_eX]

Nord. J. Comput., 2008

Efficiency of automata in semi-commutation verification techniques.

[BibT_eX]

[DOI]

Gérard Cécé

Yann Mainier

RAIRO Theor. Informatics Appl., 2008

A note on partially ordered tree automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

A theoretical limit for safety verification techniques with regular fix-point computations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Component Simulation-based Substitutivity Managing QoS Aspects.

[BibT_eX]

[DOI]

Jérôme Voinot

Proceedings of the 5th International Workshop on Formal Aspects of Component Software, 2008

Handling Left-Quadratic Rules When Completing Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008

Finer Is Better: Abstraction Refinement for Rewriting Approximations.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

2007

How to Handle QoS Aspects in Web Services Substitutivity Verification.

[BibT_eX]

[DOI]

Jérôme Voinot

Proceedings of the 16th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises (WETICE 2007), 2007

2006

Handling Algebraic Properties in Automatic Analysis of Security Protocols.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2006

2005

The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 17th International Conference, 2005

2003

Some complexity results for polynomial rational expressions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

On Shuffle Ideals.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2002

2001

Some Topological Properties of Rational Sets.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2001

2000

A Lower Bound For Reversible Automata.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2000

Automata for Pro-V Topologies.

[BibT_eX]

[DOI]