Pierre-Cyrille Héam

Publication Activity (10 Years)

Years Active: 2000-2023
Publications (10 Years): 27

Top Topics

Security Protocols

Top Venues

Publications

Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam
Asymptotic Performance and Energy Consumption of SLACK. Euro-Par (2023)
Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam
List and shelf schedules for independent parallel tasks to minimize the energy consumption with discrete or continuous speeds. J. Parallel Distributed Comput. 174 (2023)
Edy Hourany, Bachir Habib, Abdallah Makhoul, Benoît Piranda, Julien Bourgeois, Pierre-Cyrille Héam
ELECTOR: Deterministic leader election algorithm for modular robots. SmartWorld/UIC/ScalCom/DigitalTwin/PriComp/Meta (2022)
Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam
Update on the Asymptotic Optimality of LPT. Euro-Par (2021)
Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam
Shelf schedules for independent moldable tasks to minimize the energy consumption. SBAC-PAD (2021)
Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam
A Comparison of Random Task Graph Generation Methods for Scheduling Problems. Euro-Par (2019)
Sylvain Contassot-Vivier, Jean-François Couchot, Mohammed Bakiri, Pierre-Cyrille Héam
Fast and robust PRNGs based on jumps in N-cubes for simulation, but not exclusively for that. HPCS (2019)
Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam
A Comparison of Random Task Graph Generation Methods for Scheduling Problems. CoRR (2019)
Julien Bernard, Pierre-Cyrille Héam, Olga Kouchnarenko
An Approximation-Based Approach for the Random Exploration of Large Models. TAP@STAF (2018)
Julien Bernard, Pierre-Cyrille Héam, Olga Kouchnarenko
An Approximation-based Approach for the Random Exploration of Large Models. CoRR (2018)
Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam
A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation. CoRR (2018)
Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam
A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation. HPCS (2018)
Sylvain Contassot-Vivier, Jean-François Couchot, Christophe Guyeux, Pierre-Cyrille Héam
Random Walk in a N-cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations. CoRR (2017)
Jean-François Couchot, Pierre-Cyrille Héam, Christophe Guyeux, Qianxue Wang, Jacques M. Bahi
Traversing a n-cube without Balanced Hamiltonian Cycle to Generate Pseudorandom Numbers. CoRR (2017)
Jacques M. Bahi, Christophe Guyeux, Pierre-Cyrille Héam
A Cryptographic Approach for Steganography. CoRR (2017)
Sylvain Contassot-Vivier, Jean-François Couchot, Christophe Guyeux, Pierre-Cyrille Héam
Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations. Int. J. Bifurc. Chaos 27 (1) (2017)
Louis-Claude Canon, Pierre-Cyrille Héam, Laurent Philippe
Controlling the correlation of cost matrices to assess scheduling algorithm performance on heterogeneous platforms. Concurr. Comput. Pract. Exp. 29 (15) (2017)
Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard. Inf. Process. Lett. 118 (2017)
Louis-Claude Canon, Pierre-Cyrille Héam, Laurent Philippe
Controlling and Assessing Correlations of Cost Matrices in Heterogeneous Scheduling. Euro-Par (2016)
Pierre-Cyrille Héam, Frédéric Dadeau, Rafik Kheddam, Ghazi Maatoug, Michaël Rusinowitch
A Model-Based Testing Approach for Security Protocols. CSE/EUC/DCABES (2016)
Pierre-Cyrille Héam, Jean-Luc Joly
Random Generation and Enumeration of Accessible Determinisitic Real-time Pushdown Automata. CoRR (2015)
Pierre-Cyrille Héam, Hana M'Hemdi
Covering both stack and states while testing push-down systems. ICST Workshops (2015)
Pierre-Cyrille Héam, Jean-Luc Joly
On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism. CoRR (2015)
Frédéric Dadeau, Pierre-Cyrille Héam, Rafik Kheddam, Ghazi Maatoug, Michaël Rusinowitch
Model-based mutation testing from security protocols in HLPSL. Softw. Test. Verification Reliab. 25 (5-7) (2015)
Christophe Guyeux, Raphaël Couturier, Pierre-Cyrille Héam, Jacques M. Bahi
Efficient and cryptographically secure generation of chaotic pseudorandom numbers on GPU. J. Supercomput. 71 (10) (2015)
Pierre-Cyrille Héam, Jean-Luc Joly
On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism. CIAA (2015)
Pierre-Cyrille Héam, Jean-Luc Joly
Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata. CIAA (2015)
Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard. CoRR (2014)
Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko, Catherine Masson
A random testing approach using pushdown automata. Softw. Test. Verification Reliab. 24 (8) (2014)
Jean-François Couchot, Pierre-Cyrille Héam, Christophe Guyeux, Qianxue Wang, Jacques M. Bahi
Pseudorandom Number Generators with Balanced Gray Codes. SECRYPT (2014)
Jacques M. Bahi, Christophe Guyeux, Pierre-Cyrille Héam
A Cryptographic Approach for Steganography. IIH-MSP (2013)
Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko
Enhancing Approximations for Regular Reachability Analysis. CIAA (2013)
Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko
Random Grammar-Based Testing for Covering All Non-terminals. ICST Workshops (2013)
Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko
Random Grammar-based Testing for Covering All Non-Terminals. CoRR (2013)
Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko
Enhancing Approximations for Regular Reachability Analysis. CoRR (2013)
Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
From Linear Temporal Logic Properties to Rewrite Propositions. IJCAR (2012)
Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
Loops and overloops for Tree-Walking Automata. Theor. Comput. Sci. 450 (2012)
Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
On Positive TAGED with a Bounded Number of Constraints. CIAA (2012)
Frédéric Dadeau, Pierre-Cyrille Héam, Rafik Kheddam
Mutation-Based Test Generation from Security Protocols in HLPSL. ICST (2011)
Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
Loops and Overloops for Tree Walking Automata. CIAA (2011)
Pierre-Cyrille Héam, Catherine Masson
A Random Testing Approach Using Pushdown Automata. TAP@TOOLS (2011)
Pierre-Cyrille Héam, Cyril Nicaud
Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing. ICST (2011)
Jacques M. Bahi, Raphaël Couturier, Christophe Guyeux, Pierre-Cyrille Héam
Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU CoRR (2011)
Jacques M. Bahi, Christophe Guyeux, Pierre-Cyrille Héam
A Complexity Approach for Steganalysis CoRR (2011)
Pierre-Cyrille Héam
On the complexity of computing the profinite closure of a rational language. Theor. Comput. Sci. 412 (41) (2011)
Pierre-Cyrille Héam, Olga Kouchnarenko, Jérôme Voinot
Component Simulation-based Substitutivity Managing QoS Aspects. Electron. Notes Theor. Comput. Sci. 260 (2010)
Philippe Balbiani, Fahima Cheikh Alili, Pierre-Cyrille Héam, Olga Kouchnarenko
Composition of Services with Constraints. Electron. Notes Theor. Comput. Sci. 263 (2010)
Pierre-Cyrille Héam, Olga Kouchnarenko, Jérôme Voinot
Component simulation-based substitutivity managing QoS and composition issues. Sci. Comput. Program. 75 (10) (2010)
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz
Parametric random generation of deterministic tree automata. Theor. Comput. Sci. 411 (38-39) (2010)
Pierre-Christophe Bué, Frédéric Dadeau, Pierre-Cyrille Héam
Model-Based Testing Using Symbolic Animation and Machine Learning. ICST Workshops (2010)
Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
SAT Solvers for Queries over Tree Automata with Constraints. ICST Workshops (2010)
Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko
TAGED Approximations for Temporal Properties Model-Checking. CIAA (2009)
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz
Random Generation of Deterministic Tree (Walking) Automata. CIAA (2009)
Frédéric Dadeau, Jocelyn Levrey, Pierre-Cyrille Héam
On the Use of Uniform Random Generation of Automata for Testing. Electron. Notes Theor. Comput. Sci. 253 (2) (2009)
Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
How to Tackle Integer Weighted Automata Positivity. RP (2009)
Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko
Handling Non Left-Linear Rules when Completing Tree Automata. Int. J. Found. Comput. Sci. 20 (5) (2009)
Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. INFINITY (2009)
Pierre-Cyrille Héam
A note on partially ordered tree automata. Inf. Process. Lett. 108 (4) (2008)
Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko
Handling Left-Quadratic Rules When Completing Tree Automata. Electron. Notes Theor. Comput. Sci. 223 (2008)
Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko
Finer Is Better: Abstraction Refinement for Rewriting Approximations. RTA (2008)
Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
Approximation-based Tree Regular Model-Checking. Nord. J. Comput. 14 (3) (2008)
Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier
Clôtures transitives de semi-commutations et model-checking régulier. Tech. Sci. Informatiques 27 (1-2) (2008)
Yohan Boichut, Pierre-Cyrille Héam
A theoretical limit for safety verification techniques with regular fix-point computations. Inf. Process. Lett. 108 (1) (2008)
Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier
Efficiency of automata in semi-commutation verification techniques. RAIRO Theor. Informatics Appl. 42 (2) (2008)
Pierre-Cyrille Héam, Olga Kouchnarenko, Jérôme Voinot
How to Handle QoS Aspects in Web Services Substitutivity Verification. WETICE (2007)
Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
Handling Algebraic Properties in Automatic Analysis of Security Protocols. ICTAC (2006)
Alessandro Armando, David A. Basin, Yohan Boichut, Yannick Chevalier, Luca Compagna, Jorge Cuéllar, Paul Hankes Drielsma, Pierre-Cyrille Héam, Olga Kouchnarenko, Jacopo Mantovani, Sebastian Mödersheim, David von Oheimb, Michaël Rusinowitch, Judson Santiago, Mathieu Turuani, Luca Viganò, Laurent Vigneron
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications. CAV (2005)
Pierre-Cyrille Héam
Some complexity results for polynomial rational expressions. Theor. Comput. Sci. 299 (1-3) (2003)
Pierre-Cyrille Héam
On Shuffle Ideals. RAIRO Theor. Informatics Appl. 36 (4) (2002)
Pierre-Cyrille Héam
Some Topological Properties of Rational Sets. J. Autom. Lang. Comb. 6 (3) (2001)
Pierre-Cyrille Héam
Automata for Pro-V Topologies. CIAA (2000)
Pierre-Cyrille Héam
A Lower Bound For Reversible Automata. RAIRO Theor. Informatics Appl. 34 (5) (2000)