• Publications
  • Influence
Why3: Shepherd Your Herd of Provers
TLDR
Why3 is the next generation of the Why software verification platform. Expand
Implementing polymorphism in SMT solvers
TLDR
We show the small number of modifications needed to bring parametric polymorphism to our SMT solver. Expand
Real Behavior of Floating Point Numbers *
We present an efficient constraint programming (CP) approach to the SMTLIB theory of quantifier-free floating-point arithmetic (QF FP). We rely on dense interreduction between many domainExpand
Expressing Polymorphic Types in a Many-Sorted Language
TLDR
We present a three-stage scheme where the last stage eliminates polymorphic types while adding the necessary "annotations" to preserve soundness, and the first two stages serve to protect certain terms so that they can keep their original unannotated form. Expand
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
TLDR
This paper describes a novel decision procedure for quantifier-free linear integer arithmetic. Expand
Deductive Proof of Ethereum Smart Contracts Using Why3
TLDR
We propose a formal language that performs deductive verification on an Ethereum Blockchain application based on smart contracts, which are self-executing digital contracts. Expand
Let’s verify this with Why3
TLDR
We present solutions to the three challenges of the VerifyThis competition held at the 18th FM symposium. Expand
Preserving User Proofs across Specification Changes
TLDR
In the context of deductive program verification, both the specification and the code evolve as the verification process carries on. Expand
Separation Predicates: A Taste of Separation Logic in First-Order Logic
TLDR
This paper introduces separation predicates, a technique to reuse some ideas from separation logic in the framework of program verification using a traditional first-order logic. Expand
Sharpening Constraint Programming Approaches for Bit-Vector Theory
TLDR
We address the challenge of developing efficient Constraint Programming-based approaches for solving formulas over the quantifier-free fragment of the theory of bitvectors (BV), which is of paramount importance in software verification. Expand
...
1
2
3
...