| 2009 |
|---|
| 19 | EE | Isabelle Gnaedig:
Termination of Priority Rewriting.
LATA 2009: 386-397 |
| 18 | EE | Isabelle Gnaedig,
Hélène Kirchner:
Termination of rewriting under strategies.
ACM Trans. Comput. Log. 10(2): (2009) |
| 2007 |
|---|
| 17 | EE | Isabelle Gnaedig:
Induction for positive almost sure termination.
PPDP 2007: 167-178 |
| 16 | EE | Isabelle Gnaedig,
Hélène Kirchner:
Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations.
Rewriting, Computation and Proof 2007: 44-67 |
| 2006 |
|---|
| 15 | EE | Isabelle Gnaedig,
Hélène Kirchner:
Computing constructor forms with non terminating rewrite programs.
PPDP 2006: 121-132 |
| 2005 |
|---|
| 14 | EE | Isabelle Gnaedig,
Hélène Kirchner:
Termination of rewriting strategies: a generic approach
CoRR abs/cs/0507064: (2005) |
| 2004 |
|---|
| 13 | EE | Olivier Fissore,
Isabelle Gnaedig,
Hélène Kirchner:
A Proof of Weak Termination Providing the Right Way to Terminate.
ICTAC 2004: 356-371 |
| 2003 |
|---|
| 12 | EE | Olivier Fissore,
Isabelle Gnaedig,
Hélène Kirchner:
Simplification and termination of strategies in rule-based languages.
PPDP 2003: 124-135 |
| 2002 |
|---|
| 11 | EE | Olivier Fissore,
Isabelle Gnaedig,
Hélène Kirchner:
System Presentation -- CARIBOO: An induction based proof tool for termination with strategies.
PPDP 2002: 62-73 |
| 10 | EE | Olivier Fissore,
Isabelle Gnaedig,
Hélène Kirchner:
Outermost ground termination.
Electr. Notes Theor. Comput. Sci. 71: (2002) |
| 2001 |
|---|
| 9 | EE | Olivier Fissore,
Isabelle Gnaedig,
Hélène Kirchner:
Termination of Rewriting with Local Strategies.
Electr. Notes Theor. Comput. Sci. 58(2): (2001) |
| 2000 |
|---|
| 8 | EE | Hélène Kirchner,
Isabelle Gnaedig:
Termination and normalisation under strategy Proofs in ELAN.
Electr. Notes Theor. Comput. Sci. 36: (2000) |
| 1997 |
|---|
| 7 | | Thomas Genet,
Isabelle Gnaedig:
Termination Proofs Using gpo Ordering Constraints.
TAPSOFT 1997: 249-260 |
| 1992 |
|---|
| 6 | | Isabelle Gnaedig:
Termination of Order-sorted Rewriting.
ALP 1992: 37-52 |
| 5 | | Isabelle Gnaedig:
ELIOS-OBJ Theorem Proving in a Specification Language.
ESOP 1992: 182-199 |
| 1990 |
|---|
| 4 | | Isabelle Gnaedig,
Claude Kirchner,
Hélène Kirchner:
Equational Completion in Order-Sorted Algebras.
Theor. Comput. Sci. 72(2&3): 169-202 (1990) |
| 1988 |
|---|
| 3 | | Isabelle Gnaedig,
Claude Kirchner,
Hélène Kirchner:
Equational Completion in Order-Sorted Algebras (Extended Abstract).
CAAP 1988: 165-184 |
| 1987 |
|---|
| 2 | | Isabelle Gnaedig:
Knuth-Bendix procedure and non-deterministic behaviour - An example.
Bulletin of the EATCS 32: 86-92 (1987) |
| 1986 |
|---|
| 1 | | Isabelle Gnaedig,
Pierre Lescanne:
Proving Termination of Associative Commutative Rewriting Systems by Rewriting.
CADE 1986: 52-61 |
