Algorithms for mutual exclusion
Algorithms for mutual exclusion
Fairness
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Monitors: an operating system structuring concept
Communications of the ACM
Concurrent control with “readers” and “writers”
Communications of the ACM
Operating System Concepts
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
Termination of just/fair computations in term rewriting
Information and Computation
Termination of fair computations in term rewriting
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
TPA: termination proved automatically
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (TRSs) can be applied to prove liveness properties in fair computations. We do this using a new transformation which is stronger than the sound transformation from [5] but still is suitable for automation. On the one hand we show completeness of this approach under some mild conditions. On the other hand we show how this approach applies to some examples completely automatically, using the TPA tool designed for proving relative termination of TRSs. In particular we succeed in proving liveness in the classical readers-writers synchronization problem.