TLA+ is a language intended for the high-level specification of reactive, distributed, and in
particular asynchronous systems. Combining the linear-time temporal logic TLA and …

Verification of Parallel Programs with the Owicki-Gries and Rely-Guarantee Methods in
Isabelle/HOL Page 1 Verification of Parallel Programs with the Owicki-Gries and Rely-Guarantee …

The specification language TLA+ was designed by Lamport for formally describing and
reasoning about distributed algorithms. It is described in Lamport's book Specifying Systems …

We present a formalization of the Gries/Owicki method for correctness proofs of concurrent
imperative programs with shared variables in the theorem prover Isabelle/HOL. Syntax …

Although a number of mechanical provers have been introduced and applied widely by
academic researchers, these provers are rarely used in the practical development of …

Linearizability is a global correctness criterion for concurrent systems. One technique to
prove linearizability is applying a composition theorem which reduces the proof of a property …

Abstract Reasoning about algorithms stands out as an essential challenge of computer
science. Much work has been put into the development of formal methods, within recent …

Part I of this thesis presents a strategy for compiling distributed systems specified in IOA into
Java programs running on a group of networked workstations. IOA is a formal language for …

We have provided mechanical verification support for DisCo, an object oriented language
and method for the specification of reactive systems. The paper has two main contributions …

Much of the work on verifying software has been done on simple, often artificial, languages
or subsets of existing languages to avoid difficult details. In trying to verify a secure …