Proving Liveness by Backwards Reachability
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena
We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing the transitive closure of the transition relation. The set of states from which termination or some liveness property is guaranteed is computed by a backwards reachability analysis. A central technique for handling concurrency is a check for certain commutativity properties. The method is not complete. However, it can be seen as a complement to other methods for proving termination, in that it transforms a termination problem into a simpler one with a larger set of terminated states. We show the usefulness of our method by applying it to existing programs from the literature. We have also implemented it in the framework of Regular Model Checking, and used it to automatically verify non-starvation for parameterized algorithms.
In In Proceedings of the 17th International Conference on Concurrency Theory (CONCUR), 2006,
Last version (pdf) 2006