When using a proof assistant to reason in an embedded logic--like separation logic--one
cannot benefit from the proof contexts and basic tactics of the proof assistant. This results in …

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

The development of concurrent separation logic (CSL) has sparked a long line of work on
modular verification of sophisticated concurrent programs. Two of the most important …

A number of tools have been developed for carrying out separation-logic proofs
mechanically using an interactive proof assistant. One of the most advanced such tools is …

We present an extensive mechanization of the metatheory of Martin-Löf Type Theory (MLTT)
in the Coq proof assistant. Our development builds on pre-existing work in Agda to show not …

We formalise the computational undecidability of validity, satisfiability, and provability of first-
order formulas following a synthetic approach based on the computation native to Coq's …

We report on the development of the HoTT library, a formalization of homotopy type theory in
the Coq proof assistant. It formalizes most of basic homotopy type theory, including …

The theory of analysis in Isabelle/HOL derives from earlier formalizations that were limited to
specific concrete types: ℝ, ℂ and ℝ n. Isabelle's new analysis theory unifies and generalizes …

The C programming language was created by Thompson and Ritchie around 1970 as the
implementation language of the Unix operating system [Rit93]. The development of Unix …

Formal verification of algorithms often requires a choice between definitions that are easy to
reason about and definitions that are computationally efficient. One way to reconcile both …