Isabelle Gnaedig - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2012

Abstraction-Based Malware Analysis Using Rewriting and Model CheckingPhilippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion. esorics 2012: 806-823 [doi]

2011

Proving weak properties of rewritingIsabelle Gnaedig, Hélène Kirchner. TCS, 412(34):4405-4438, 2011. [doi]

2010

Behavior Abstraction in Malware AnalysisPhilippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion. RV 2010: 168-182 [doi]

Unconditional self-modifying code elimination with dynamic compiler optimizationsIsabelle Gnaedig, Matthieu Kaczmarek, Daniel Reynaud, Stéphane Wloka. malware 2010: 47-54 [doi]

2009

Termination of Priority RewritingIsabelle Gnaedig. LATA 2009: 386-397 [doi]

Termination of rewriting under strategiesIsabelle Gnaedig, Hélène Kirchner. tocl, 10(2), 2009. [doi]

2007

Narrowing, Abstraction and Constraints for Proving Properties of Reduction RelationsIsabelle Gnaedig, Hélène Kirchner. birthday 2007: 44-67 [doi]

Induction for positive almost sure terminationIsabelle Gnaedig. ppdp 2007: 167-178 [doi]

2006

Computing constructor forms with non terminating rewrite programsIsabelle Gnaedig, Hélène Kirchner. ppdp 2006: 121-132 [doi]

2004

A Proof of Weak Termination Providing the Right Way to TerminateOlivier Fissore, Isabelle Gnaedig, Hélène Kirchner. ictac 2005: 356-371 [doi]

2003

Simplification and termination of strategies in rule-based languagesOlivier Fissore, Isabelle Gnaedig, Hélène Kirchner. ppdp 2003: 124-135 [doi]

2002

Outermost ground terminationOlivier Fissore, Isabelle Gnaedig, Hélène Kirchner. ENTCS, 71:188-207, 2002. [doi]

System Presentation -- CARIBOO: An induction based proof tool for termination with strategiesOlivier Fissore, Isabelle Gnaedig, Hélène Kirchner. ppdp 2002: 62-73 [doi]

2001

Termination of Rewriting with Local StrategiesOlivier Fissore, Isabelle Gnaedig, Hélène Kirchner. TCS, 58(2):155-188, 2001. [doi]

2000

Termination and normalisation under strategy Proofs in ELANHélène Kirchner, Isabelle Gnaedig. ENTCS, 36:93-120, 2000. [doi]

1997

Termination Proofs Using gpo Ordering ConstraintsThomas Genet, Isabelle Gnaedig. tapsoft 1997: 249-260

1992

Termination of Order-sorted RewritingIsabelle Gnaedig. icalp 1992: 37-52

ELIOS-OBJ Theorem Proving in a Specification LanguageIsabelle Gnaedig. ESOP 1992: 182-199

1990

Equational Completion in Order-Sorted AlgebrasIsabelle Gnaedig, Claude Kirchner, Hélène Kirchner. TCS, 72(2&3):169-202, 1990.

1988

Equational Completion in Order-Sorted Algebras (Extended Abstract)Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner. caap 1988: 165-184

1987

Knuth-Bendix procedure and non-deterministic behaviour - An exampleIsabelle Gnaedig. eatcs, 32:86-92, 1987.

1986

Proving Termination of Associative Commutative Rewriting Systems by RewritingIsabelle Gnaedig, Pierre Lescanne. cade 1986: 52-61

Sign in or sign up to see more results.

runs on WebDSL