Isabelle Gnaedig

23 papers A 3B 1C 6Journal 5Unranked 8
YearRankTypeTitle / Venue / Authors
2012 A conf
Abstraction-Based Malware Analysis Using Rewriting and Model Checking.
ESORICS
Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion
2011 J jnl
Proving weak properties of rewriting.
Theor. Comput. Sci.
Isabelle Gnaedig, Hélène Kirchner
2010 B conf
Behavior Abstraction in Malware Analysis.
RV
Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion
2010 — conf
Unconditional self-modifying code elimination with dynamic compiler optimizations.
MALWARE
Isabelle Gnaedig, Matthieu Kaczmarek, Daniel Reynaud, Stéphane Wloka
2009 C conf
Termination of Priority Rewriting.
LATA
Isabelle Gnaedig
2009 J jnl
Termination of rewriting under strategies.
ACM Trans. Comput. Log.
Isabelle Gnaedig, Hélène Kirchner
2007 C conf
Induction for positive almost sure termination.
PPDP
Isabelle Gnaedig
2007 — conf
Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations.
Rewriting, Computation and Proof
Isabelle Gnaedig, Hélène Kirchner
2006 C conf
Computing constructor forms with non terminating rewrite programs.
PPDP
Isabelle Gnaedig, Hélène Kirchner
2005 J jnl
Termination of rewriting strategies: a generic approach
CoRR
Isabelle Gnaedig, Hélène Kirchner
2004 C conf
A Proof of Weak Termination Providing the Right Way to Terminate.
ICTAC
Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner
2003 C conf
Simplification and termination of strategies in rule-based languages.
PPDP
Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner
2002 — conf
Outermost ground termination.
WRLA
Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner
2002 C conf
System Presentation -- CARIBOO: An induction based proof tool for termination with strategies.
PPDP
Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner
2001 — conf
Termination of Rewriting with Local Strategies.
STRATEGIES@IJCAR
Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner
2000 — conf
Termination and normalisation under strategy Proofs in ELAN.
WRLA
Hélène Kirchner, Isabelle Gnaedig
1997 — conf
Termination Proofs Using gpo Ordering Constraints.
TAPSOFT
Thomas Genet, Isabelle Gnaedig
1992 A conf
ELIOS-OBJ Theorem Proving in a Specification Language.
ESOP
Isabelle Gnaedig
1992 — conf
Termination of Order-sorted Rewriting.
ALP
Isabelle Gnaedig
1990 J jnl
Equational Completion in Order-Sorted Algebras.
Theor. Comput. Sci.
Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner
1988 — conf
Equational Completion in Order-Sorted Algebras (Extended Abstract).
CAAP
Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner
1987 J jnl
Knuth-Bendix procedure and non-deterministic behaviour - An example.
Bull. EATCS
Isabelle Gnaedig
1986 A conf
Proving Termination of Associative Commutative Rewriting Systems by Rewriting.
CADE
Isabelle Gnaedig, Pierre Lescanne