Nombre de documents

56

CV de Pierre-Cyrille Heam


Rapport9 documents

  • Pierre-Cyrille Heam, Vincent Hugot, Olga Kouchnarenko. Random Generation of Positive TAGEDs wrt. the Emptiness Problem. [Research Report] RR-7441, INRIA. 2010, pp.43. <inria-00531350>
  • Pierre-Cyrille Heam, Cyril Nicaud. Seed: an easy to use random generator of recursive data structures for testing. [Research Report] 2009, pp.18. <inria-00528585>
  • Yohan Boichut, Pierre-Cyrille Heam. A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations. [Research Report] RR-6411, INRIA. 2008, pp.6. <inria-00204579v2>
  • Pierre-Cyrille Héam. Transitive Closures of Semi-commutation Relations on Regular omega-Languages. [Research Report] RR-6239, INRIA. 2007, pp.20. <inria-00158285v2>
  • Pierre-Cyrille Heam, Olga Kouchnarenko, Jérôme Voinot. Towards Formalizing QoS of Web Services with Weighted Automata. [Research Report] RR-6218, INRIA. 2007, pp.22. <inria-00154453v2>
  • Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko. Automatic Abstraction Generation : How to Make an Expert Verification Technique for Security Protocols available to Non-expert Users. [Research Report] RR-6039, INRIA. 2006, pp.21. <inria-00116918v2>
  • Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko. Handling Algebraic Properties in Automatic Analysis of Security Protocols. [Research Report] RR-5857, INRIA. 2006, pp.18. <inria-00070169>
  • Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko. Automatic Verification of Security Protocols Using Approximations. [Research Report] RR-5727, INRIA. 2005, pp.27. <inria-00070291>
  • Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier. Efficiency of Automata in Semi-Commutation Verification Techniques. [Research Report] RR-5001, INRIA. 2003, pp.20. <inria-00077039>

Article dans une revue16 documents

  • Frédéric Dadeau, Pierre-Cyrille Héam, Rafik Kheddam, Ghazi Maatoug, Michaël Rusinowitch. Model-based mutation testing from security protocols in HLPSL. Journal of Software Testing, Verification, and Reliability, John Wiley & Sons, 2015, pp.30. <10.1002/stvr.1531>. <hal-01090881>
  • Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko. Loops and Overloops for Tree-Walking Automata. Theoretical Computer Science, Elsevier, 2012, 450, pp.43--53. <hal-00939397>
  • Pierre-Cyrille Heam, Vincent Hugot, Olga Kouchnarenko. Loops and overloops for Tree Walking Automata. Theoretical Computer Science, Elsevier, 2012, Implementation and Application of Automata (CIAA 2011), 450, pp.43-53. <http://www.sciencedirect.com/science/article/pii/S0304397512003817>. <10.1016/j.tcs.2012.04.026>. <hal-00756514>
  • Pierre-Cyrille Heam. On the Complexity of Computing the Profinite Closure of a Rational Language. Theoretical Computer Science, Elsevier, 2011, 412 (41), pp.5808-5813. <http://www.sciencedirect.com/science/article/pii/S0304397511005494>. <10.1016/j.tcs.2011.06.022>. <hal-00641554>
  • Pierre-Cyrille Héam, Olga Kouchnarenko, Jérôme Voinot. Component Simulation-based Substitutivity Managing QoS and Composition Issues. Electronic Notes in Theoretical Computer Science, Elsevier, 2010, 260, pp.109--123. <10.1016/j.entcs.2009.12.034>. <hal-00561275>
  • Fahima Cheikh, Pierre-Cyrille Héam, Olga Kouchnarenko. Composition of Services with Constraints. Electronic Notes in Theoretical Computer Science, Elsevier, 2010, 236 (Special Issue, selected papers of FACS'09), pp.31--46. <10.1016/j.entcs.2010.05.003>. <hal-00560496>
  • Pierre-Cyrille Heam, Olga Kouchnarenko, Jérôme Voinot. Component Simulation-based Substitutivity Managing QoS and Composition Issues. Science of Computer Programming, Elsevier, 2010, 75 (10), pp.898-917. <10.1016/j.scico.2010.02.004>. <inria-00511466>
  • Pierre-Cyrille Heam, Cyril Nicaud, Sylvain Schmitz. Parametric Random Generation of Deterministic Tree Automata. Theoretical Computer Science, Elsevier, 2010, 411 (1), pp.3469--3480. <hal-00561274>
  • Frédéric Dadeau, Pierre-Cyrille Héam, Jocelyn Levrey. On the Use of Uniform Random Generation of Automata for Testing. Electronic Notes in Theoretical Computer Science, Elsevier, 2009, Proceedings of Fifth Workshop on Model Based Testing (MBT 2009), 253 (2), pp.37-51. <10.1016/j.entcs.2009.09.050>. <inria-00429236>
  • Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko. Handling Non Left-Linear Rules When Completing Tree Automata. International Journal of Foundations of Computer Science, World Scientific Publishing, 2009, 20 (5), pp.837--849. <10.1142/S0129054109006917>. <hal-00561373>
  • Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko. Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. Electronic Notes in Theoretical Computer Science, Elsevier, 2009, 239, pp.57--72. <10.1016/j.entcs.2009.05.030>. <hal-00561374>
  • Yohan Boichut, Pierre-Cyrille Heam, Olga Kouchnarenko. Approximation based tree regular model checking. Nordic Journal of Computing, Publishing Association Nordic Journal of Computing, 2008, 14, pp.216-241. <inria-00429345>
  • Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier. Efficiency of Automata in Semi-Commutation Verification Techniques. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2008, 42 (2), pp.197--215. <10.1051/ita:2007029>. <hal-00563430>
  • Pierre-Cyrille Héam. A Note on Partially Ordered Tree Automata. Information Processing Letters, Elsevier, 2008, 108 (4), pp.242--246. <10.1016/j.ipl.2008.05.012>. <hal-00561271>
  • Yohan Boichut, Pierre-Cyrille Heam. A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations. Information Processing Letters, Elsevier, 2008, 108 (1), pp.1-2. <10.1016/j.ipl.2008.03.012>. <inria-00328487>
  • Yohan Boichut, Pierre-Cyrille Heam, Olga Kouchnarenko. Vérifier automatiquement les protocoles de sécurité. Techniques de l'Ingenieur, Techniques de l'ingénieur, 2007, pp.1-9. <inria-00181761>

Communication dans un congrès28 documents

  • Pierre-Cyrille Heam, Jean-Luc Joly. On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism. Frank Drewes. CIAA 2015, Aug 2015, Umea, Sweden. Springer, 9223, pp.12, 2015, Implementation and Application of Automata - 20th International Conference. <10.1007/978-3-319-22360-5_12>. <hal-01239735>
  • Alois Dreyfus, Pierre-Cyrille Heam, Olga Kouchnarenko. Random Grammar-based Testing for Covering All Non-Terminals. 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation - CSTVA Workshop, Mar 2013, Luxembourg, Luxembourg. IEEE, 2013, <http://www.computer.org/csdl/proceedings/icstw/2013/4993/00/4993a210-abs.html>. <hal-00909225>
  • Alois Dreyfus, Pierre-Cyrille Heam, Olga Kouchnarenko. Enhancing Approximations for Regular Reachability Analysis. Stavros Konstantinidis. CIAA 2013 - 18th International Conference on Implementation and Application of Automata - 2013, Jul 2013, Halifax, Canada. Springer, 7982, pp.331-339, 2013, Lecture Notes in Computer Science. <http://link.springer.com/chapter/10.1007%2F978-3-642-39274-0_29>. <10.1007/978-3-642-39274-0_29>. <hal-00909204>
  • Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko. Random Grammar-Based Testing for Covering All Non-terminals. CSTVA 2013, 5-th Int. Workshop on Constraints in Software Testing Verification and Analysis. Held in conjunction with ICST 2013, Jan 2013, Luxembourg. pp.210 - 215, 2013. <hal-00940429>
  • Jacques Bahi, Christophe Guyeux, Pierre-Cyrille Héam. A Cryptographic Approach for Steganography. IIHMSP'13, 9th Int. Conf. on Intelligent Information Hiding and Multimedia Signal Processing, Jan 2013, China. pp.IIHMSP-2013-0048, 2013. <hal-00931972>
  • Pierre-Cyrille Heam, Vincent Hugot, Olga Kouchnarenko. On Positive TAGED with a Bounded Number of Constraints. CIAA - 17th International Conference on Implementation and Application of Automata 2012, Jul 2012, Porto, Portugal. Springer, 7381, pp.329-336, 2012, Lecture Notes in Computer Science. <http://link.springer.com/chapter/10.1007/978-3-642-31606-7_29>. <10.1007/978-3-642-31606-7_29>. <hal-00756564>
  • Pierre-Cyrille Heam, Vincent Hugot, Olga Kouchnarenko. From Linear Temporal Logic Properties to Rewrite Propositions. IJCAR - International Joint Conference on Automated Reasonning 2012, Jun 2012, Manchester, United Kingdom. Springer, 7364, pp.316-331, 2012, Lecture Notes in Computer Science; Automated Reasoning. <http://link.springer.com/chapter/10.1007%2F978-3-642-31365-3_25?LI=true>. <10.1007/978-3-642-31365-3_25>. <hal-00756598>
  • Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko. From Linear Temporal Logic Properties to Rewrite Propositions. IJCAR 2012, 6th Int. Joint Conf. on Automated Reasoning, Jan 2012, United Kingdom. pp.316-331, 2012. <hal-00956586>
  • Frédéric Dadeau, Pierre-Cyrille Héam, Rafik Kheddam. Mutation-Based Test Generation from Security Protocols in HLPSL. Harman, Mark and Korel, Bodgan. 4th International Conference on Software Testing Verification and Validation (ICST'2011), Mar 2011, Berlin, Germany. IEEE Computer Society Press, 2011, ICST 2011, 4th Int. Conf. on Software Testing, Verification and Validation. <10.1109/ICST.2011.42>. <inria-00559850>
  • Pierre-Cyrille Heam, Vincent Hugot, Olga Kouchnarenko. Loops and Overloops for Tree Walking Automata. Béatrice Bouchou-Markhoff and Pascal Caron and Jean-Marc Champarnaud and Denis Maurel. 16th International Conference on Implementation and Application of Automata - CIAA 2011, Jul 2011, Blois, France. Springer, 6807, pp.166-177, 2011, Lecture Notes in Computer Science; Implementation and Application of Automata. <http://www.springerlink.com/content/h290628683x8m067/?CFID=57598311&CFTOKEN=33561544>. <10.1007/978-3-642-22256-6_16>. <hal-00641743>
  • Pierre-Cyrille Heam, Catherine Masson. A Random Testing Approach Using Pushdown Automata. Martin Gogolla and Burkhart Wolff. 5th International Conference on Tests and Proofs - TAP 2011, Jun 2011, Zurich, Switzerland. Springer, 6706, pp.119-133, 2011, Lecture Notes in Computer Science; Tests and Proofs. <http://www.springerlink.com/content/k2m77g7055876421/>. <10.1007/978-3-642-21768-5_10>. <hal-00641750>
  • Pierre-Cyrille Héam, Cyril Nicaud. Seed, an Easy-to-Use Random Generator of Recursive Data Structures for Testing. 4th IEEE International Conference on Software Testing, Verification and Validation (ICST'11), Mar 2011, Berlin, Germany. IEEE, pp.60 - 69, 2011, <10.1109/ICST.2011.31>. <hal-00620373>
  • Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko. {SAT} Solvers for Queries over Tree Automata with Constraints. CSTVA'10, 2nd Int. Workshop on Constraints in Software Testing Verification and Analysis - co-located with ICST'2010, 2010, France. 2010. <hal-00563313>
  • Pierre-Christophe Bué, Frédéric Dadeau, Pierre-Cyrille Héam. Model-Based Testing using Symbolic Animation and Machine Learning. CSTVA'10, 2nd Int. Workshop on Constraints in Software Testing Verification and Analysis - co-located with ICST'2010, 2010, France. pp.355--360, 2010. <hal-00662918>
  • Roméo Courbis, Pierre-Cyrille Heam, Pierre Jourdan, Olga Kouchnarenko. Approximations par réécriture pour deux problèmes indécidables. Yamine Aït-Ameur. AFADL, Jun 2010, Poitiers, France. 10, pp.7, 2010. <hal-00530341>
  • Adrian Caciula, Roméo Courbis, Violeta Felea, Pierre-Cyrille Heam, Rasvan Ionescu. Une approche parallèle et distribuée pour la complétion d'automates d'arbre. Yamine Aït-Ameur. 10es Journées Francophones Internationales sur les Approches Formelles dans l'Assistance au Développement de Logiciels - AFADL 2010, Jun 2010, Poitiers, France. 10, pp.43, 2010. <hal-00530350>
  • Pierre-Christophe Bué, Frédéric Dadeau, Pierre-Cyrille Héam. Model-Based Testing using Symbolic Animation and Machine Learning. Fraser, Gordon and Gotlieb, Arnaud and Michel, Claude and Pretschner, Alexander. 2nd Workshop on Constraints in Software Testing, Verification, and Analysis - CSTVA'2010, Apr 2010, Paris, France. IEEE Press, 2010, Software Testing, Verification, and Validation Workshops (ICSTW), 2010 Third International Conference on Software Testing, Verification, and Validation. <10.1109/ICSTW.2010.43>. <inria-00532977>
  • Roméo Courbis, Pierre-Cyrille Heam, Olga Kouchnarenko. TAGED Approximations for Temporal Properties Model-Checking. Proceedings of the 14th International Conference on Implementation and Application of Automata - CIAA'09, Jul 2009, Sydney, Australia. 2009. <inria-00380048>
  • Yohan Boichut, Pierre-Cyrille Heam, Olga Kouchnarenko. How to Tackle Integer Weighted Automata Positivity. Olivier Bournez and Igor Potapov. 3rd InternationalWorkshop on Reachability Problems - RP 2009, Sep 2009, Palaiseau, France. Springer -Verlag, 5797, pp.79-92, 2009, Lecture Notes in Computer Science; Reachability Problems. <10.1007/978-3-642-04420-5_9>. <inria-00428998>
  • Philippe Balbiani, Fahima Cheikh, Pierre-Cyrille Heam, Olga Kouchnarenko. Composition of services with constraints. Formal Aspects of Component Software, Nov 2009, Eindhoven, Netherlands. 263, pp. 31-46, 2010, Electronic Notes in Theoretical Computer Science. <10.1016/j.entcs.2010.05.003>. <hal-00429876>
  • Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz. Random Generation of Deterministic Tree (Walking) Automata. Sebastian Maneth. 14th International Conference on Implementation and Application of Automata - CIAA 2009, Jul 2009, Sydney, Australia. Springer-Verlag, 5642, pp.115--124, 2009, Lecture Notes in Computer Science; Implementation and Application of Automata. <10.1007/978-3-642-02979-0_15>. <inria-00408316>
  • Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko. Finer is better: Abstraction Refinement for Rewriting Approximations. Andrei Voronkov. RTA'08, 19th international conference on Rewriting Techniques and Applications, Jul 2008, Hagenberg, Austria. Springer, 5117, pp.48--62, 2008, Lecture Notes in Computer Science. <10.1007/978-3-540-70590-1>. <hal-00563422>
  • Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko. Handling Left-Quadratic Rules When Completing Tree Automata. 2nd Workshop on Reachability Problems in Computational Models - RP'08, Sep 2008, Liverpool, United Kingdom. Elsevier, 223, pp.61--70, 2008, Electronic Notes in Theoretical Computer Science. <10.1016/j.entcs.2008.12.031>. <hal-00563293>
  • Pierre-Cyrille Heam, Olga Kouchnarenko, Jérôme Voinot. Component Simulation-based Substitutivity Managing QoS Aspects. Carlos Canal and Corina Pasareanu. Formal Aspects On Component Softwre - FACS'08, Sep 2008, Malaga, Spain. 260 (2010), pp.109-123, 2010, Electr. Notes Theor. Comput. Sci. <10.1016/j.entcs.2009.12.034>. <inria-00329909>
  • Yohan Boichut, Pierre-Cyrille Heam, Olga Kouchnarenko. Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. 9th International Workshop on Verification of Infinite-State Systems - INFINITY'07, 2007, Lisbonnes, Portugal. 239, pp.57-72, 2009. <inria-00429356>
  • Pierre-Cyrille Heam, Olga Kouchnarenko, Jérôme Voinot. How to Handle QoS Aspects in Web Services Substitutivity Verification. 16th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises - WETICE 2007, Jun 2007, Paris, France. 2007. <inria-00181763>
  • Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko. Handling Algebraic Properties in Automatic Analysis of Security Protocols. ICTAC'2006, Nov 2006, Tunis, Tunisia. pp.153-167, 2006. <hal-00463424>
  • Alessandro Armando, David Basin, Yohan Boichut, Yannick Chevalier, Luca Compagna, et al.. The AVISPA Tool for the automated validation of internet security protocols and applications. Kousha Etessami and Sriram K. Rajamani. 17th International Conference on Computer Aided Verification - CAV 2005, Jul 2005, Edinburgh, Scotland/UK, France. Springer, 3576, pp.281-285, 2005, Lecture Notes in Computer Science. <inria-00000408>

HDR1 document

  • Pierre-Cyrille Heam. Automates finis pour la fiabilité logicielle et l'analyse d'accessibilité. Informatique [cs]. Université de Franche-Comté, 2009. <tel-00432301>

Autre publication2 documents

  • Alois Dreyfus, Pierre-Cyrille Heam, Olga Kouchnarenko, Catherine Masson. A Random Testing Approach Using Pushdown Automata. submitted (minor revision required). 2013. <hal-00912392>
  • Pierre-Cyrille Heam, Vincent Hugot, Olga Kouchnarenko. From Linear Temporal Logic Properties to Rewrite Propositions. Work document. 2011. <hal-00643416>