2008 |
13 | EE | Yohan Boichut,
Roméo Courbis,
Pierre-Cyrille Héam,
Olga Kouchnarenko:
Finer Is Better: Abstraction Refinement for Rewriting Approximations.
RTA 2008: 48-62 |
12 | EE | 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) |
11 | EE | 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 | EE | Pierre-Cyrille Héam:
A note on partially ordered tree automata.
Inf. Process. Lett. 108(4): 242-246 (2008) |
9 | EE | 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 | EE | 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 | EE | Yohan Boichut,
Pierre-Cyrille Héam,
Olga Kouchnarenko:
Handling Algebraic Properties in Automatic Analysis of Security Protocols.
ICTAC 2006: 153-167 |
2005 |
6 | EE | 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 | EE | Pierre-Cyrille Héam:
Some complexity results for polynomial rational expressions.
Theor. Comput. Sci. 1-3(299): 735-741 (2003) |
2002 |
4 | EE | 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 | EE | Pierre-Cyrille Héam:
Automata for Pro-V Topologies.
CIAA 2000: 135-144 |
1 | EE | Pierre-Cyrille Héam:
A Lower Bound For Reversible Automata.
ITA 34(5): 331-341 (2000) |