Model-checking of infinite Kripke structures defined by simple graph grammars. - Yves-Marie Quemener; Thierry Jéron (SEGRAGRA, 1995)

Finitely Representing Infinite Reachability Graphs of CFSMs with Graph Grammars. - Yves-Marie Quemener; Thierry Jéron (FORTE, 1996)

Model-checking of infinite graphs defined by graph grammars. - Olaf Burkart; Yves-Marie Quemener (INFINITY, 1996)

A Model for Conformance Testing of Mobile Agents in a MASIF Framework. - Mikael Marche; Yves-Marie Quemener (FAABS, 2002)

Test Generation for CEFSM Combining Specification and Fault Coverage. - Sergiy Boroday; Alexandre Petrenko; Roland Groz; Yves-Marie Quemener (TestCom, 2002)

Testing Mobile Agents. - Mikael Marche; Yves-Marie Quemener; Roland Groz (TestCom, 2002)

Techniques for Abstracting SDL Specifications. - Sergiy Boroday; Roland Groz; Alexandre Petrenko; Yves-Marie Quemener (SAM, 2002)

A Typical Testing Problem: Validating WML Cellphones. - Yves-Marie Quemener (SPIN, 2002)

Application of Two Test Generation Tools to an Industrial Case Study. - Ana R. Cavalli; Stéphane Maag; Wissam Mallouli; Mikael Marche; Yves-Marie Quemener (TestCom, 2006)

Using Probabilist Models for Studying Realistic Systems: A Case Study of Pastry. - Guillaume Châtelet; Benoit Parreaux; Yves-Marie Quemener (SDL Forum, 2007)