Isabelle Gnaedig

Jean-Yves Marion

Proceedings of the Computer Security - ESORICS 2012, 2012

2011

Proving weak properties of rewriting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

2010

Behavior Abstraction in Malware Analysis.

[BibT_eX]

[DOI]

Philippe Beaucamps

Jean-Yves Marion

Proceedings of the Runtime Verification - First International Conference, 2010

Unconditional self-modifying code elimination with dynamic compiler optimizations.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Malicious and Unwanted Software, 2010

2009

Termination of rewriting under strategies.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2009

Termination of Priority Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

2007

Induction for positive almost sure termination.

[BibT_eX]

[DOI]

Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2007

Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations.

[BibT_eX]

[DOI]

Proceedings of the Rewriting, 2007

2006

Computing constructor forms with non terminating rewrite programs.

[BibT_eX]

[DOI]

Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2006

2005

Termination of rewriting strategies: a generic approach

[BibT_eX]

[DOI]

CoRR, 2005

2004

A Proof of Weak Termination Providing the Right Way to Terminate.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2004

2003

Simplification and termination of strategies in rule-based languages.

[BibT_eX]

[DOI]

Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2003

2002

Outermost ground termination.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Workshop on Rewriting logic and Its Applications, 2002

System Presentation -- CARIBOO: An induction based proof tool for termination with strategies.

[BibT_eX]

[DOI]

Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

2001

Termination of Rewriting with Local Strategies.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Strategies in Automated Deduction, 2001

2000

Termination and normalisation under strategy Proofs in ELAN.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Workshop on Rewriting Logic and its Applications, 2000

1997

Termination Proofs Using gpo Ordering Constraints.

[BibT_eX]

[DOI]

Thomas Genet

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1992

ELIOS-OBJ Theorem Proving in a Specification Language.

[BibT_eX]

[DOI]

Proceedings of the ESOP '92, 1992

Termination of Order-sorted Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Logic Programming, 1992

1990

Equational Completion in Order-Sorted Algebras.

[BibT_eX]

[DOI]

Claude Kirchner

Theor. Comput. Sci., 1990

1988

Equational Completion in Order-Sorted Algebras (Extended Abstract).

[BibT_eX]

[DOI]

Claude Kirchner

Proceedings of the CAAP '88, 1988

1987

Knuth-Bendix procedure and non-deterministic behaviour - An example.

[BibT_eX]

Bull. EATCS, 1987

1986

Proving Termination of Associative Commutative Rewriting Systems by Rewriting.

[BibT_eX]

[DOI]