Number of documents

48


Journal articles4 documents

  • Isabelle Gnaedig, Hélène Kirchner. Proving Weak Properties of Rewriting. Theoretical Computer Science, Elsevier, 2011, 412, pp.4405-4438. ⟨10.1016/j.tcs.2011.04.028⟩. ⟨inria-00592271⟩
  • Isabelle Gnaedig, Hélène Kirchner. Termination of Rewriting under Strategies. ACM Transactions on Computational Logic, Association for Computing Machinery, 2009, 10 (2), pp.1-52. ⟨10.1145/1462179.1462182⟩. ⟨inria-00182432⟩
  • Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Outermost ground termination. Electronic Notes in Theoretical Computer Science, Elsevier, 2003, 71, 20 p. ⟨inria-00099654⟩
  • Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Induction for termination with local strategies. Electronic Notes in Theoretical Computer Science, Elsevier, 2001, 58 (2), 34 p. ⟨inria-00100418⟩

Conference papers15 documents

  • Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion. Abstraction-based Malware Analysis Using Rewriting and Model Checking. ESORICS - 17th European Symposium on Research in Computer Security - 2012, Sep 2012, Pisa, Italy. pp.806-823, ⟨10.1007/978-3-642-33167-1⟩. ⟨hal-00762252⟩
  • Isabelle Gnaedig, Matthieu Kaczmarek, Daniel Reynaud, Stéphane Wloka. Unconditional self-modifying code elimination with dynamic compiler optimizations. 5th International Conference on Malicious and Unwanted Software, Fernando C. Colón Osorio, Oct 2010, Nancy, France. ⟨inria-00538376⟩
  • Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion. Behavior Abstraction in Malware Analysis. 1st International Conference on Runtime Verification, Howard Barringer, Klaus Havelund, Insup Lee, Nov 2010, St. Julians, Malta. pp.168-182, ⟨10.1007/978-3-642-16612-9_14⟩. ⟨inria-00536500⟩
  • Isabelle Gnaedig. Termination of Priority Rewriting. Third International Conference on Language and Automata Theory and Applications - LATA 2009, Apr 2009, Tarragona, Spain. pp.386-397, ⟨10.1007/978-3-642-00982-2_33⟩. ⟨inria-00428679⟩
  • Isabelle Gnaedig. Induction for Positive Almost Sure Termination. PPDP 2007 - 9th ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming, Jul 2007, Wroclaw, Poland. pp.167-177. ⟨inria-00182435⟩
  • Isabelle Gnaedig, Hélène Kirchner. Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations. Rewriting, Computation and Proof - Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday, Jun 2007, Paris, France. pp.44-67. ⟨inria-00182434⟩
  • Isabelle Gnaedig, Hélène Kirchner. Computing Constructor Forms with Non Terminating Rewrite Programs. Symposium on Principles and Practice of Declarative Programming - PPDP'06, Jul 2006, Venise/Italie. ⟨inria-00112083⟩
  • Isabelle Gnaedig, Hélène Kirchner. Termination of rewriting strategies: a generic approach. Proceedings of the third Workshop on Applied Semantics APPSEM'05, APPSEM II & Ludwig Maximilians Universität München, Sep 2005, Chiemsee, Germany. ⟨inria-00172897⟩
  • Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. A proof of weak termination providing the right way to terminate. First International Colloquium on Theoretical Aspects of Computing, 2004, Guiyang, Chine, France. 15 p, ⟨10.1007/978-3-540-31862-0⟩. ⟨inria-00100120⟩
  • Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Simplification and Termination of Strategies in Rule-Based Languages. Proceedings of the Fifth International Conference on Principles and Practice of Declarative Programming - PPDP'2003, Aug 2003, Uppsala, Sweden, pp.124-135. ⟨inria-00099655⟩
  • Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. CARIBOO: A Multi-Strategy Termination Proof Tool Based on Induction. 6th International Workshop on Termination 2003 - WST'03, Albert Rubio, 2003, Valencia, Spain, pp.77-79. ⟨inria-00099467⟩
  • Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Outermost ground termination. 4th International Workshop on Rewriting Logic and its Applications - WRLA' 02, 2002, Pisa, Italy, 16 p. ⟨inria-00100755⟩
  • Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. CARIBOO: An Induction Based Proof Tool for Termination with Strategies. Fourth International Conference on Principles and Practice of Declarative Programming - PPDP'02, Oct 2002, Pittsburgh, USA, 12 p. ⟨inria-00107557⟩
  • Hélène Kirchner, Isabelle Gnaedig. Termination and normalisation under strategies--Proofs in ELAN. 3rd International Workshop on Rewriting Logic & Applications - WRLA'2000, 2000, Kanazawa, Japan, pp.93--115. ⟨inria-00099059⟩
  • Isabelle Gnaedig. Termination of Order-sorted Rewriting. ALP 1992 - 3rd International Conference on Algebraic and Logic Programming, Sep 1992, Volterra, Italy. pp.37 - 52, ⟨10.1007/bfb0013818⟩. ⟨hal-01893012⟩

Preprints, Working Papers, ...1 document

  • Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion. Behavior Abstraction in Malware Analysis - Extended Version. 2010. ⟨inria-00509486v2⟩

Reports28 documents

  • Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion. Behavior Analysis of Malicious Code by Weighted Behavior Abstraction. [Research Report] 2013. ⟨hal-00803412⟩
  • Antoine Rousseau, Aurélie Darnaud, Brice Goglin, Céline Acharian, Christine Leininger, et al.. Médiation Scientifique : une facette de nos métiers de la recherche. [Interne] none. 2013, pp.34. ⟨hal-00804915⟩
  • Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion. Behavior Analysis of Malware by Rewriting-based Abstraction - Extended Version. [Research Report] 2011. ⟨inria-00594396⟩
  • Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion. Abstraction by Term Rewriting for Malware Behavior Analysis - Extended Version. [Research Report] 2010. ⟨inria-00547884v3⟩
  • Isabelle Gnaedig, Hélène Kirchner. Modeling reducibility on ground terms using constraints. [Research Report] 2009, pp.9. ⟨inria-00387058⟩
  • Isabelle Gnaedig, Hélène Kirchner. Proving weak properties of rewriting. [Research Report] 2009, pp.50. ⟨inria-00338181⟩
  • Isabelle Gnaedig. Termination of Priority Rewriting - Extended version. [Research Report] 2008. ⟨inria-00349031v2⟩
  • Isabelle Gnaedig. Termination of Priority Rewriting. [Research Report] 2008, pp.13. ⟨inria-00243131⟩
  • Isabelle Gnaedig. Induction for Positive Almost Sure Termination - Extended version -. [Research Report] 2007, pp.16. ⟨inria-00147450v2⟩
  • Isabelle Gnaedig, Hélène Kirchner. Computing Constructor Forms with Non Terminating Rewrite Programs - Extended version -. [Research Report] 2006, pp.17. ⟨inria-00113146⟩
  • Isabelle Gnaedig, Hélène Kirchner. Termination of rewriting under strategies: a generic approach. [Research Report] 2006. ⟨inria-00113156⟩
  • Isabelle Gnaedig, Hélène Kirchner. Termination of rewriting strategies: a generic approach. [Research Report] 2005, pp.49. ⟨inria-00000178⟩
  • Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Proving weak termination also provides the right way to terminate - Extended version -. [Intern report] A04-R-522 || fissore04b, 2004, 54 p. ⟨inria-00099872⟩
  • Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Termination of ELAN strategies by simplification - Extended version -. [Intern report] A03-R-360 || fissore03b, 2003, 47 p. ⟨inria-00107743⟩
  • Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Proving weak termination also provides the right way to terminate - extended version -. [Intern report] A03-R-361 || fissore03c, 2003, 34 p. ⟨inria-00107744⟩
  • Isabelle Gnaedig, Hélène Kirchner. Innermost sufficient completeness. [Intern report] A03-R-131 || gnaedig03a, 2003, 22 p. ⟨inria-00099765⟩
  • Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Proving weak termination also provides the right way to terminate. [Intern report] A03-R-413 || fissore03d, 2003, 23 p. ⟨inria-00099776⟩
  • Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Outermost ground termination - Extended version. [Intern report] A02-R-493 || fissore02d, 2002, 38 p. ⟨inria-00101079⟩
  • Isabelle Gnaedig, Olivier Fissore, Hélène Kirchner. Induction for weak termination. [Intern report] A02-R-111 || gnaedig02a, 2002, 23 p. ⟨inria-00101056⟩
  • Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. CARIBOO: An Induction Based Proof Tool for Termination with Strategies -- Extended version--. [Intern report] A02-R-077 || fissore02b, 2002. ⟨inria-00099426⟩
  • Isabelle Gnaedig, Hélène Kirchner, Olivier Fissore. Induction for innermost and outermost ground termination. [Intern report] A01-R-178 || gnaedig01a, 2001, 38 p. ⟨inria-00100696⟩
  • Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Induction for termination with local strategies - Extended version -. [Intern report] A01-R-177 || fissore01b, 2001, 29 p. ⟨inria-00107541⟩
  • Isabelle Gnaedig, Hélène Kirchner, Olivier Fissore. Induction for termination. [Intern report] A00-R-357 || gnaedig00a, 2000, 22 p. ⟨inria-00099315⟩
  • Isabelle Gnaedig, Hélène Kirchner, Thomas Genet. Induction for Termination. [Intern report] 99-R-338 || gnaedig99a, 1999, 21 p. ⟨inria-00098943⟩
  • Thomas Genet, Isabelle Gnaedig. Termination Proofs Using gpo Ordering Constraints : Extended Version. [Research Report] RR-3087, INRIA. 1997, pp.37. ⟨inria-00073604⟩
  • Isabelle Gnaedig. ELIOS-OBJ theorem proving in a specification language. [Research Report] RR-1668, INRIA. 1992. ⟨inria-00074889⟩
  • Isabelle Gnaedig. Knuth-Bendix procedure and non deterministic behavior. An example. [Research Report] RR-0733, INRIA. 1987. ⟨inria-00075819⟩
  • Isabelle Gnaedig. Investigations on termination of equational rewriting. [Research Report] RR-0732, INRIA. 1987. ⟨inria-00075820⟩