Travelled to:1 × France
1 × Poland
1 × Spain
1 × Sweden
1 × USA
2 × Italy
Collaborated with:∅ H.Kirchner O.Fissore P.Lescanne T.Genet
Talks about:termin (10) rewrit (5) strategi (3) proof (3) languag (2) system (2) induct (2) prove (2) order (2) base (2)
Person: Isabelle Gnaedig
DBLP: Gnaedig:Isabelle
Contributed to:
2009
2007200620032002
200220001992
1992
1986
1997Wrote 11 papers:
- LATA-2009-Gnaedig #termination
- Termination of Priority Rewriting (IG), pp. 386–397.
- PPDP-2007-Gnaedig #induction #termination
- Induction for positive almost sure termination (IG), pp. 167–178.
- PPDP-2006-GnaedigK #source code
- Computing constructor forms with non terminating rewrite programs (IG, HK), pp. 121–132.
- PPDP-2003-FissoreGK #rule-based #termination
- Simplification and termination of strategies in rule-based languages (OF, IG, HK), pp. 124–135.
- PPDP-2002-FissoreGK #induction #proving #termination
- System Presentation — CARIBOO: An induction based proof tool for termination with strategies (OF, IG, HK), pp. 62–73.
- WRLA-2002-FissoreGK #termination
- Outermost ground termination (OF, IG, HK), pp. 188–207.
- WRLA-2000-KirchnerG #normalisation #proving #termination
- Termination and normalisation under strategy Proofs in ELAN (HK, IG), pp. 93–120.
- ALP-1992-Gnaedig #order #termination
- Termination of Order-sorted Rewriting (IG), pp. 37–52.
- ESOP-1992-Gnaedig #proving #specification #theorem proving
- ELIOS-OBJ Theorem Proving in a Specification Language (IG), pp. 182–199.
- CADE-1986-GnaedigL #commutative #proving #term rewriting #termination
- Proving Termination of Associative Commutative Rewriting Systems by Rewriting (IG, PL), pp. 52–61.
- TAPSOFT-1997-GenetG #constraints #proving #termination #using
- Termination Proofs Using gpo Ordering Constraints (TG, IG), pp. 249–260.