The automation of verification techniques based on first-order logic specifications has
benefitted greatly from verification infrastructures such as Boogie and Why. These offer an …

We present a new, completely redesigned, version of F*, a language that works both as a
proof assistant as well as a general-purpose, verification-oriented, effectful programming …

Abstract Development of formal proofs of correctness of programs can increase actual and
perceived reliability and facilitate better understanding of program specifications and their …

Several recent projects have shown the feasibility of verifying low-level systems software.
Verifications based on automated theorem-proving have omitted reasoning about first-class …

In previous work, we introduced an approach to program verification based on characteristic
formulae. The approach consists of generating a higher-order logic formula from the source …

We report on our experience implementing a lightweight, fully verified relational database
management system (RDBMS). The functional specification of RDBMS behavior, RDBMS …

Dijkstra monads enable a dependent type theory to be enhanced with support for specifying
and verifying effectful code via weakest preconditions. Together with their closely related …

A definitional interpreter defines the semantics of an object language in terms of the (well-
known) semantics of a host language, enabling understanding and validation of the …

Characteristic Formulae (CF) offer a productive, principled approach to generating
verification conditions for higher-order imperative programs, but so far the soundness of CF …

We consider the problem of specifying combinations of data structures with complex sharing
in a manner that is both declarative and results in provably correct code. In our approach …