One Logic To Use Them All - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

One Logic To Use Them All


Deductive program verification is making fast progress these days. One of the reasons is a tremendous improvement of theorem provers in the last two decades. This includes various kinds of automated theorem provers, such as ATP systems and SMT solvers, and interactive proof assistants. Yet most tools for program verification are built around a single theorem prover. Instead, we defend the idea that a collaborative use of several provers is a key to easier and faster verification. This paper introduces a logic that is designed to target a wide set of theorem provers. It is an extension of first-order logic with polymorphism, algebraic data types, recursive definitions, and inductive predicates. It is implemented in the tool Why3, and has been successfully used in the verification of many non-trivial programs.
Fichier principal
Vignette du fichier
main.pdf (477.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00809651 , version 1 (09-04-2013)


  • HAL Id : hal-00809651 , version 1


Jean-Christophe Filliâtre. One Logic To Use Them All. CADE 24 - the 24th International Conference on Automated Deduction, Jun 2013, Lake Placid, NY, United States. ⟨hal-00809651⟩
1457 View
952 Download


Gmail Facebook X LinkedIn More