Fairness in term rewriting systems
Proc. of the first international conference on Rewriting techniques and applications
Fairness
Full-commutation and fair-termination in equational (and combined) term-rewriting systems
Proc. of the 8th international conference on Automated deduction
Journal of Symbolic Computation
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Selected papers of the Second Workshop on Concurrency and compositionality
Handbook of logic in computer science (vol. 2)
Transfinite reductions in orthogonal term rewriting systems
Information and Computation
Advanced topics in term rewriting
Advanced topics in term rewriting
Computing in Systems Described by Equations
Computing in Systems Described by Equations
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Fair Termination is Decidable for Ground Systems
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Proving termination of membership equational programs
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of fair computations in term rewriting
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
AProVE 1.2: automatic termination proofs in the dependency pair framework
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving liveness with fairness using rewriting
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Localized fairness: a rewriting semantics
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
TPA: termination proved automatically
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Simplification Orderings: History Of Results
Fundamenta Informaticae
| Hi-index | 0.00 |
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 which standard rewriting termination techniques and tools can be applied. Our theoretical results are combined into a practical proof method for proving fair-termination that can be automated and can be supported by current termination tools. We illustrate this proof method with some concrete examples and briefly comment on future extensions.