Transforming Prefix-Constrained or Controlled Rewrite Systems

Abstract : We present two techniques for transforming any prefix-constrained and any controlled term rewrite system into an ordinary rewrite system. We prove that both transformations preserve the rewrite computations, and preserve termination. In this way, prefix-constrained rewriting and controlled rewriting can be run, and termination can be checked, thanks to the usual techniques and tools for ordinary rewriting.
Type de document :
Communication dans un congrès
8th International Symposium on Symbolic Computation in Software Science (SCSS 2017), Apr 2017, Gammarth, Tunisia. 2017, EPiC Series
Liste complète des métadonnées

https://hal.inria.fr/hal-01445668
Contributeur : Pierre Réty <>
Soumis le : mercredi 25 janvier 2017 - 11:13:51
Dernière modification le : mercredi 16 mai 2018 - 12:14:01

Identifiants

  • HAL Id : hal-01445668, version 1

Collections

Citation

Nirina Andrianarivelo, Vivien Pelletier, Pierre Réty. Transforming Prefix-Constrained or Controlled Rewrite Systems. 8th International Symposium on Symbolic Computation in Software Science (SCSS 2017), Apr 2017, Gammarth, Tunisia. 2017, EPiC Series. 〈hal-01445668〉

Partager

Métriques

Consultations de la notice

40