In the quest for tractable methods for reasoning about concurrent algorithms both
rely/guarantee logic and separation logic have made great advances. They both seek to …

Abstraction is key to understanding and reasoning about large computer systems.
Abstraction is simple to achieve if the relevant data structures are disjoint, but rather difficult …

Separation logic is an extension of Hoare's logic which supports a local way of reasoning
about programs that mutate memory. We present a study of the semantic structures lying …

We now turn our attention to applying the theory of refinement to Object-Z. In this chapter we
adapt the existing refinement rules to Object-Z specifications consisting of a single class …

Compositional abstractions underly many reasoning principles for concurrent programs: the
concurrent environment is abstracted in order to reason about a thread in isolation; and …

Rely-Guarantee reasoning is a well-known method for verification of shared-variable
concurrent programs. However, it is difficult for users to define rely/guarantee conditions …

We study the relationship between Concurrent Separation Logic (CSL) and the assume-
guarantee (AG) method (aka rely-guarantee method). We show in three steps that CSL can …

Shared memory concurrency relies on synchronisation primitives: compare-and-swap, load-
reserve/store-conditional (aka LL/SC), language-level mutexes, and so on. In a sequentially …

We present a proof calculus and method for the static verification of assertions and
procedure specifications in shared-memory concurrent programs. The key idea in our …

Concurrent Separation Logic (CSL) was originally advanced in papers of the authors
published in Theoretical Computer Science for John Reynolds's 70th Birthday Festschrift …