Decidable Approximations of Sets of Descendants and Sets of Normal Forms (1997)
| Citations: | 38 - 11 self |
BibTeX
@MISC{Genet97decidableapproximations,
author = {Thomas Genet and Thomas Genet},
title = {Decidable Approximations of Sets of Descendants and Sets of Normal Forms},
year = {1997}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. Key-words: Term Rewriting, Program Verification, Normal Forms, Descendants, Tree Automata, Approximation, Sufficient Completeness, Reachability, Termination. (R'esum'e : tsvp) Email: Thomas.Genet@loria.fr, http://www.loria.fr/equipe/protheo.html Unite de recherche INRIA Lorraine Technopole de Nancy-Brabois, Campus scientifique, 615 rue de Jardin Botanique, BP 101, 54600 VILLERS L ES NA...
