The AVISPA tool for the automated validation of internet security protocols and applications A Armando, D Basin, Y Boichut, Y Chevalier, L Compagna, J Cuéllar, ...
Computer Aided Verification: 17th International Conference, CAV 2005 …, 2005
1664 2005 Improvements on the Genet and Klay technique to automatically verify security protocols Y Boichut, PC Héam, O Kouchnarenko, F Oehl
Proc. AVIS 4, 84, 2004
99 2004 Mutation-based test generation from security protocols in HLPSL F Dadeau, PC Héam, R Kheddam
2011 Fourth IEEE International Conference on Software Testing, Verification …, 2011
53 2011 Automatic verification of security protocols using approximations Y Boichut, PC Héam, O Kouchnarenko
INRIA, 2005
47 2005 Efficient and cryptographically secure generation of chaotic pseudorandom numbers on gpu C Guyeux, R Couturier, PC Héam, JM Bahi
The journal of Supercomputing 71, 3877-3903, 2015
37 2015 Finer is better: Abstraction refinement for rewriting approximations Y Boichut, R Courbis, PC Héam, O Kouchnarenko
Rewriting Techniques and Applications: 19th International Conference, RTA …, 2008
31 2008 A comparison of random task graph generation methods for scheduling problems LC Canon, ME Sayah, PC Héam
Euro-Par 2019: Parallel Processing: 25th International Conference on …, 2019
30 2019 Approximation based tree regular model checking Y Boichut, PC Heam, O Kouchnarenko
Nordic Journal of Computing 14, 216-241, 2008
26 2008 A theoretical limit for safety verification techniques with regular fix-point computations Y Boichut, PC Héam
Information Processing Letters 108 (1), 1-2, 2008
24 2008 Handling algebraic properties in automatic analysis of security protocols Y Boichut, PC Héam, O Kouchnarenko
International Colloquium on Theoretical Aspects of Computing, 153-167, 2006
23 2006 Model‐based mutation testing from security protocols in HLPSL F Dadeau, PC Héam, R Kheddam, G Maatoug, M Rusinowitch
Software Testing, Verification and Reliability 25 (5-7), 684-711, 2015
22 2015 A lower bound for reversible automata PC Héam
RAIRO-Theoretical Informatics and Applications 34 (5), 331-341, 2000
17 2000 Tree automata for detecting attacks on protocols with algebraic cryptographic primitives Y Boichut, PC Héam, O Kouchnarenko
Electronic Notes in Theoretical Computer Science 239, 57-72, 2009
16 2009 Seed: An easy-to-use random generator of recursive data structures for testing PC Héam, C Nicaud
2011 Fourth IEEE International Conference on Software Testing, Verification …, 2011
15 2011 Component simulation-based substitutivity managing QoS and composition issues PC Héam, O Kouchnarenko, J Voinot
Science of Computer Programming 75 (10), 898-917, 2010
15 2010 Efficiency of automata in semi-commutation verification techniques G Cécé, PC Héam, Y Mainier
RAIRO-Theoretical Informatics and Applications 42 (2), 197-215, 2008
15 2008 On shuffle ideals PC Héam
RAIRO-Theoretical Informatics and Applications 36 (4), 359-384, 2002
14 2002 Random Walk in a -Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations S Contassot-Vivier, JF Couchot, C Guyeux, PC Heam
International Journal of Bifurcation and Chaos 27 (01), 1750014, 2017
13 2017 Pseudorandom number generators with balanced gray codes JF Couchot, PC Heam, C Guyeux, Q Wang, JM Bahi
2014 11th International Conference on Security and Cryptography (SECRYPT), 1-7, 2014
13 2014 How to handle qos aspects in web services substitutivity verification PC Héam, O Kouchnarenko, J Voinot
16th IEEE International Workshops on Enabling Technologies: Infrastructure …, 2007
13 2007