This paper introduces (one-path) reachability logic, a language-independent proof system
for program verification, which takes an operational semantics as axioms and derives …

This paper introduces matching logic, a novel framework for defining axiomatic semantics for
programming languages, inspired from operational semantics. Matching logic specifications …

This paper presents a verification framework that is parametric in a (trusted) operational
semantics of some programming language. The underlying proof system is language …

We propose a methodology based on testing as a framework to capture the interactions of a
machine represented in a denotational model and the data it manipulates. Using a …

It is not always clear what computer programs mean in the various languages in which they
can be written, yet a picture can be worth 1000 words, a diagram 1000 instructions. In this …

This paper presents an overview of the technical foundations and current directions of
Kestrel's approach to mechanizing software development. The approach emphasizes …

Protocols may be derived from initial components by composition, refinement, and
transformation. Adding function variables to a previous protocol logic, we develop an …

We advocate an automated refinement approach to developing programs and their proofs.
The approach is partially embodied in the Specware system [6] which has found industrial …

Hilbert and Ackermann asked for a method to consistently extend incomplete theories to
complete theories. Gödel essentially proved that any theory capable of encoding its own …

In this paper we propose actor-networks as a formal model of computation in heterogenous
networks of computers, humans and their devices, where these new procedures run; and we …