Let’s verify this with Why3

Bobot, François; Filliâtre, Jean-Christophe; Marché, Claude; Paskevich, Andrei

doi:10.1007/s10009-014-0314-5

Cited by 48 publications

(47 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Verification of complex code with Why3 and automatic provers typically expects user guidance through addition of intermediate assertions [19] and verification-only code (ghost code) [11]. See Why3's Web site 6 for an extensive tutorial and a large collection of examples [6].…”

Section: From Whyml To Cmentioning

confidence: 99%

How to Get an Efficient yet Verified Arbitrary-Precision Integer Library

Rieu-Helft

Marché

Melquiond

2017

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The GNU Multi-Precision library is a widely used, safetycritical, library for arbitrary-precision arithmetic. Its source code is written in C and assembly, and includes intricate state-of-the-art algorithms for the sake of high performance. Formally verifying the functional behavior of such highly optimized code, not designed with verification in mind, is challenging. We present a fully verified library designed using the Why3 program verifier. The use of a dedicated memory model makes it possible to have the Why3 code be very similar to the original GMP code. This library is extracted to C and is compatible and performancecompetitive with GMP.

show abstract

Section: From Whyml To Cmentioning

confidence: 99%

How to Get an Efficient yet Verified Arbitrary-Precision Integer Library

Rieu-Helft

Marché

Melquiond

2017

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…We based our prototype implementation on the Why3 platform [4]. Why3 offers an expressive formalization language, an efficient Weakest-Precondition (WP) calculus [5] implementation and a rich API to send the obtained verification conditions to several automated solvers.…”

Section: Introductionmentioning

confidence: 99%

Automated Deductive Verification for Ladder Programming

Cousineau

Mentré

Inoue

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Ladder Logic is a programming language standardized in IEC 61131-3 and widely used for programming industrial Programmable Logic Controllers (PLC). A PLC program consists of inputs (whose values are given at runtime by factory sensors), outputs (whose values are given at runtime to factory actuators), and the logical expressions computing output values from input values. Due to the graphical form of Ladder programs, and the amount of inputs and outputs in typical industrial programs, debugging such programs is time-consuming and error-prone. We present, in this paper, a Why3based tool research prototype we have implemented for automating the use of deductive verification in order to provide an easy-to-use and robust debugging tool for Ladder programmers.

show abstract

“…The goal is to provide simplified interactions between the user and the failing VC, so as to investigate a proof task without the need to rely on an external interactive prover. A specificity of SPARK is that the underlying toolchain from the given input Ada program to the VCs makes use of the external intermediate language Why3 [6] that itself provides access to many different automated provers (mainly Alt-Ergo, CVC4 and Z3) but also general purpose interactive theorem provers (Coq, Isabelle/HOL, PVS). Indeed, an extreme mean to investigate a proof failure is to launch an interactive theorem prover on the failing VC and to start writing a manual proof.…”

Section: Introductionmentioning

confidence: 99%

Lightweight Interactive Proving inside an Automatic Program Verifier

Dailler

Marché

Moy

2018

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Among formal methods, the deductive verification approach allows establishing the strongest possible formal guarantees on critical software. The downside is the cost in terms of human effort required to design adequate formal specifications and to successfully discharge the required proof obligations. To popularize deductive verification in an industrial software development environment, it is essential to provide means to progressively transition from simple and automated approaches to deductive verification. The SPARK environment, for development of critical software written in Ada, goes towards this goal by providing automated tools for formally proving that some code fulfills the requirements expressed in Ada contracts.In a program verifier that makes use of automatic provers to discharge the proof obligations, a need for some additional user interaction with proof tasks shows up: either to help analyzing the reason of a proof failure or, ultimately, to discharge the verification conditions that are out-of-reach of state-of-the-art automatic provers. Adding interactive proof features in SPARK appears to be complicated by the fact that the proof toolchain makes use of the independent, intermediate verification tool Why3, which is generic enough to accept multiple front-ends for different input languages. This paper reports on our approach to extend Why3 with interactive proof features and also with a generic client-server infrastructure allowing integration of proof interaction into an external, front-end graphical user interface such as the one of SPARK. * Work partly supported by the Joint Laboratory ProofInUse (ANR-13-LAB3-0007, https://www.adacore.com/ proofinuse) of the French national research organization

show abstract

Let’s verify this with Why3

Abstract: We present solutions to the three challenges of the VerifyThis competition held at the 18th FM symposium in August 2012. These solutions use the Why3 environment for deductive program verification.

Cited by 48 publications

References 13 publications

How to Get an Efficient yet Verified Arbitrary-Precision Integer Library

How to Get an Efficient yet Verified Arbitrary-Precision Integer Library

Automated Deductive Verification for Ladder Programming

Lightweight Interactive Proving inside an Automatic Program Verifier

Contact Info

Product

Resources

About