Skip to Main content Skip to Navigation

Termination of ELAN strategies by simplification - Extended version -

Olivier Fissore 1 Isabelle Gnaedig 1 Hélène Kirchner 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We propose a transformation based method for proving termination of ELAN strategies. We first give a sufficient criterion for ELAN strategies to terminate, only lying on rewrite rules involved in the strategy. We then give a simplification process of strategies, itself described by rewriting, to empower the previous criterion. This simplification, beyond easing termination proof of strategies, can both facilitate elaboration of specifications and ease proofs of other program properties.
Document type :
Complete list of metadatas
Contributor : Publications Loria <>
Submitted on : Thursday, October 19, 2006 - 9:07:38 AM
Last modification on : Thursday, January 11, 2018 - 6:19:57 AM
Long-term archiving on: : Friday, November 25, 2016 - 12:43:01 PM


  • HAL Id : inria-00107743, version 1



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⟩



Record views


Files downloads