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.
Type de document :
Communication dans un congrès
Reachability Problems - 9th International Workshop RP 2015, Sep 2015, Varsaw, Poland. Springer, LNCS, 9328, pp 128--139
Liste complète des métadonnées

https://hal.inria.fr/hal-01225332
Contributeur : Pierre Réty <>
Soumis le : vendredi 6 novembre 2015 - 10:06:34
Dernière modification le : samedi 7 novembre 2015 - 01:06:07

Identifiants

  • HAL Id : hal-01225332, version 1

Collections

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. Springer, LNCS, 9328, pp 128--139. 〈hal-01225332〉

Partager

Métriques

Consultations de la notice

48