 | 2007 |
|---|
| 10 |       | Guillaume Châtelet,
Benoit Parreaux,
Yves-Marie Quemener:
Using Probabilist Models for Studying Realistic Systems: A Case Study of Pastry.
SDL Forum 2007: 242-257 |
| 2006 |
|---|
| 9 | | Ana R. Cavalli,
Stéphane Maag,
Wissam Mallouli,
Mikael Marche,
Yves-Marie Quemener:
Application of Two Test Generation Tools to an Industrial Case Study.
TestCom 2006: 134-148 |
| 2002 |
|---|
| 8 | | Mikael Marche,
Yves-Marie Quemener:
A Model for Conformance Testing of Mobile Agents in a MASIF Framework.
FAABS 2002: 173-192 |
| 7 | | Sergiy Boroday,
Roland Groz,
Alexandre Petrenko,
Yves-Marie Quemener:
Techniques for Abstracting SDL Specifications.
SAM 2002: 141-157 |
| 6 | | Yves-Marie Quemener:
A Typical Testing Problem: Validating WML Cellphones.
SPIN 2002: 241 |
| 5 |  | Sergiy Boroday,
Alexandre Petrenko,
Roland Groz,
Yves-Marie Quemener:
Test Generation for CEFSM Combining Specification and Fault Coverage.
TestCom 2002: 355-372 |
| 4 | | Mikael Marche,
Yves-Marie Quemener,
Roland Groz:
Testing Mobile Agents.
TestCom 2002: 95-110 |
| 1996 |
|---|
| 3 | | Yves-Marie Quemener,
Thierry Jéron:
Finitely Representing Infinite Reachability Graphs of CFSMs with Graph Grammars.
FORTE 1996: 364-379 |
| 2 | | Olaf Burkart,
Yves-Marie Quemener:
Model-checking of infinite graphs defined by graph grammars.
Electr. Notes Theor. Comput. Sci. 5: (1996) |
| 1995 |
|---|
| 1 | | Yves-Marie Quemener,
Thierry Jéron:
Model-checking of infinite Kripke structures defined by simple graph grammars.
Electr. Notes Theor. Comput. Sci. 2: (1995) |
