Over-Approximating Terms Reachable by Context-Sensitive Rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Over-Approximating Terms Reachable by Context-Sensitive Rewriting

Nirina Andrianarivelo
  • Function : Author

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.
No file

Dates and versions

hal-01225332 , version 1 (06-11-2015)

Identifiers

  • HAL Id : hal-01225332 , version 1

Cite

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⟩
46 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More