default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre-Cyrille Héam
Person information
- affiliation: Université de Franche-Comté, Besançon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2009
[b1]Pierre-Cyrille Héam:
Automates finis pour la fiabilité logicielle et l'analyse d'accessibilité. (Finite Automata for Software Realiability and Reachability Analyses). University of Franche-Comté, France, 2009
Journal Articles
- 2023
- [j21]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: 100-117 (2023) - 2017
- [j20]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) - [j19]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): 1750014:1-1750014:18 (2017) - [j18]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: 6-9 (2017) - 2015
- [j17]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): 684-711 (2015) - [j16]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): 3877-3903 (2015) - 2014
- [j15]Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko, Catherine Masson:
A random testing approach using pushdown automata. Softw. Test. Verification Reliab. 24(8): 656-683 (2014) - 2012
- [j14]Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
Loops and overloops for Tree-Walking Automata. Theor. Comput. Sci. 450: 43-53 (2012) - 2011
- [j13]Pierre-Cyrille Héam:
On the complexity of computing the profinite closure of a rational language. Theor. Comput. Sci. 412(41): 5808-5813 (2011) - 2010
- [j12]Pierre-Cyrille Héam, Olga Kouchnarenko, Jérôme Voinot:
Component simulation-based substitutivity managing QoS and composition issues. Sci. Comput. Program. 75(10): 898-917 (2010) - [j11]Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz:
Parametric random generation of deterministic tree automata. Theor. Comput. Sci. 411(38-39): 3469-3480 (2010) - 2009
- [j10]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): 837-849 (2009) - 2008
- [j9]Yohan Boichut, Pierre-Cyrille Héam:
A theoretical limit for safety verification techniques with regular fix-point computations. Inf. Process. Lett. 108(1): 1-2 (2008) - [j8]Pierre-Cyrille Héam:
A note on partially ordered tree automata. Inf. Process. Lett. 108(4): 242-246 (2008) - [j7]Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier:
Efficiency of automata in semi-commutation verification techniques. RAIRO Theor. Informatics Appl. 42(2): 197-215 (2008) - [j6]Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko:
Approximation-based Tree Regular Model-Checking. Nord. J. Comput. 14(3): 216-241 (2008) - [j5]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): 7-28 (2008) - 2003
- [j4]Pierre-Cyrille Héam:
Some complexity results for polynomial rational expressions. Theor. Comput. Sci. 299(1-3): 735-741 (2003) - 2002
- [j3]Pierre-Cyrille Héam:
On Shuffle Ideals. RAIRO Theor. Informatics Appl. 36(4): 359-384 (2002) - 2001
- [j2]Pierre-Cyrille Héam:
Some Topological Properties of Rational Sets. J. Autom. Lang. Comb. 6(3): 275-290 (2001) - 2000
- [j1]Pierre-Cyrille Héam:
A Lower Bound For Reversible Automata. RAIRO Theor. Informatics Appl. 34(5): 331-341 (2000)
Conference and Workshop Papers
- 2023
- [c38]Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam:
Asymptotic Performance and Energy Consumption of SLACK. Euro-Par 2023: 81-95 - 2022
- [c37]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: 1551-1559 - 2021
- [c36]Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam:
Update on the Asymptotic Optimality of LPT. Euro-Par 2021: 55-69 - [c35]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: 126-136 - 2019
- [c34]Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam:
A Comparison of Random Task Graph Generation Methods for Scheduling Problems. Euro-Par 2019: 61-73 - [c33]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: 650-657 - 2018
- [c32]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: 460-467 - [c31]Julien Bernard, Pierre-Cyrille Héam, Olga Kouchnarenko:
An Approximation-Based Approach for the Random Exploration of Large Models. TAP@STAF 2018: 27-43 - 2016
- [c30]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: 553-556 - [c29]Louis-Claude Canon, Pierre-Cyrille Héam, Laurent Philippe:
Controlling and Assessing Correlations of Cost Matrices in Heterogeneous Scheduling. Euro-Par 2016: 133-145 - 2015
- [c28]Pierre-Cyrille Héam, Hana M'Hemdi:
Covering both stack and states while testing push-down systems. ICST Workshops 2015: 1-7 - [c27]Pierre-Cyrille Héam, Jean-Luc Joly:
On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism. CIAA 2015: 140-152 - [c26]Pierre-Cyrille Héam, Jean-Luc Joly:
Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata. CIAA 2015: 153-164 - 2014
- [c25]Jean-François Couchot, Pierre-Cyrille Héam, Christophe Guyeux, Qianxue Wang, Jacques M. Bahi:
Pseudorandom Number Generators with Balanced Gray Codes. SECRYPT 2014: 469-475 - 2013
- [c24]Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko:
Random Grammar-Based Testing for Covering All Non-terminals. ICST Workshops 2013: 210-215 - [c23]Jacques M. Bahi, Christophe Guyeux, Pierre-Cyrille Héam:
A Cryptographic Approach for Steganography. IIH-MSP 2013: 518-521 - [c22]Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko:
Enhancing Approximations for Regular Reachability Analysis. CIAA 2013: 331-339 - 2012
- [c21]Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
From Linear Temporal Logic Properties to Rewrite Propositions. IJCAR 2012: 316-331 - [c20]Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
On Positive TAGED with a Bounded Number of Constraints. CIAA 2012: 329-336 - 2011
- [c19]Pierre-Cyrille Héam, Cyril Nicaud:
Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing. ICST 2011: 60-69 - [c18]Frédéric Dadeau, Pierre-Cyrille Héam, Rafik Kheddam:
Mutation-Based Test Generation from Security Protocols in HLPSL. ICST 2011: 240-248 - [c17]Pierre-Cyrille Héam, Catherine Masson:
A Random Testing Approach Using Pushdown Automata. TAP@TOOLS 2011: 119-133 - [c16]Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
Loops and Overloops for Tree Walking Automata. CIAA 2011: 166-177 - 2010
- [c15]Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
SAT Solvers for Queries over Tree Automata with Constraints. ICST Workshops 2010: 343-348 - [c14]Pierre-Christophe Bué, Frédéric Dadeau, Pierre-Cyrille Héam:
Model-Based Testing Using Symbolic Animation and Machine Learning. ICST Workshops 2010: 355-360 - 2009
- [c13]Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko:
How to Tackle Integer Weighted Automata Positivity. RP 2009: 79-92 - [c12]Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz:
Random Generation of Deterministic Tree (Walking) Automata. CIAA 2009: 115-124 - [c11]Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko:
TAGED Approximations for Temporal Properties Model-Checking. CIAA 2009: 135-144 - [c10]Philippe Balbiani, Fahima Cheikh Alili, Pierre-Cyrille Héam, Olga Kouchnarenko:
Composition of Services with Constraints. FACS@FMWeek 2009: 31-46 - [c9]Frédéric Dadeau, Jocelyn Levrey, Pierre-Cyrille Héam:
On the Use of Uniform Random Generation of Automata for Testing. MBT@ETAPS 2009: 37-51 - [c8]Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko:
Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. INFINITY 2009: 57-72 - 2008
- [c7]Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko:
Finer Is Better: Abstraction Refinement for Rewriting Approximations. RTA 2008: 48-62 - [c6]Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko:
Handling Left-Quadratic Rules When Completing Tree Automata. RP 2008: 61-70 - [c5]Pierre-Cyrille Héam, Olga Kouchnarenko, Jérôme Voinot:
Component Simulation-based Substitutivity Managing QoS Aspects. FACS 2008: 109-123 - 2007
- [c4]Pierre-Cyrille Héam, Olga Kouchnarenko, Jérôme Voinot:
How to Handle QoS Aspects in Web Services Substitutivity Verification. WETICE 2007: 333-338 - 2006
- [c3]Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko:
Handling Algebraic Properties in Automatic Analysis of Security Protocols. ICTAC 2006: 153-167 - 2005
- [c2]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: 281-285 - 2000
- [c1]Pierre-Cyrille Héam:
Automata for Pro-V Topologies. CIAA 2000: 135-144
Informal and Other Publications
- 2019
- [i13]Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam:
A Comparison of Random Task Graph Generation Methods for Scheduling Problems. CoRR abs/1902.05808 (2019) - 2018
- [i12]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 abs/1803.08121 (2018) - [i11]Julien Bernard, Pierre-Cyrille Héam, Olga Kouchnarenko:
An Approximation-based Approach for the Random Exploration of Large Models. CoRR abs/1806.04878 (2018) - 2017
- [i10]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 abs/1702.02533 (2017) - [i9]Jacques M. Bahi, Christophe Guyeux, Pierre-Cyrille Héam:
A Cryptographic Approach for Steganography. CoRR abs/1706.08752 (2017) - [i8]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 abs/1706.08923 (2017) - 2015
- [i7]Pierre-Cyrille Héam, Jean-Luc Joly:
On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism. CoRR abs/1512.02797 (2015) - [i6]Pierre-Cyrille Héam, Jean-Luc Joly:
Random Generation and Enumeration of Accessible Determinisitic Real-time Pushdown Automata. CoRR abs/1512.05881 (2015) - 2014
- [i5]Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard. CoRR abs/1412.0839 (2014) - 2013
- [i4]Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko:
Enhancing Approximations for Regular Reachability Analysis. CoRR abs/1311.6605 (2013) - [i3]Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko:
Random Grammar-based Testing for Covering All Non-Terminals. CoRR abs/1311.6606 (2013) - 2011
- [i2]Jacques M. Bahi, Raphaël Couturier, Christophe Guyeux, Pierre-Cyrille Héam:
Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU. CoRR abs/1112.5239 (2011) - [i1]Jacques M. Bahi, Christophe Guyeux, Pierre-Cyrille Héam:
A Complexity Approach for Steganalysis. CoRR abs/1112.5245 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
