Transforming Prefix-constrained or Controlled Rewrite Systems

14 pages•Published: March 26, 2017

Nirina Andrianarivelo, Vivien Pelletier and Pierre Réty

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 com- putations, and preserve termination. In this way, prefix-constrained rewriting and controlled rewriting can be run, and termination can be checked, using the usual tools for ordinary rewriting.

Keyphrases: controlled rewrite system, prefix constrained rewrite system, term rewriting, termination

In: Mohamed Mosbah and Michael Rusinowitch (editors). SCSS 2017. The 8th International Symposium on Symbolic Computation in Software Science 2017, vol 45, pages 49-62.

Links:	https://easychair.org/publications/paper/QKNZ
	https://doi.org/10.29007/m335

BibTeX entry

@inproceedings{SCSS2017:Transforming_Prefix_constrained_Controlled,
  author    = {Nirina Andrianarivelo and Vivien Pelletier and Pierre Réty},
  title     = {Transforming Prefix-constrained or Controlled Rewrite Systems},
  booktitle = {SCSS 2017. The 8th International Symposium on Symbolic Computation in Software Science 2017},
  editor    = {Mohamed Mosbah and Michael Rusinowitch},
  series    = {EPiC Series in Computing},
  volume    = {45},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/QKNZ},
  doi       = {10.29007/m335},
  pages     = {49-62},
  year      = {2017}}

Download PDF Open PDF in browser