The Lamport diagram is a pervasive and intuitive tool for informal reasoning about “happens-
before” relationships in a concurrent system. However, traditional axiomatic formalizations of …

Very relaxed concurrency memory models, like those of the Arm-A, RISC-V, and IBM Power
hardware architectures, underpin much of computing but break a fundamental intuition …

Sledgehammer is a component of the Isabelle/HOL proof assistant that integrates external
automatic theorem provers (ATPs) to discharge interactive proof obligations. As a safeguard …

Due to the increasing interest in autonomously driving cars, safety issues of such systems
are of utmost importance. Safety in this sense is primarily the absence of collisions, which is …

This thesis studies the formalization of graphs in the Isabelle/HOL proof assistant. It
describes a library for directed graphs and discusses its usage for undirected graphs and …

This paper presents an algorithm that redirects proofs by contradiction. The input is a
refutation graph, as produced by an automatic theorem prover (eg, E, SPASS, Vampire, Z3); …

We give a scheme for interpreting shaded tangles as quantum programs, with the property
that isotopic tangles yield equivalent programs. We analyze many known quantum programs …

We give a scheme for interpreting shaded tangles as quantum circuits, with the property that
if two shaded tangles are ambient isotopic, their corresponding computational effects are …

Systems code, such as operating system and hypervisor kernel code, is a prime target for
software verification, being security-critical yet relatively small. However, it is highly …

Separation logic has been very successful at giving concise specifications and short proofs
to pointer-manipulating programs. Unfortunately, the term separation logic covers a whole …