Pierre-Cyrille Héam

Affiliations:
  • Université de Franche-Comté, Besançon, France


According to our database1, Pierre-Cyrille Héam authored at least 60 papers between 2000 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Shelf schedules for independent moldable tasks to minimize the energy consumption.
Proceedings of the 33rd IEEE International Symposium on Computer Architecture and High Performance Computing, 2021

Update on the Asymptotic Optimality of LPT.
Proceedings of the Euro-Par 2021: Parallel Processing, 2021

2019
Fast and robust PRNGs based on jumps in N-cubes for simulation, but not exclusively for that.
Proceedings of the 17th International Conference on High Performance Computing & Simulation, 2019

A Comparison of Random Task Graph Generation Methods for Scheduling Problems.
Proceedings of the Euro-Par 2019: Parallel Processing, 2019

2018
An Approximation-Based Approach for the Random Exploration of Large Models.
Proceedings of the Tests and Proofs - 12th International Conference, 2018

A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation.
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.
Inf. Process. Lett., 2017

Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations.
Int. J. Bifurc. Chaos, 2017

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

Controlling the correlation of cost matrices to assess scheduling algorithm performance on heterogeneous platforms.
Concurr. Comput. Pract. Exp., 2017

2016
Controlling and Assessing Correlations of Cost Matrices in Heterogeneous Scheduling.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

A Model-Based Testing Approach for Security Protocols.
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.
J. Supercomput., 2015

Model-based mutation testing from security protocols in HLPSL.
Softw. Test. Verification Reliab., 2015

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

Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata.
Proceedings of the Implementation and Application of Automata, 2015

On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism.
Proceedings of the Implementation and Application of Automata, 2015

Covering both stack and states while testing push-down systems.
Proceedings of the Eighth IEEE International Conference on Software Testing, 2015

2014
A random testing approach using pushdown automata.
Softw. Test. Verification Reliab., 2014

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

Pseudorandom Number Generators with Balanced Gray Codes.
Proceedings of the SECRYPT 2014, 2014

2013
Enhancing Approximations for Regular Reachability Analysis.
Proceedings of the Implementation and Application of Automata, 2013

A Cryptographic Approach for Steganography.
Proceedings of the Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2013

Random Grammar-Based Testing for Covering All Non-terminals.
Proceedings of the Sixth IEEE International Conference on Software Testing, 2013

2012
Loops and overloops for Tree-Walking Automata.
Theor. Comput. Sci., 2012

On Positive TAGED with a Bounded Number of Constraints.
Proceedings of the Implementation and Application of Automata, 2012

From Linear Temporal Logic Properties to Rewrite Propositions.
Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011
On the complexity of computing the profinite closure of a rational language.
Theor. Comput. Sci., 2011

A Complexity Approach for Steganalysis
CoRR, 2011

A Random Testing Approach Using Pushdown Automata.
Proceedings of the Tests and Proofs - 5th International Conference, 2011

Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing.
Proceedings of the Fourth IEEE International Conference on Software Testing, 2011

Mutation-Based Test Generation from Security Protocols in HLPSL.
Proceedings of the Fourth IEEE International Conference on Software Testing, 2011

2010
Parametric random generation of deterministic tree automata.
Theor. Comput. Sci., 2010

Component simulation-based substitutivity managing QoS and composition issues.
Sci. Comput. Program., 2010

Component Simulation-based Substitutivity Managing QoS Aspects.
Electron. Notes Theor. Comput. Sci., 2010

Composition of Services with Constraints.
Electron. Notes Theor. Comput. Sci., 2010

SAT Solvers for Queries over Tree Automata with Constraints.
Proceedings of the Third International Conference on Software Testing, 2010

Model-Based Testing Using Symbolic Animation and Machine Learning.
Proceedings of the Third International Conference on Software Testing, 2010

2009
Handling Non Left-Linear Rules when Completing Tree Automata.
Int. J. Found. Comput. Sci., 2009

On the Use of Uniform Random Generation of Automata for Testing.
Electron. Notes Theor. Comput. Sci., 2009

Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives.
Proceedings of the Joint Proceedings of the 8th, 2009

Random Generation of Deterministic Tree (Walking) Automata.
Proceedings of the Implementation and Application of Automata, 2009

TAGED Approximations for Temporal Properties Model-Checking.
Proceedings of the Implementation and Application of Automata, 2009

How to Tackle Integer Weighted Automata Positivity.
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).
, 2009

2008
Clôtures transitives de semi-commutations et model-checking régulier.
Tech. Sci. Informatiques, 2008

Approximation-based Tree Regular Model-Checking.
Nord. J. Comput., 2008

Efficiency of automata in semi-commutation verification techniques.
RAIRO Theor. Informatics Appl., 2008

A note on partially ordered tree automata.
Inf. Process. Lett., 2008

A theoretical limit for safety verification techniques with regular fix-point computations.
Inf. Process. Lett., 2008

Handling Left-Quadratic Rules When Completing Tree Automata.
Electron. Notes Theor. Comput. Sci., 2008

Finer Is Better: Abstraction Refinement for Rewriting Approximations.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

2007
How to Handle QoS Aspects in Web Services Substitutivity Verification.
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.
Proceedings of the Theoretical Aspects of Computing, 2006

2005
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications.
Proceedings of the Computer Aided Verification, 17th International Conference, 2005

2003
Some complexity results for polynomial rational expressions.
Theor. Comput. Sci., 2003

2002
On Shuffle Ideals.
RAIRO Theor. Informatics Appl., 2002

2001
Some Topological Properties of Rational Sets.
J. Autom. Lang. Comb., 2001

2000
A Lower Bound For Reversible Automata.
RAIRO Theor. Informatics Appl., 2000

Automata for Pro-V Topologies.
Proceedings of the Implementation and Application of Automata, 2000


  Loading...