Selected publications by Pierre-Cyrille Héam
Journals
-
Y. Boichut, P.-C. Héam and O. Kouchnarenko. Approximation Based Tree Regular Model-Checking. Nordic Journal of Computing, 2009. To appear. ( PDF | BibTeX + Abstract )
-
Y. Boichut, R. Courbis, P.-C. Héam and O. Kouchnarenko. Handling Non-left Linear Rules when Completing Tree Automata. International Journal of Foundations of Computer Science 20(5), pages 837-849, 2009. ( PDF | BibTeX + Abstract )
-
G. Cécé, P.-C. Héam and Y. Mainier. Clôtures transitives de semi-commutations et model-checking
régulier. Technique et Science Informatiques 27(1-2), pages 7-28, 2008. ( BibTeX )
-
P.-C. Héam. A Note on Partially Ordered Tree Automata. Information Processing Letters 108(4), pages 242-246, 2008. ( BibTeX )
-
Y. Boichut and P.-C. Héam. A Theorerical Limit for Safety Verification Techniques with Regular
Fix-point Computations. Information Processing Letters 108(1), pages 1-2, 2008. ( BibTeX )
-
P.-C. Héam. Some complexity results for polynomial rational expressions. Theoretical Computer Science 1-3(299), pages 735-741, 2003. ( BibTeX )
-
M. Delgado and P.-C. Héam. A polynomial time algorithm to compute the Abelian kernel of a finite
monoid. Semigroup Forum 67, pages 97-110, 2003. ( BibTeX )
-
P.-C. Héam. On Shuffle Ideals. Informatique Théorique et Applications 36(4), pages 359-384, 2002. ( BibTeX )
-
P.-C. Héam. Some Topological Properties of Rational Sets. Journal of Automata, Languages and Combinatorics 6(3), pages 275-290, 2001. ( BibTeX )
-
P.-C. Héam. A Lower Bound For Reversible Automata. Informatique Théorique et Applications 34(5), pages 331-341, 2000. ( BibTeX )
Conferences
-
F. Dadeau, P.-C. Héam and J. Levrey. On the Use of Uniform Random Generation of Automata for Testing. In MBT'09, ENTCS 253(2), pages 37-51. Elsevier Science Publishers, 2009. ( PDF | BibTeX + Abstract )
-
Y. Boichut, P.-C. Héam and O. Kouchnarenko. How to Tackle Integer Weighted Automata Positivity. In RP'09, LNCS 5797, pages 79-92. Springer, 2009. ( PDF | BibTeX + Abstract )
-
Y. Boichut, P.-C. Héam and O. Kouchnarenko. Tree Automata for Detecting Attacks on Protocols with Algebraic
Cryptographic Primitives. In INFINITY'06,'07,'08, ENTCS 239, pages 57-72. Elsevier Science Publishers, 2009. ( BibTeX )
-
R. Courbis, P.-C. Héam and O. Kouchnarenko. TAGED Approximations for Veriying Temporal Patterns. In CIAA'09, LNCS 5642, pages 135-144. Springer-Verlag, 2009. ( PDF | BibTeX + Abstract )
-
P.-C. Héam, C. Nicaud and S. Schmitz. Random Generation of Deterministic Tree (Walking) Automata. In CIAA'09, LNCS 5642, pages 115-124. Springer-Verlag, 2009. ( PDF | BibTeX + Abstract )
-
P.-C. Héam, O. Kouchnarenko and J. Voinot. Component Simulation-based Substitutivity Managing QoS Aspects. In FACS'08, ENTCS 260, pages 109-123. Elsevier Science Publishers, 2009. ( BibTeX )
-
R. Courbis, P.-C. Héam and O. Kouchnarenko. Handling Left-Quadratic Rules when Completing Tree Automata. In RP'08, ENTCS 223, pages 61-70. Elsevier Science Publishers, 2008. ( BibTeX )
-
Y. Boichut, R. Courbis, P.-C. Héam and O. Kouchnarenko. Finer Is Better: Abstraction Refinement for Rewriting Approximations. In RTA'08, LNCS 5117, pages 48-62. Springer, 2008. ( BibTeX )
-
Y. Boichut, P.-C. Héam and O. Kouchnarenko. Handling Algebraic Properties in Automatic Analysis of Security
Protocols. In ICTAC'06, LNCS 4281, pages 153-167. Springer, 2006. ( BibTeX )
-
A. Armando, D. A. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuéllar, P. H. Drielsma, P.-C. Héam, O. Kouchnarenko, J. Mantovani, S. Mödersheim, 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'05, LNCS 3576, pages 281-285. Springer, 2005. ( BibTeX )
-
P.-C. Héam. Automata for Pro-V Topologies. In CIAA'00, LNCS 2088, pages 135-144. Springer, 2001. ( BibTeX )
Other Publications