Pierre-Cyrille Héam

	2009
19		Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz: Random Generation of Deterministic Tree (Walking) Automata. CIAA 2009: 115-124
18		Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko: TAGED Approximations for Temporal Properties Model-Checking. CIAA 2009: 135-144
17		Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko: How to Tackle Integer Weighted Automata Positivity. RP 2009: 79-92
16		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)
15		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)
	2008
14		Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko: Finer Is Better: Abstraction Refinement for Rewriting Approximations. RTA 2008: 48-62
13		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)
12		Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier: Efficiency of automata in semi-commutation verification techniques. ITA 42(2): 197-215 (2008)
11		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)
10		Pierre-Cyrille Héam: A note on partially ordered tree automata. Inf. Process. Lett. 108(4): 242-246 (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)

Coauthor Index

1	Alessandro Armando	[6]
2	David A. Basin	[6]
3	Yohan Boichut	[6] [7] [11] [13] [14] [16] [17]
4	Gérard Cécé	[9] [12]
5	Yannick Chevalier	[6]
6	Luca Compagna	[6]
7	Roméo Courbis	[13] [14] [18]
8	Jorge Cuéllar	[6]
9	Frédéric Dadeau	[15]
10	Paul Hankes Drielsma	[6]
11	Olga Kouchnarenko	[6] [7] [8] [13] [14] [16] [17] [18]
12	Jocelyn Levrey	[15]
13	Yann Mainier	[9] [12]
14	Jacopo Mantovani	[6]
15	Sebastian Mödersheim	[6]
16	Cyril Nicaud	[19]
17	David von Oheimb	[6]
18	Michaël Rusinowitch	[6]
19	Judson Santiago	[6]
20	Sylvain Schmitz	[19]
21	Mathieu Turuani	[6]
22	Luca Viganò	[6]
23	Laurent Vigneron	[6]
24	Jérôme Voinot	[8]

Colors in the list of coauthors