 | 2011 |
| 34 |  | Pierre-Cyrille Héam,
Vincent Hugot,
Olga Kouchnarenko:
Loops and Overloops for Tree Walking Automata.
CIAA 2011: 166-177 |
| 33 |  | Frédéric Dadeau,
Pierre-Cyrille Héam,
Rafik Kheddam:
Mutation-Based Test Generation from Security Protocols in HLPSL.
ICST 2011: 240-248 |
| 32 |  | Pierre-Cyrille Héam,
Cyril Nicaud:
Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing.
ICST 2011: 60-69 |
| 31 |  | Pierre-Cyrille Héam,
Catherine Masson:
A Random Testing Approach Using Pushdown Automata.
TAP 2011: 119-133 |
| 30 |  | 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) |
| 29 |  | Jacques M. Bahi,
Christophe Guyeux,
Pierre-Cyrille Héam:
A Complexity Approach for Steganalysis
CoRR abs/1112.5245: (2011) |
| 28 |  | 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 |
| 27 |  | Pierre-Cyrille Héam,
Vincent Hugot,
Olga Kouchnarenko:
SAT Solvers for Queries over Tree Automata with Constraints.
ICST Workshops 2010: 343-348 |
| 26 |  | 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 |
| 25 |  | Pierre-Cyrille Héam,
Olga Kouchnarenko,
Jérôme Voinot:
Component Simulation-based Substitutivity Managing QoS Aspects.
Electr. Notes Theor. Comput. Sci. 260: 109-123 (2010) |
| 24 |  | Philippe Balbiani,
Fahima Cheikh Alili,
Pierre-Cyrille Héam,
Olga Kouchnarenko:
Composition of Services with Constraints.
Electr. Notes Theor. Comput. Sci. 263: 31-46 (2010) |
| 23 |  | 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) |
| 22 |  | 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 |
| 21 |  | Pierre-Cyrille Héam,
Cyril Nicaud,
Sylvain Schmitz:
Random Generation of Deterministic Tree (Walking) Automata.
CIAA 2009: 115-124 |
| 20 |  | Roméo Courbis,
Pierre-Cyrille Héam,
Olga Kouchnarenko:
TAGED Approximations for Temporal Properties Model-Checking.
CIAA 2009: 135-144 |
| 19 |  | Yohan Boichut,
Pierre-Cyrille Héam,
Olga Kouchnarenko:
How to Tackle Integer Weighted Automata Positivity.
RP 2009: 79-92 |
| 18 |  | Yohan Boichut,
Pierre-Cyrille Héam,
Olga Kouchnarenko:
Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives.
Electr. Notes Theor. Comput. Sci. 239: 57-72 (2009) |
| 17 |  | Frédéric Dadeau,
Jocelyn Levrey,
Pierre-Cyrille Héam:
On the Use of Uniform Random Generation of Automata for Testing.
Electr. Notes Theor. Comput. Sci. 253(2): 37-51 (2009) |
| 16 |  | 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 |
| 15 |  | Yohan Boichut,
Roméo Courbis,
Pierre-Cyrille Héam,
Olga Kouchnarenko:
Finer Is Better: Abstraction Refinement for Rewriting Approximations.
RTA 2008: 48-62 |
| 14 |  | Yohan Boichut,
Roméo Courbis,
Pierre-Cyrille Héam,
Olga Kouchnarenko:
Handling Left-Quadratic Rules When Completing Tree Automata.
Electr. Notes Theor. Comput. Sci. 223: 61-70 (2008) |
| 13 |  | Gérard Cécé,
Pierre-Cyrille Héam,
Yann Mainier:
Efficiency of automata in semi-commutation verification techniques.
ITA 42(2): 197-215 (2008) |
| 12 |  | 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) |
| 11 |  | Pierre-Cyrille Héam:
A note on partially ordered tree automata.
Inf. Process. Lett. 108(4): 242-246 (2008) |
| 10 |  | Yohan Boichut,
Pierre-Cyrille Héam,
Olga Kouchnarenko:
Approximation-based Tree Regular Model-Checking.
Nord. J. Comput. 14(3): 216-241 (2008) |
| 9 |  | Gérard Cécé,
Pierre-Cyrille Héam,
Yann Mainier:
Clôtures transitives de semi-commutations et model-checking régulier.
Technique et Science Informatiques 27(1-2): 7-28 (2008) |
| 2007 |
| 8 |  | 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 |
| 7 |  | Yohan Boichut,
Pierre-Cyrille Héam,
Olga Kouchnarenko:
Handling Algebraic Properties in Automatic Analysis of Security Protocols.
ICTAC 2006: 153-167 |
| 2005 |
| 6 |  | 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 |
| 2003 |
| 5 |  | Pierre-Cyrille Héam:
Some complexity results for polynomial rational expressions.
Theor. Comput. Sci. 1-3(299): 735-741 (2003) |
| 2002 |
| 4 |  | Pierre-Cyrille Héam:
On Shuffle Ideals.
ITA 36(4): 359-384 (2002) |
| 2001 |
| 3 |  | Pierre-Cyrille Héam:
Some Topological Properties of Rational Sets.
Journal of Automata, Languages and Combinatorics 6(3): 275-290 (2001) |
| 2000 |
| 2 |  | Pierre-Cyrille Héam:
Automata for Pro-V Topologies.
CIAA 2000: 135-144 |
| 1 |  | Pierre-Cyrille Héam:
A Lower Bound For Reversible Automata.
ITA 34(5): 331-341 (2000) |