Modular Verification of Finite Blocking in Non-terminating Programs
OPEN ACCESS
Loading...
Author / Producer
Date
2015
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
Rights / License
Abstract
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.
Permanent link
Publication status
published
External links
Book title
29th European Conference on Object-Oriented Programming (ECOOP 2015)
Volume
37
Pages / Article No.
639 - 663
Publisher
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Event
29th European Conference on Object-Oriented Programming (ECOOP 2015)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Program verification; Concurrency; Liveness; Progress; Obligations
Organisational unit
03653 - Müller, Peter / Müller, Peter
Notes
See also: http://e-citations.ethbib.ethz.ch/view/pub:148421.