2010
DOI: 10.1016/j.jlap.2009.08.001
|View full text |Cite
|
Sign up to set email alerts
|

Characterizing and proving operational termination of deterministic conditional term rewriting systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
21
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 20 publications
(21 citation statements)
references
References 5 publications
0
21
0
Order By: Relevance
“…As reported in [15,Example 8], U(R) is not terminating. However, our methods in this paper will show that R is operationally terminating (Example 19).…”
Section: Example 1 Consider the Following Ctrs R [15 Example 8] H(dmentioning
confidence: 62%
“…As reported in [15,Example 8], U(R) is not terminating. However, our methods in this paper will show that R is operationally terminating (Example 19).…”
Section: Example 1 Consider the Following Ctrs R [15 Example 8] H(dmentioning
confidence: 62%
“…e.g. [16,14]), context-sensitive rewrite systems naturally also appear as intermediate representations in many areas relying on transformations, such as program transformation and termination analysis of rewrite systems with conditions [6,20] / under strategies [8].…”
Section: This Trs Is Non-terminating and Not Even Weakly Normalizingmentioning
confidence: 99%
“…Note that the definition of U is essentially equivalent to that in [26,29]. An unraveling U is simulation-sound (simulation-preserving and simulation-…”
Section: Unraveled Trss With Call-by-value Interpretationmentioning
confidence: 99%
“…The unraveling U is not simulation-sound for every DCTRS [27]. To avoid this difficulty of non-'simulation-soundness' of U, a restriction to the rewrite relations of the unraveled TRSs is shown in [29], which is done by the context-sensitive condition given by the replacement map μ such that μ(U ρ i ) = {1} for every U ρ i in Definition 3.1. We denote the context-sensitive TRS (U(R), μ) by U cs (R).…”
Section: Unraveled Trss With Call-by-value Interpretationmentioning
confidence: 99%