Back to INDEX

  Publications of Pierre-Cyrille Héam  

Articles in journal or book chapters
  1. Pierre-Cyrille Héam. On the Complexity of Computing the Profinite Closure of a Rational Language. Theoretical Computer Science, 412(41):5808--5813, 2011. [bibtex]


  2. Philippe Balbiani, Fahima Cheikh, Pierre-Cyrille Héam, and Olga Kouchnarenko. Composition of Services with Constraints. ENTCS, selected papers of FACS'09, 263:31--46, 2010. [bibtex]


  3. Pierre-Cyrille Héam, Olga Kouchnarenko, and Jérôme Voinot. Component Simulation-based Substitutivity Managing QoS Aspects. ENTCS, Electronic Notes Theoretical Computer Science, special issue on FACS'08 selected best papers, 260:109--123, 2010. [bibtex]


  4. Pierre-Cyrille Héam, Olga Kouchnarenko, and Jérôme Voinot. Component simulation-based substitutivity managing QoS and composition issues. Science of Computer Programming, 75(10):898--917, 2010. [bibtex]


  5. Pierre-Cyrille Héam, Cyril Nicaud, and Sylvain Schmitz. Parametric Random Generation of Deterministic Tree Automata. Theoretical Computer Science, 411:3469--3480, 2010. [bibtex]


  6. Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, and Olga Kouchnarenko. Handling Non Left-Linear Rules When Completing Tree Automata. IJFCS, Intern. Journal of Foundations of Computer Science, 20(5):837--849, 2009. [bibtex]


  7. Yohan Boichut, Pierre-Cyrille Héam, and Olga Kouchnarenko. Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. ENTCS, Electronic Notes in Theoretical Computer Science, 239:57--72, 2009. Note: Infinity 2006, 2007, 2008 Best papers. [bibtex]


  8. Yohan Boichut and Pierre-Cyrille Héam. A Theorerical Limit for Safety Verification Techniques with Regular Fix-point Computations. Information Processing Letters, 108:1--2, 2008. [bibtex]


  9. Yohan Boichut, Pierre-Cyrille Héam, and Olga Kouchnarenko. Approximation-based Tree Regular Model-Checking. Nordic Journal of Computing, 14:194--219, 2008. [bibtex]


  10. Gérard Cécé, Pierre-Cyrille Héam, and Yann Mainier. Clôtures transitives de semi-commutations et model-checking régulier. TSI, Technique et Science Informatiques, 27(1-2):7--28, 2008. [bibtex]


  11. Gérard Cécé, Pierre-Cyrille Héam, and Yann Mainier. Efficiency of Automata in Semi-Commutation Verification Techniques. RAIRO, Theoretical Informatics and Applications, 42(2):197--215, March 2008. [bibtex]


  12. Pierre-Cyrille Héam. A Note on Partially Ordered Tree Automata. Information Processing Letters, 108(4):242--246, 2008. [bibtex]


  13. Yohan Boichut, Pierre-Cyrille Héam, and Olga Kouchnarenko. Vérifier automatiquement les protocoles de sécurité. Techniques de l'ingénieur, pp 1--8, October 2007. Note: Référence TI : RE95. [bibtex]


  14. M. Delgado and Pierre-Cyrille Héam. A polynomial time algorithm to compute the abelian kernel of a finite monoid. Revue Internationale : Semigroup Forum, 67:97--110, 2003. [bibtex]


  15. Pierre-Cyrille Héam. Some complexity results for polynomial rational expressions. Theoretical Computer Science, 299:735--741, 2003. [bibtex]


  16. Pierre-Cyrille Héam. On Shuffle Ideals. Theoretical Informatics and Applications, 36:359--384, 2002. [bibtex]


  17. Pierre-Cyrille Héam. Some Topological Properties of Rational Sets. Journal of Automata, Languages and Combinatorics, 6:275--290, 2001. [bibtex]


  18. Pierre-Cyrille Héam. A lower bound for reversible automata. Theoretical Informatics and Applications, 34:331--341, 2000. [bibtex]


Conference articles
  1. Frédéric Dadeau, Pierre-Cyrille Héam, and Rafik Kheddam. Mutation-Based Test Generation from Security Protocols in HLPSL. In M. Harman and B. Korel, editors, ICST 2011, 4th Int. Conf. on Software Testing, Verification and Validation, Berlin, Germany, pages 240--248, March 2011. IEEE Computer Society Press. [bibtex]


  2. Pierre-Cyrille Héam, Vincent Hugot, and Olga Kouchnarenko. Loops and overloops for tree walking automata. In CIAA'11, 6-th Int. Conf. on Implementation and Application of Automata, volume 6807 of LNCS, Blois, France, pages 166--177, July 2011. Springer. [bibtex]


  3. Pierre-Cyrille Héam and Catherine Masson. A Random Testing Approach Using Pushdown Automata. In TAP'11, 5-th Int. Conf. of Tests and Proofs, volume 6706 of LNCS, Zurich, Switzerland, pages 119--133, June 2011. Springer. [bibtex]


  4. Pierre-Cyrille Héam and Cyril Nicaud. Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing. In ICST'11, 4-th IEEE Int. Conf. on Software Testing, Verification and Validation, Berlin, Germany, pages 60--69, March 2011. IEEE Computer Society. [bibtex]


  5. Pierre-Christophe Bué, Frédéric Dadeau, and Pierre-Cyrille Héam. Model-Based Testing using Symbolic Animation and Machine Learning. In CSTVA'10, 2nd Int. Workshop on Constraints in Software Testing Verification and Analysis - co-located with ICST'2010, Paris, France, pages 355--360, April 2010. IEEE Computer Society Press. [bibtex]


  6. A. Caciula, Roméo Courbis, Violeta Felea, Pierre-Cyrille Héam, and R. Ionescu. Une approche parallèle et distribuée pour la complétion d'automates d'arbre. In AFADL'10, Congrès Approches Formelles dans l'Assistance au Développement de Logiciels, Poitiers, France, pages 43--46, June 2010. Note: Papier court. [bibtex]


  7. Roméo Courbis, Pierre-Cyrille Héam, Pierre Jourdan, and Olga Kouchnarenko. Approximations par réécriture pour deux problèmes indécidables. In AFADL'10, Congrès Approches Formelles dans l'Assistance au Développement de Logiciels, Poitiers, France, pages 7--10, June 2010. Note: Papier court. [bibtex]


  8. Pierre-Cyrille Héam, Vincent Hugot, and Olga Kouchnarenko. SAT Solvers for Queries over Tree Automata with Constraints. In CSTVA'10, 2nd Int. Workshop on Constraints in Software Testing Verification and Analysis - co-located with ICST'2010, Paris, France, pages 343--348, April 2010. IEEE Computer Society Press. [bibtex]


  9. Yohan Boichut, Pierre-Cyrille Héam, and Olga Kouchnarenko. How to Tackle Integer Weighted Automata Positivity. In Olivier Bournez and Igor Potapov, editors, RP'09, 3rd Int. Workshop on Reachability Problems, volume 5797 of LNCS, Paris, France, pages 79--92, September 2009. Springer. [bibtex]


  10. Roméo Courbis, Pierre-Cyrille Héam, and Olga Kouchnarenko. TAGED Approximations for Temporal Properties Model-Checking. In Sebastian Maneth, editor, CIAA'09, 14th Int. Conf. and Application of Automata, volume 5642 of LNCS, Sydney, Australia, pages 135--144, July 2009. Springer. [bibtex]


  11. Frédéric Dadeau, Pierre-Cyrille Héam, and J. Levrey. On the Use of Uniform Random Generation of Automata for Testing. In B. Finkbeiner, Y. Gurevich, and A.K. Petrenko, editors, MBT'09 proceedings, volume 253-2 of ENTCS, Electronic Notes in Theoretical Computer Science, York, United Kingdom, pages 37--51, March 2009. [bibtex]


  12. Pierre-Cyrille Héam, Cyril Nicaud, and Sylvain Schmitz. Random Generation of Deterministic Tree (Walking) Automata. In CIAA'09, 14th Int. Conf. on Implementation and Application of Automata, volume 5642 of LNCS, Sidney, Australia, pages 115--124, July 2009. Springer. [bibtex]


  13. Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, and Olga Kouchnarenko. Finer is better: Abstraction Refinement for Rewriting Approximations. In A. Voronkov, editor, RTA'08, 19th int. conf. on Rewriting Techniques and Applications, volume 5117 of LNCS, Hagenberg, Austria, pages 48--62, July 2008. Springer. [bibtex]


  14. Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, and Olga Kouchnarenko. Handling Left-Quadratic Rules When Completing Tree Automata. In RP'08 proceedings, Workshop on Reachability Problems in Computational Models, volume 223 of ENTCS, Electronic Notes in Theoretical Computer Science, Liverpool, United Kingdom, pages 61--70, 2008. Elsevier. [bibtex]


  15. Yohan Boichut, Pierre-Cyrille Héam, and Olga Kouchnarenko. Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. In INFINITY'07, Int. Ws. on Verification of Infinite-State Systems, joint to CONCUR'07, Lisboa, Portugal, pages 44--53, September 2007. Note: The final version will be published in EN in Theoretical Computer Science, Elsevier. [bibtex]


  16. Pierre-Cyrille Héam, Olga Kouchnarenko, and Jérôme Voinot. How to Handle QoS Aspects in Web Services Substitutivity Verification. In WETICE'07, 16th IEEE Int. Workshop on Enabling Technologies: Infrastructures for Collaborative Enterprises, Paris, France, pages 333--338, June 2007. IEEE Computer Society Press. [bibtex]


  17. Yohan Boichut, Pierre-Cyrille Héam, and Olga Kouchnarenko. Handling Algebraic Properties in Automatic Analysis of Security Protocols. In ICTAC 2006, Int. Colloquium on Theoretical Aspects of Computing, volume 4281 of LNCS, Tunis, Tunisia, pages 153--167, November 2006. Springer. [bibtex]


  18. A. Armando, D. Basin, Yohan Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, Pierre-Cyrille Héam, Olga Kouchnarenko, J. Mantovani, S. Moedersheim, D. von Oheimb, M. Rusinowitch, J. Santiago, M. Turuani, L. Viganò, and L. Vigneron. The Avispa Tool for the automated validation of internet security protocols and applications. In CAV 2005, 17th Int. Conf. on Computer Aided Verification, volume 3576 of LNCS, Edinburgh, Scotland, United Kingdom, pages 281--285, July 2005. Springer. [bibtex]


  19. Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko, and F. Oehl. Improvements on the Genet and Klay Technique to Automatically Verify Security Protocols. In Proc. Int. Ws. on Automated Verification of Infinite-State Systems (AVIS'2004), joint to ETAPS'04, Barcelona, Spain, pages 1--11, April 2004. Note: The final version will be published in EN in Theoretical Computer Science, Elsevier. [bibtex]


  20. Gérard Cécé, Pierre-Cyrille Héam, and Yann Mainier. Clôtures transitives de semi-commutations et model-checking régulier. In Jacques Julliand, editor, Congrès Approches Formelles dans l'Assistance au Développement de Logiciels, AFADL'04, Besançon, France, pages 257--268, June 2004. [bibtex]


  21. Pierre-Cyrille Héam. Automata for pro-V topologies. In Proc. CIAA2000, volume 2088 of LNCS, pages 135--142, 2000. [bibtex]


Internal reports
  1. Pierre-Cyrille Héam, Vincent Hugot, and Olga Kouchnarenko. Random Generation of Positive TAGEDs wrt. the Emptiness Problem. Research Report RR-7441, INRIA, November 2010. Note: 43 pages.
    Keywords: tree automata with constraints, TAGED, membership problem, emptiness problem, random generation, difficult cases. [Abstract] [bibtex]


  2. Yohan Boichut and Pierre-Cyrille Héam. A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations. Research Report RR-6411, INRIA, January 2008. [Abstract] [bibtex]


  3. Frédéric Dadeau, Pierre-Cyrille Héam, and J. Levrey. A Combination of Model-Based Testing and Random Testing Approaches using Automata. Research Report RR2008-10, LIFC - Laboratoire d'Informatique de l'Université de Franche Comté, October 2008. Note: 21 pages. [Abstract] [bibtex]


  4. Pierre-Cyrille Héam. Transitive Closures of Semi-commutation Relations on Regular omega-Languages. Research Report RR-6239, INRIA, June 2007. Note: 20 pages. [bibtex]


  5. Pierre-Cyrille Héam, Olga Kouchnarenko, and Jérôme Voinot. Towards Formalizing QoS of Web Services with Weighted Automata. Research Report RR-6218, INRIA, June 2007. Note: 22 pages. [bibtex]


  6. Yohan Boichut, Pierre-Cyrille Héam, and 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, November 2006. [bibtex]


  7. Yohan Boichut, Pierre-Cyrille Héam, and Olga Kouchnarenko. Handling Algebraic Properties in Automatic Analysis of Security Protocols. Research report RR-5857, INRIA, March 2006.
    Keywords: VERIFICATION, SECURITY PROTOCOLS, APPROXIMATIONS. [Abstract] [bibtex]


  8. Yohan Boichut, Pierre-Cyrille Héam, and Olga Kouchnarenko. Automatic Verification of Security Protocols Using Approximations. Research Report RR2005-01, LIFC - Laboratoire d'Informatique de l'Université de Franche Comté, January 2005.
    Keywords: Security protocols, Verification, Approximations, Abstractions. [Abstract] [bibtex]


  9. Yohan Boichut, Pierre-Cyrille Héam, and Olga Kouchnarenko. AVISPA tool. Delivrable 4.5, AVISPA project tool vs 2, July 2004. Note: 24 pages, written with others AVISPA members. [bibtex]


  10. Yohan Boichut, Pierre-Cyrille Héam, and Olga Kouchnarenko. Abstractions. Delivrable D5.1, AVISPA project, April 2004. Note: 30 pages, written with others AVISPA members. [bibtex]


  11. Yohan Boichut, Pierre-Cyrille Héam, and Olga Kouchnarenko. Infinite State Model Checking. Delivrable D5.2, AVISPA project, September 2004. Note: 30 pages, written with others AVISPA members. [bibtex]


  12. Gérard Cécé, Pierre-Cyrille Héam, and Yann Mainier. Efficiency of Automata in Semi-Commutation Verification Techniques. Research report RR-5001, INRIA, November 2003. [bibtex]


Other publications
  1. Jacques Bahi, Christophe Guyeux, and Pierre-Cyrille Héam. A Complexity Approach for Steganalysis. Journées Codes et Stéganographie, Hôtel de la Monnaie, Rennes, France, March 2012. [bibtex]


  2. Pierre-Cyrille Héam. Semi-commutations et sûreté des systèmes. Séminaire invité à l'Université de Nancy, March 2010. [bibtex]


  3. Pierre-Cyrille Héam. Regular Approximations. Séminaire invité à l'Université de Bordeaux, January 2009. [bibtex]


  4. Pierre-Cyrille Héam. Regular Approximations. Séminaire invité à l'ENS Cachan, September 2008. [bibtex]


  5. Pierre-Cyrille Héam. Regular Approximations. Séminaire invité à l'Université de Marne-la-Vallée, October 2008. [bibtex]


  6. Pierre-Cyrille Héam. Regular Approximations. Séminaire invité à l'Université Paris 7, December 2008. [bibtex]


  7. Pierre-Cyrille Héam. Semi-commutations et automates finis. Séminaire invité à l'ENS Cachan, April 2004. [bibtex]


  8. Pierre-Cyrille Héam. Idéaux de mélange. Séminaire invité à l'Université d'Amiens, January 2002. [bibtex]


  9. Pierre-Cyrille Héam. Utilisation d'automates pour l'algorithmique des monoïdes finis. Séminaire invité aux journées du GdR ALP, January 2002. [bibtex]


  10. Pierre-Cyrille Héam. Automates finis et topologie. Séminaire invité à l'Université de Rouen, October 2001. [bibtex]


  11. Pierre-Cyrille Héam. Idéaux de mélanges. Séminaire invité à l'Université Paris 7, December 2001. [bibtex]


  12. Pierre-Cyrille Héam. Idéaux de mélanges. Séminaire invité à l'Université de Marne-la-Vallée, October 2001. [bibtex]


  13. Pierre-Cyrille Héam. On languages of level 1/2 in ST hierarchy. Séminaire invité à l'Université de Porto (Portugal), December 2001. [bibtex]


Back to INDEX

Wed May 16 18:07:18 2012 Authors: Arnaud Lanoix, Pierre-Alain Masson and Jean-Marc Nicod
This document was translated from BibTEX by bibtex2html