Effective support for custom proof automation is essential for large-scale interactive proof
development. However, existing languages for automation via tactics either (a) provide no …

Effective support for custom proof automation is essential for large scale interactive proof
development. However, existing languages for automation via* tactics* either (a) provide no …

Coq supports a range of built-in tactics, which are engineered primarily to support backward
reasoning. Starting from a desired goal, the Coq programmer can use these tactics to …

This document presents a lightweight approach–combining Coq and OCaml typecheckers–
in order to formally verify higher-order imperative programs for partial correctness. In this …

Convex polyhedra provide a relational abstraction of numerical properties for static analysis
of programs by abstract interpretation. We describe a lightweight certification of polyhedral …

Foundational proof assistants simultaneously offer both expressive logics and strong
guarantees. The price they pay for this flexibility is often the need to build and check explicit …

Current work on computational reflection is single-minded; each reflective procedure is
written with a specific application or scope in mind. Composition of these reflective …

Interactive theorem proving is a technology of fundamental importance for mathematics and
computer-science. It is based on expressive logical foundations and implemented in a highly …

The Unix diff utility that compares lines of text is used pervasively by version control systems.
Yet certain changes to a program may be difficult to describe accurately in terms of …

Earlier work showed that automatic verification of GMP's algorithms using Why3 exceeds the
current capabilities of automatic solvers. To complete this verification, numerous cut …