Transforming Prefix-Constrained or Controlled Rewrite Systems - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

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

Dates and versions

hal-01445668 , version 1 (25-01-2017)

Identifiers

  • HAL Id : hal-01445668 , version 1

Cite

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. ⟨hal-01445668⟩
47 View
0 Download

Share

Gmail Facebook X LinkedIn More