Download PDFOpen PDF in browser

Transforming Prefix-constrained or Controlled Rewrite Systems

14 pagesPublished: March 26, 2017

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:
BibTeX entry
@inproceedings{SCSS2017:Transforming_Prefix_constrained_or_Controlled,
  author    = {Nirina Andrianarivelo and Vivien Pelletier and Pierre R\textbackslash{}'ety},
  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},
  pages     = {49--62},
  year      = {2017},
  publisher = {EasyChair},
  bibsource = {EasyChair, http://www.easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/QKNZ},
  doi       = {10.29007/m335}}
Download PDFOpen PDF in browser