Why3 is the next generation of the Why software verification platform. Why3 clearly
separates the purely logical specification part from generation of verification conditions for …

Mechanical proof assistants have always had support for inductive proofs. Sometimes an
alternative to proof assistants, satisfiability modulo theories (SMT) solvers bring the hope of …

We introduce Refinement Reflection, a new framework for building SMT-based deductive
verifiers. The key idea is to reflect the code implementing a user-defined function into the …

Boogie is an intermediate verification language, designed to make the prescription of
verification conditions natural and convenient. It serves as a common intermediate …

A key driver of SMT over the past decade has been an interchange format, SMT-LIB, and a
growing set of benchmarks sharing this common format. SMT-LIB captures very well an …

PVS is a prototype system for writing specifications and constructing proofs. Its development
has been shaped by our experiences studying or using several other systems 1 and …

Traditionally, the full verification of a program's functional correctness has been obtained
with pen and paper or with interactive proof assistants, whereas only reduced verification …

After many years of successful development of new approaches for software verification,
there is a need to consolidate the knowledge about the different abstract domains and …

This paper describes a new architecture for first-order resolution and superposition theorem
provers called AVATAR (Advanced Vampire Architecture for Theories and Resolution). Its …

Intermediate languages are a paradigm to separate concerns in software verification
systems when bridging the gap between programming languages and the logics understood …