Pierre-Cyrille Héam

77 papers A* 1A 3C 12Journal 37Unranked 23

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	An Ontology-Based Approach for Requirements and Change Impact Analysis in SysML Designs. SN Comput. Sci. Messaoud Rahim, Ahmed Hammad, Pierre-Cyrille Héam, Malika Boukala-Ioualalen
2026	J	`jnl`	An update on the asymptotic optimality of the longest processing time heuristic. J. Sched. Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam
2025	—	`conf`	Approximation Bounds for SLACK on Identical Parallel Machines. Euro-Par (1) Louis-Claude Canon, Anthony Dugois, Pierre-Cyrille Héam, Ismaël Jecker
2025	J	`jnl`	MCMC generation of cost matrices for scheduling performance evaluation. Future Gener. Comput. Syst. Louis-Claude Canon, Anthony Dugois, Mohamad El Sayah, Pierre-Cyrille Héam
2023	—	`conf`	Asymptotic Performance and Energy Consumption of SLACK. Euro-Par Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam
2023	J	`jnl`	List and shelf schedules for independent parallel tasks to minimize the energy consumption with discrete or continuous speeds. J. Parallel Distributed Comput. Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam
2022	—	`conf`	ELECTOR: Deterministic leader election algorithm for modular robots. SmartWorld/UIC/ScalCom/DigitalTwin/PriComp/Meta Edy Hourany, Bachir Habib, Abdallah Makhoul, Benoît Piranda, Julien Bourgeois, Pierre-Cyrille Héam
2021	C	`conf`	Shelf schedules for independent moldable tasks to minimize the energy consumption. SBAC-PAD Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam
2021	—	`conf`	Update on the Asymptotic Optimality of LPT. Euro-Par Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Héam
2019	—	`conf`	A Comparison of Random Task Graph Generation Methods for Scheduling Problems. Euro-Par Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam
2019	J	`jnl`	A Comparison of Random Task Graph Generation Methods for Scheduling Problems. CoRR Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam
2019	—	`conf`	Fast and robust PRNGs based on jumps in N-cubes for simulation, but not exclusively for that. HPCS Sylvain Contassot-Vivier, Jean-François Couchot, Mohammed Bakiri, Pierre-Cyrille Héam
2018	—	`conf`	A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation. HPCS Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam
2018	J	`jnl`	A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation. CoRR Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam
2018	—	`conf`	An Approximation-Based Approach for the Random Exploration of Large Models. TAP@STAF Julien Bernard, Pierre-Cyrille Héam, Olga Kouchnarenko
2018	J	`jnl`	An Approximation-based Approach for the Random Exploration of Large Models. CoRR Julien Bernard, Pierre-Cyrille Héam, Olga Kouchnarenko
2017	J	`jnl`	A Cryptographic Approach for Steganography. CoRR Jacques M. Bahi, Christophe Guyeux, Pierre-Cyrille Héam
2017	J	`jnl`	Controlling the correlation of cost matrices to assess scheduling algorithm performance on heterogeneous platforms. Concurr. Comput. Pract. Exp. Louis-Claude Canon, Pierre-Cyrille Héam, Laurent Philippe
2017	J	`jnl`	Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations. Int. J. Bifurc. Chaos Sylvain Contassot-Vivier, Jean-François Couchot, Christophe Guyeux, Pierre-Cyrille Héam
2017	J	`jnl`	Random Walk in a N-cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations. CoRR Sylvain Contassot-Vivier, Jean-François Couchot, Christophe Guyeux, Pierre-Cyrille Héam
2017	J	`jnl`	The emptiness problem for tree automata with at least one global disequality constraint is NP-hard. Inf. Process. Lett. Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
2017	J	`jnl`	Traversing a n-cube without Balanced Hamiltonian Cycle to Generate Pseudorandom Numbers. CoRR Jean-François Couchot, Pierre-Cyrille Héam, Christophe Guyeux, Qianxue Wang, Jacques M. Bahi
2016	—	`conf`	A Model-Based Testing Approach for Security Protocols. CSE/EUC/DCABES Pierre-Cyrille Héam, Frédéric Dadeau, Rafik Kheddam, Ghazi Maatoug, Michaël Rusinowitch
2016	—	`conf`	Controlling and Assessing Correlations of Cost Matrices in Heterogeneous Scheduling. Euro-Par Louis-Claude Canon, Pierre-Cyrille Héam, Laurent Philippe
2015	—	`conf`	Covering both stack and states while testing push-down systems. ICST Workshops Pierre-Cyrille Héam, Hana M'Hemdi
2015	J	`jnl`	Efficient and cryptographically secure generation of chaotic pseudorandom numbers on GPU. J. Supercomput. Christophe Guyeux, Raphaël Couturier, Pierre-Cyrille Héam, Jacques M. Bahi
2015	J	`jnl`	Model-based mutation testing from security protocols in HLPSL. Softw. Test. Verification Reliab. Frédéric Dadeau, Pierre-Cyrille Héam, Rafik Kheddam, Ghazi Maatoug, Michaël Rusinowitch
2015	C	`conf`	On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism. CIAA Pierre-Cyrille Héam, Jean-Luc Joly
2015	J	`jnl`	On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism. CoRR Pierre-Cyrille Héam, Jean-Luc Joly
2015	J	`jnl`	Random Generation and Enumeration of Accessible Determinisitic Real-time Pushdown Automata. CoRR Pierre-Cyrille Héam, Jean-Luc Joly
2015	C	`conf`	Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata. CIAA Pierre-Cyrille Héam, Jean-Luc Joly
2014	J	`jnl`	A random testing approach using pushdown automata. Softw. Test. Verification Reliab. Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko, Catherine Masson
2014	C	`conf`	Pseudorandom Number Generators with Balanced Gray Codes. SECRYPT Jean-François Couchot, Pierre-Cyrille Héam, Christophe Guyeux, Qianxue Wang, Jacques M. Bahi
2014	J	`jnl`	The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard. CoRR Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
2013	—	`conf`	A Cryptographic Approach for Steganography. IIH-MSP Jacques M. Bahi, Christophe Guyeux, Pierre-Cyrille Héam
2013	C	`conf`	Enhancing Approximations for Regular Reachability Analysis. CIAA Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko
2013	J	`jnl`	Enhancing Approximations for Regular Reachability Analysis. CoRR Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko
2013	—	`conf`	Random Grammar-Based Testing for Covering All Non-terminals. ICST Workshops Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko
2013	J	`jnl`	Random Grammar-based Testing for Covering All Non-Terminals. CoRR Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko
2012	A	`conf`	From Linear Temporal Logic Properties to Rewrite Propositions. IJCAR Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
2012	J	`jnl`	Loops and overloops for Tree-Walking Automata. Theor. Comput. Sci. Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
2012	C	`conf`	On Positive TAGED with a Bounded Number of Constraints. CIAA Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
2011	J	`jnl`	A Complexity Approach for Steganalysis CoRR Jacques M. Bahi, Christophe Guyeux, Pierre-Cyrille Héam
2011	—	`conf`	A Random Testing Approach Using Pushdown Automata. TAP@TOOLS Pierre-Cyrille Héam, Catherine Masson
2011	J	`jnl`	Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU CoRR Jacques M. Bahi, Raphaël Couturier, Christophe Guyeux, Pierre-Cyrille Héam
2011	C	`conf`	Loops and Overloops for Tree Walking Automata. CIAA Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
2011	A	`conf`	Mutation-Based Test Generation from Security Protocols in HLPSL. ICST Frédéric Dadeau, Pierre-Cyrille Héam, Rafik Kheddam
2011	J	`jnl`	On the complexity of computing the profinite closure of a rational language. Theor. Comput. Sci. Pierre-Cyrille Héam
2011	A	`conf`	Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing. ICST Pierre-Cyrille Héam, Cyril Nicaud
2010	J	`jnl`	Component simulation-based substitutivity managing QoS and composition issues. Sci. Comput. Program. Pierre-Cyrille Héam, Olga Kouchnarenko, Jérôme Voinot
2010	—	`conf`	Model-Based Testing Using Symbolic Animation and Machine Learning. ICST Workshops Pierre-Christophe Bué, Frédéric Dadeau, Pierre-Cyrille Héam
2010	J	`jnl`	Parametric random generation of deterministic tree automata. Theor. Comput. Sci. Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz
2010	—	`conf`	SAT Solvers for Queries over Tree Automata with Constraints. ICST Workshops Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
2009	—	`book`	Automates finis pour la fiabilité logicielle et l'analyse d'accessibilité. (Finite Automata for Software Realiability and Reachability Analyses). Pierre-Cyrille Héam
2009	—	`conf`	Composition of Services with Constraints. FACS@FMWeek Philippe Balbiani, Fahima Cheikh Alili, Pierre-Cyrille Héam, Olga Kouchnarenko
2009	J	`jnl`	Handling Non Left-Linear Rules when Completing Tree Automata. Int. J. Found. Comput. Sci. Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko
2009	—	`conf`	How to Tackle Integer Weighted Automata Positivity. RP Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
2009	—	`conf`	On the Use of Uniform Random Generation of Automata for Testing. MBT@ETAPS Frédéric Dadeau, Jocelyn Levrey, Pierre-Cyrille Héam
2009	C	`conf`	Random Generation of Deterministic Tree (Walking) Automata. CIAA Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz
2009	C	`conf`	TAGED Approximations for Temporal Properties Model-Checking. CIAA Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko
2009	—	`conf`	Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. INFINITY Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
2008	J	`jnl`	A note on partially ordered tree automata. Inf. Process. Lett. Pierre-Cyrille Héam
2008	J	`jnl`	A theoretical limit for safety verification techniques with regular fix-point computations. Inf. Process. Lett. Yohan Boichut, Pierre-Cyrille Héam
2008	J	`jnl`	Approximation-based Tree Regular Model-Checking. Nord. J. Comput. Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
2008	J	`jnl`	Clôtures transitives de semi-commutations et model-checking régulier. Tech. Sci. Informatiques Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier
2008	—	`conf`	Component Simulation-based Substitutivity Managing QoS Aspects. FACS Pierre-Cyrille Héam, Olga Kouchnarenko, Jérôme Voinot
2008	J	`jnl`	Efficiency of automata in semi-commutation verification techniques. RAIRO Theor. Informatics Appl. Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier
2008	—	`conf`	Finer Is Better: Abstraction Refinement for Rewriting Approximations. RTA Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko
2008	—	`conf`	Handling Left-Quadratic Rules When Completing Tree Automata. RP Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko
2007	C	`conf`	How to Handle QoS Aspects in Web Services Substitutivity Verification. WETICE Pierre-Cyrille Héam, Olga Kouchnarenko, Jérôme Voinot
2006	C	`conf`	Handling Algebraic Properties in Automatic Analysis of Security Protocols. ICTAC Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
2005	A*	`conf`	The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications. CAV 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
2003	J	`jnl`	Some complexity results for polynomial rational expressions. Theor. Comput. Sci. Pierre-Cyrille Héam
2002	J	`jnl`	On Shuffle Ideals. RAIRO Theor. Informatics Appl. Pierre-Cyrille Héam
2001	J	`jnl`	Some Topological Properties of Rational Sets. J. Autom. Lang. Comb. Pierre-Cyrille Héam
2000	J	`jnl`	A Lower Bound For Reversible Automata. RAIRO Theor. Informatics Appl. Pierre-Cyrille Héam
2000	C	`conf`	Automata for Pro-V Topologies. CIAA Pierre-Cyrille Héam