2008
DOI: 10.1016/j.ic.2007.11.002
|View full text |Cite
|
Sign up to set email alerts
|

Termination of just/fair computations in term rewriting

Abstract: The main goal of this paper is to apply rewriting termination technology-enjoying a quite mature set of termination results and tools-to the problem of proving automatically the termination of concurrent systems under fairness assumptions. We adopt the thesis that a concurrent system can be naturally modeled as a rewrite system, and develop a theoretical approach to systematically transform, under reasonable assumptions, fair-termination problems into ordinary termination problems of associated relations, to w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2012
2012

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 27 publications
0
1
0
Order By: Relevance
“…However, under fairness assumptions about how each receiver object will apply the receive rule, and each sender object will receive acknowledgments and clear its cell, the fault-tolerant system is indeed fairly terminating. Proof techniques for termination of rewrite theories under fairness assumptions have been studied in [293], substantially extending prior work in [386,387]. Another way in which termination techniques need to be extended is to reason about termination of R when executed under a given strategy (see Section 3.5).…”
Section: Terminationmentioning
confidence: 99%
“…However, under fairness assumptions about how each receiver object will apply the receive rule, and each sender object will receive acknowledgments and clear its cell, the fault-tolerant system is indeed fairly terminating. Proof techniques for termination of rewrite theories under fairness assumptions have been studied in [293], substantially extending prior work in [386,387]. Another way in which termination techniques need to be extended is to reason about termination of R when executed under a given strategy (see Section 3.5).…”
Section: Terminationmentioning
confidence: 99%