Publications
Papers
- [CHK10]
- R. Courbis, P.C. Héam and O. Kouchnarenko, Handling Non-left linear Rules
when Completing Tree Automata. International Journal on Foundations of
Computer Science. Volume 20, 2009 pages 837-849.
- [GR10]
- T. Genet, V. Rusu. Equational Tree Automata Completion. In Journal of Symbolic Computation. 2010.
- [BG09]
- B. Boyer, T. Genet. Verifying Temporal Regular properties of Abstractions of Term Rewriting Systems. In Proc. of RULE'09. 2009.
- [CHK09]
- Roméo Courbis, Pierre-Cyrille Héam and Olga Kouchnarenko. TAGED Approximations for Temporal Properties Model-Checking. In Proc. of CIAA'09. LNCS 5642. 2009.
- [BH08]
- Yohan Boichut and Pierre-Cyrille Héam. A Theorerical Limit for Safety Verification Techniques with Regular Fix-point Computation. In Information Processing Letters, volume 108. 2008.
- [BCHK08b]
- Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam and Olga Kouchnarenko. Handling Left-Quadratic Rules when Completing Tree Automata. In Proc. of RP'08. 2008.
- [BBGM08]
- Y. Boichut, E. Balland, T. Genet and P.-E. Moreau. Towards an Efficient Implementation of Tree Automata Completion. In Proc. of AMAST'08. LNCS 5140. 2008.
- [BGJ08]
- Benoît Boyer, Thomas Genet and Thomas Jensen. Certifying a Tree Automata Completion Checker. In Proc. of IJCAR'08. LNCS 5193. 2008.
- [BCHK08a]
- Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam
and Olga Kouchnarenko. Finer is
better: Abstraction Refinement for Rewriting Approximations.
In Proc. of RTA'08. LNCS
5117. 2008.
- [BGJL07]
- Yohan Boichut, Thomas Genet, Thomas Jensen and Luka Leroux. Rewriting Approximations for Fast Prototyping of Static Analyzers. In Proc. of RTA'07. LNCS 4533. Springer Verlag. 2007.
- [BMR07a]
- Emilie Balland, Pierre-Etienne Moreau, and Antoine Reilles. Bytecode Rewriting in
Tom.
In Bytecode 2007. 2007.
- [BMR07b]
- Emilie Balland, Paul Brauner, Radu Kopetz, Pierre-Etienne Moreau,
and Antoine Reilles. Tom:
Piggybacking rewriting on java.
In RTA'07. LNCS 4533. 2007.