Skip to Main content Skip to Navigation
Conference papers

Over-Approximating Terms Reachable by Context-Sensitive Rewriting

Abstract : For any left-linear context-sensitive term rewrite system and any regular language of ground terms I, we build a finite tree automaton that recognizes a superset of the descendants of I, i.e. of the terms reachable from I by context-sensitive rewriting.
Document type :
Conference papers
Complete list of metadata
Contributor : Pierre Réty Connect in order to contact the contributor
Submitted on : Friday, November 6, 2015 - 10:06:34 AM
Last modification on : Saturday, June 25, 2022 - 10:12:45 AM


  • HAL Id : hal-01225332, version 1



Nirina Andrianarivelo, Pierre Réty. Over-Approximating Terms Reachable by Context-Sensitive Rewriting. Reachability Problems - 9th International Workshop RP 2015, Sep 2015, Varsaw, Poland. ⟨hal-01225332⟩



Record views