| 2009 |
| 36 | EE | Horatiu Cirstea,
Pierre-Etienne Moreau,
Anderson Santana de Oliveira:
Rewrite Based Specification of Access Control Policies.
Electr. Notes Theor. Comput. Sci. 234: 37-54 (2009) |
| 2008 |
| 35 | EE | Emilie Balland,
Yohan Boichut,
Thomas Genet,
Pierre-Etienne Moreau:
Towards an Efficient Implementation of Tree Automata Completion.
AMAST 2008: 67-82 |
| 34 | EE | Radu Kopetz,
Pierre-Etienne Moreau:
Software Quality Improvement Via Pattern Matching.
FASE 2008: 296-300 |
| 33 | EE | Claude Kirchner,
Radu Kopetz,
Pierre-Etienne Moreau:
Anti-pattern Matching Modulo.
LATA 2008: 275-286 |
| 32 | EE | Emilie Balland,
Pierre-Etienne Moreau:
Term-Graph Rewriting Via Explicit Paths.
RTA 2008: 32-47 |
| 31 | EE | Pierre-Etienne Moreau,
Antoine Reilles:
Rules and Strategies in Java.
Electr. Notes Theor. Comput. Sci. 204: 71-82 (2008) |
| 30 | EE | Emilie Balland,
Pierre-Etienne Moreau,
Antoine Reilles:
Rewriting Strategies in Java.
Electr. Notes Theor. Comput. Sci. 219: 97-111 (2008) |
| 2007 |
| 29 | EE | Claude Kirchner,
Radu Kopetz,
Pierre-Etienne Moreau:
Anti-pattern Matching.
ESOP 2007: 110-124 |
| 28 | EE | Emilie Balland,
Paul Brauner,
Radu Kopetz,
Pierre-Etienne Moreau,
Antoine Reilles:
Tom: Piggybacking Rewriting on Java.
RTA 2007: 36-47 |
| 27 | EE | Emilie Balland,
Pierre-Etienne Moreau,
Antoine Reilles:
Bytecode Rewriting in Tom.
Electr. Notes Theor. Comput. Sci. 190(1): 19-33 (2007) |
| 2006 |
| 26 | EE | Emilie Balland,
Claude Kirchner,
Pierre-Etienne Moreau:
Formal Islands.
AMAST 2006: 51-65 |
| 25 | EE | Marian Vittek,
Peter Borovanský,
Pierre-Etienne Moreau:
A Simple Generic Library for C.
ICSR 2006: 423-426 |
| 24 | EE | Claude Kirchner,
Pierre-Etienne Moreau,
Antoine Reilles:
Formal Validation of Pattern Matching code.
Trustworthy Software 2006 |
| 23 | EE | Emilie Balland,
Pierre-Etienne Moreau:
Optimizing Pattern Matching Compilation by Program Transformation.
ECEASST 3: (2006) |
| 22 | EE | Olivier Danvy,
Andrzej Filinski,
Jean-Louis Giavitto,
Andy King,
Pierre-Etienne Moreau,
Carolyn L. Talcott:
Editorial.
Higher-Order and Symbolic Computation 19(4): 343-344 (2006) |
| 2005 |
| 21 | | Marian Vittek,
Peter Borovanský,
Pierre-Etienne Moreau:
A collection of C, C++ and Java code understanding and refactoring plugins.
ICSM (Industrial and Tool Volume) 2005: 61-64 |
| 20 | EE | Claude Kirchner,
Pierre-Etienne Moreau,
Antoine Reilles:
Formal validation of pattern matching code.
PPDP 2005: 187-197 |
| 19 | EE | Horatiu Cirstea,
Pierre-Etienne Moreau,
Antoine Reilles:
Rule-based Programming in Java For Protocol Verification.
Electr. Notes Theor. Comput. Sci. 117: 209-227 (2005) |
| 2004 |
| 18 | EE | Julien Guyon,
Pierre-Etienne Moreau,
Antoine Reilles:
An Integrated Development Environment for Pattern Matching Programming.
Electr. Notes Theor. Comput. Sci. 107: 33-49 (2004) |
| 17 | EE | Pierre-Etienne Moreau,
Olivier Zendra:
GC2: a generational conservative garbage collector for the ATImage library.
J. Log. Algebr. Program. 59(1-2): 5-34 (2004) |
| 2003 |
| 16 | EE | Pierre-Etienne Moreau,
Christophe Ringeissen,
Marian Vittek:
A Pattern Matching Compiler for Multiple Target Languages.
CC 2003: 61-76 |
| 15 | EE | Mark van den Brand,
Pierre-Etienne Moreau,
Jurgen J. Vinju:
Environments for Term Rewriting Engines for Free!
RTA 2003: 424-435 |
| 14 | EE | Jean-Louis Giavitto,
Pierre-Etienne Moreau:
Preface.
Electr. Notes Theor. Comput. Sci. 86(2): (2003) |
| 2002 |
| 13 | EE | Mark van den Brand,
Pierre-Etienne Moreau,
Christophe Ringeissen:
The ELAN Environment: a Rewriting Logic Environment based on ASF+SDF Technology - System Demonstration.
Electr. Notes Theor. Comput. Sci. 65(3): (2002) |
| 12 | EE | Peter Borovanský,
Claude Kirchner,
Hélène Kirchner,
Pierre-Etienne Moreau:
ELAN from a rewriting logic point of view.
Theor. Comput. Sci. 285(2): 155-185 (2002) |
| 2001 |
| 11 | EE | Pierre-Etienne Moreau,
Christophe Ringeissen,
Marian Vittek:
Pattern-Matching Compiler.
Electr. Notes Theor. Comput. Sci. 44(2): (2001) |
| 10 | | Hélène Kirchner,
Pierre-Etienne Moreau:
Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories.
J. Funct. Program. 11(2): 207-251 (2001) |
| 2000 |
| 9 | | Pierre-Etienne Moreau:
REM (Reduce Elan Machine): Core of the New ELAN Compiler.
RTA 2000: 265-269 |
| 1998 |
| 8 | | Pierre-Etienne Moreau:
A Choice-Point Library for Backtrack Programming.
Implementation Technology for Programming Languages based on Logic 1998: 16-31 |
| 7 | EE | Pierre-Etienne Moreau,
Hélène Kirchner:
A Compiler for Rewrite Programs in Associative-Commutative Theories.
PLILP/ALP 1998: 230-249 |
| 6 | EE | Hélène Kirchner,
Pierre-Etienne Moreau:
Non-deterministic Computations in ELAN.
WADT 1998: 168-182 |
| 5 | EE | Peter Borovanský,
Claude Kirchner,
Hélène Kirchner,
Pierre-Etienne Moreau,
Christophe Ringeissen:
An overview of ELAN.
Electr. Notes Theor. Comput. Sci. 15: (1998) |
| 4 | EE | Peter Borovanský,
Salma Jamoussi,
Pierre-Etienne Moreau,
Christophe Ringeissen:
Handling ELAN rewrite programs via an exchange format.
Electr. Notes Theor. Comput. Sci. 15: (1998) |
| 1996 |
| 3 | EE | Hélène Kirchner,
Pierre-Etienne Moreau:
A reflective extension of ELAN.
Electr. Notes Theor. Comput. Sci. 4: (1996) |
| 2 | EE | Peter Borovanský,
Claude Kirchner,
Hélène Kirchner,
Pierre-Etienne Moreau,
Marian Vittek:
ELAN: A logical framework based on computational systems.
Electr. Notes Theor. Comput. Sci. 4: (1996) |
| 1995 |
| 1 | | Hélène Kirchner,
Pierre-Etienne Moreau:
Prototyping Completion with Constraints Using Computational Systems.
RTA 1995: 438-443 |