Skip to Main content Skip to Navigation
Reports

Decidable Approximations of Sets of Descendants and Sets of Normal Forms - extended version -

Thomas Genet 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present here decidable approximations of sets of descendants and sets of normal forms of Term Rewriting Systems, based on specific tree automata techniques. In the context of rewriting logic, a Term Rewriting System is a program, and a normal form is a result of the program. Thus, approximations of sets of descendants and sets of normal forms provide tools for analysing a few properties of programs: we show how to compute a superset of results, to prove the sufficient completeness property, or to find a criterion for proving termination under a specific strategy, the sequential reduction strategy.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00073364
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 12:37:48 PM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:43:57 PM

Identifiers

  • HAL Id : inria-00073364, version 1

Collections

Citation

Thomas Genet. Decidable Approximations of Sets of Descendants and Sets of Normal Forms - extended version -. [Research Report] RR-3325, INRIA. 1997, pp.28. ⟨inria-00073364⟩

Share

Metrics

Record views

263

Files downloads

223