Modular Verification of Finite Blocking in Non-terminating Programs

A4 Konferenspublikationer

Interna författare/redaktörer

Publikationens författare: Pontus Boström, Peter Müller
Redaktörer: John Boyland
Publiceringsår: 2015
Tidskrift: LIPIcs
Moderpublikationens namn: 29th European Conference on Object-Oriented Programming (ECOOP 2015)
Volym: 37
Artikelns första sida, sidnummer: 639
Artikelns sista sida, sidnummer: 663
ISBN: 978-3-939897-86-6
ISSN: 1868-8969


Most multi-threaded programs synchronize threads via blocking operations such as acquiring locks or joining other threads. An important correctness property of such programs is for each thread to make progress, that is, not to be blocked forever. For programs in which all threads terminate, progress essentially follows from deadlock freedom. However, for the common case that a program contains non-terminating threads such as servers or actors, deadlock freedom is not sufficient. For instance, a thread may be blocked forever by a non-terminating thread if it attempts to join that thread or to acquire a lock held by that thread.
In this paper, we present a verification technique for finite blocking in non-terminating programs. The key idea is to track explicitly whether a thread has an obligation to perform an operation that unblocks another thread, for instance, an obligation to release a lock or to terminate. Each obligation is associated with a measure to ensure that it is fulfilled within finitely many steps. Obligations may be used in specifications, which makes verification modular. We formalize our technique via an encoding into Boogie, which treats different kinds of obligations uniformly. It subsumes termination checking as a special case.

Senast uppdaterad 2020-21-01 vid 01:27