Modular Verification of Finite Blocking in Non-terminating Programs

Pontus Boström, Peter Müller

    Research output: Chapter in Book/Conference proceedingConference contributionScientificpeer-review

    12 Citations (Scopus)


    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.
    Original languageUndefined/Unknown
    Title of host publication29th European Conference on Object-Oriented Programming (ECOOP 2015)
    EditorsJohn Boyland
    Publication statusPublished - 2015
    MoE publication typeA4 Article in a conference publication
    EventEuropean Conference on Object-Oriented Programming (ECOOP) - 29th European Conference on Object-Oriented Programming (ECOOP 2015)
    Duration: 5 Jul 201510 Jul 2015


    ConferenceEuropean Conference on Object-Oriented Programming (ECOOP)

    Cite this