Skip to Main content Skip to Navigation
Conference papers

Over-Approximating Terms Reachable by Context-Sensitive Rewriting

Nirina Andrianarivelo Pierre Réty 1
1 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans
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.
Keywords : tree automaton reachability context-sensitive term rewriting
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/hal-01225332
Contributor : Pierre Réty <>
Submitted on : Friday, November 6, 2015 - 10:06:34 AM
Last modification on : Thursday, January 17, 2019 - 3:06:06 PM

Identifiers

  • HAL Id : hal-01225332, version 1

Collections

MSL | MSL-THESE | UNIV-ORLEANS

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

117

 

Contact                    Legal Notice                    Personal Data