Keywords
Computer Science and Digital Science
 A2.1.1. Semantics of programming languages
 A2.1.4. Functional programming
 A2.1.6. Concurrent programming
 A2.1.10. Domainspecific languages
 A2.1.11. Proof languages
 A2.4.2. Modelchecking
 A2.4.3. Proofs
 A6.2.1. Numerical analysis of PDE and ODE
 A7.2. Logic in Computer Science
 A7.2.1. Decision procedures
 A7.2.2. Automated Theorem Proving
 A7.2.3. Interactive Theorem Proving
 A7.2.4. Mechanized Formalization of Mathematics
 A8.10. Computer arithmetic
Other Research Topics and Application Domains
 B5.2.2. Railway
 B5.2.3. Aviation
 B5.2.4. Aerospace
 B6.1. Software industry
 B9.5.1. Computer science
 B9.5.2. Mathematics
1 Team members, visitors, external collaborators
Research Scientists
 Claude Marché [Team leader, Inria, Senior Researcher, HDR]
 Sylvie Boldo [Inria, Senior Researcher, HDR]
 JeanChristophe Filliâtre [CNRS, Senior Researcher, HDR]
 Guillaume Melquiond [Inria, Senior Researcher, HDR]
Faculty Members
 Sylvain Conchon [Univ ParisSaclay, Professor, HDR]
 Andrei Paskevich [Univ ParisSaclay, Associate Professor]
PhD Students
 Louise Ben SalemKnapp [CEA, Until Sept 2021]
 Xavier Denis [Univ ParisSaclay]
 Diane GalloisWong [Univ ParisSaclay, until Feb 2021]
 Quentin Garchery [Université de Paris]
 Antoine Lanco [Inria]
 Houda Mouhcine [Inria, from Oct 2021]
 Clément Pascutto [Tarides, CIFRE]
Technical Staff
 Benedikt Becker [Inria, Engineer, until Oct 2021]
 Guillaume Cluzel [Inria, Engineer, from Jun 2021 until Nov 2021]
 Yacine El Haddad [Inria, Engineer, from Sep 2021]
Interns and Apprentices
 Louise Leclerc [Inria, from Jun 2021 until Jul 2021]
 Houda Mouhcine [Inria, from Apr 2021 until Jul 2021]
 Paul Patault [Inria, from May 2021 until Jul 2021]
 Gaetan Serre [Inria, from May 2021 until Jul 2021]
Administrative Assistant
 Alexandra Merlin [Inria]
External Collaborators
 Thibaut Balabonski [Univ ParisSaclay]
 JacquesHenri Jourdan [CNRS, from Mar 2021]
 Chantal Keller [Univ ParisSaclay]
2 Overall objectives
2.1 Presentation
The general objective of the Toccata project is to promote formal specification and computerassisted proof in the development of software that requires high assurance in terms of safety and correctness with respect to its intended behavior. Such safetycritical software appears in many application domains like transportation (e.g., aviation, aerospace, railway, and more and more in cars), communication (e.g., internet, smartphones), health devices, etc. The number of tasks performed by software is quickly increasing, together with the number of lines of code involved. Given the need of high assurance of safety in the functional behavior of such applications, the need for automated (i.e., computerassisted) methods and techniques to bring guarantee of safety became a major challenge. In the past and at present, the most widely used approach to check safety of software is to apply heavy test campaigns, which take a large part of the costs of software development. Yet they cannot ensure that all the bugs are caught, and remaining bugs may have catastrophic causes (e.g., the Heartbleed bug in OpenSSL library discovered in 2014).
Generally speaking, software verification approaches pursue three goals: (1) verification should be sound, in the sense that no bugs should be missed, (2) verification should not produce false alarms, or as few as possible, (3) it should be as automatic as possible. Reaching all three goals at the same time is a challenge. A large class of approaches emphasizes goals (2) and (3): testing, runtime verification, symbolic execution, model checking, etc. Static analysis, such as abstract interpretation, emphasizes goals (1) and (3). Deductive verification emphasizes (1) and (2). The Toccata project is mainly interested in exploring the deductive verification approach, although we also consider the other ones in some cases.
In the past decade, significant progress has been made in the domain of deductive program verification. This is emphasized by some success stories of application of these techniques on industrialscale software. For example, the Atelier B system was used to develop part of the embedded software of the Paris metro line 14 40 and other railwayrelated systems; a formally proved C compiler was developed using the Coq proof assistant 62; the L4verified project developed a formally verified microkernel with high security guarantees, using analysis tools on top of the Isabelle/HOL proof assistant 61. A bug in the JDK implementation of TimSort was discovered using the KeY environment 57 and a fixed version was proved sound. Another sign of recent progress is the emergence of deductive verification competitions (e.g., VerifyThis 2). Finally, recent trends in the industrial practice for development of critical software is to require more and more guarantees of safety, e.g., the new DO178C standard for developing avionics software adds to the former DO178B the use of formal models and formal methods. It also emphasizes the need for certification of the analysis tools involved in the process.
3 Research program
Panorama of Deductive Verification
There are two main families of approaches for deductive verification. Methods in the first family build on top of mathematical proof assistants (e.g., Coq, Isabelle) in which both the model and the program are encoded; the proof that the program meets its specification is typically conducted in an interactive way using the underlying proof construction engine. Methods from the second family proceed by the design of standalone tools taking as input a program in a particular programming language (e.g., C, Java) specified with a dedicated annotation language (e.g., ACSL 36, JML 46) and automatically producing a set of mathematical formulas (the verification conditions) which are typically proved using automatic provers (e.g., Z3 64, AltErgo 49, CVC4 35).
The first family of approaches usually offers a higher level of assurance than the second, but also demands more work to perform the proofs (because of their interactive nature) and makes them less easy to adopt by industry. Moreover, they generally do not allow to directly analyze a program written in a mainstream programming language like Java or C. The second kind of approaches has benefited in the past years from the tremendous progress made in SAT and SMT solving techniques, allowing more impact on industrial practices, but suffers from a lower level of trust: in all parts of the proof chain (the model of the input programming language, the VC generator, the backend automatic prover), potential errors may appear, compromising the guarantee offered. Moreover, while these approaches are applied to mainstream languages, they usually support only a subset of their features.
Overall Goals of the Toccata Project
One of our original skills is the ability to conduct proofs by using automatic provers and proof assistants at the same time, depending on the difficulty of the program, and specifically the difficulty of each particular verification condition. We thus believe that we are in a good position to propose a bridge between the two families of approaches of deductive verification presented above. Establishing this bridge is one of the goals of the Toccata project: we want to provide methods and tools for deductive program verification that can offer both a high amount of proof automation and a high guarantee of validity. Indeed, an axis of research of Toccata is the development of languages, methods and tools that are themselves formally proved correct. Recent advances in the foundations of deductive verification include various aspects such as reasoning efficiently on bitvector programs 54 or providing counterexamples when a proof does not succeed 50.
A specifically challenging aspect of deductive verification methods is how does one deal with memory mutation in general, an issue that appear under various similar forms such the reasoning on mutable data structures or on concurrent programs, with the common denominator of the tracking of memory change on shared data. The ability to track aliasing is also a key for the ability of specifying programs and conduct proofs using the advanced notion of ghost code7, notion that can be push forward very far as demonstrated by our work on ghost monitors 48.
In industrial applications, numerical calculations are very common (e.g. control software in transportation). Typically they involve floatingpoint numbers. Some of the members of Toccata have an internationally recognized expertise on deductive program verification involving floatingpoint computations. Our past work includes a new approach for proving behavioral properties of numerical C programs using FramaC/Jessie 34, various examples of applications of that approach 44, the use of the Gappa solver for proving numerical algorithms 52, an approach to take architectures and compilers into account when dealing with floatingpoint programs 45, 66. We contributed to the CompCert verified compiler, regarding the support for floatingpoint operations 3. We also contributed to the Handbook of FloatingPoint Arithmetic 65. A representative case study is the analysis and the proof of both the method error and the rounding error of a numerical analysis program solving the onedimension acoustic wave equation 4241. We published a reference book on the verification of floatingpoint algorithms with Coq 4. Our experience led us to a conclusion that verification of numerical programs can benefit a lot from combining automatic and interactive theorem proving 43, 44, 55. Verification of numerical programs is another main axis of Toccata.
Deductive program verification methods are built upon theorem provers to decide whether a expected proof obligation on a program is a valid mathematical proposition, hence working on deductive verification requires a certain amount of work on the aspect of design of theorem provers. We are involved in particular in the AltErgo SMT solver, for which we designed an original approach for reasoning on arithmetic facts 610 ; the Gappa tool dedicated to reasoning on rounding errors in floatingpoint computations 63; and the interval tactic to reason about real approximations 8. Proof by reflection is also a powerful approach for advanced reasoning about programs 9.
In the past, we have been more and more involved in the development of significantly large case studies and applications, such as for example the verification of matrix multiplication algorithms 5, the design of verified OCaml librairies 47, the realization of a platform for verification of shell scripts 38 1, or the correctbyconstruction design of an efficient library for arbitraryprecision arithmetic 9.
Our scientific programme detailed below is structured into four axes:
 Foundations and spreading of deductive program verification;
 Reasoning on mutable memory in program verification;
 Verification of Computer Arithmetic;
 Spreading Formal Proofs.
Let us conclude with more general considerations about our agenda of the next four years: we want to keep on
 with general audience actions;
 industrial transfer, in particular through an extension of the perimeter of the ProofInUse joint lab.
3.1 Foundations and spreading of deductive program verification
Permanent researchers: S. Conchon, J.C. Filliâtre, C. Marché, G. Melquiond, A. Paskevich
This axis covers the central theme of the team: deductive verification, from the point of view of its foundations but also our will to spread its use in software development. The general motto we want to defend is “deductive verification for the masses”. A nonexhaustive list of subjects we want to address is as follows.
 The verification of generalpurpose algorithms and data structures: the challenge is to discover adequate invariants to obtain a proof, in the most automatic way as possible, in the continuation of the current VOCaL project and the various case studies presented in Axis 4 below.
 Uniform approaches to obtain correctbyconstruction programs and libraries, in particular by automatic extraction of executable code (in OCaml, C, CakeML, etc.) from verified programs, and including innovative general methods like advanced ghost code, ghost monitoring, etc.
 Automated reasoning dedicated to deductive verification, so as to improve proof automation; improved combination of interactive provers and fully automated ones, proof by reflection.
 Improved feedback in case of proof failures: based on generation of counterexamples, or symbolic execution, or possibly randomized techniques à la quickcheck.
 Reduction of the trusted computing base in our toolchains: production of certificates from automatic proofs, for goal transformations (like those done by Why3), and from the generation of VCs
A significant part of the work achieved in this axis is related to the Why3 toolbox and its ecosystem, displayed on Figure 1. The boxes in red background correspond to the tools we develop in the Toccata team.
3.2 Reasoning on mutable memory in program verification
Permanent researchers: J.C. Filliâtre, C. Marché, G. Melquiond, A. Paskevich
This axis concerns specifically the techniques for reasoning on programs where aliasing is the central issue. It covers the methods based on typebased alias analysis and related memory models, on specific program logics such as separation logics, and extended modelchecking. It concerns the application on analysis of C or C++ codes, on Ada codes involving pointers, but also concurrent programs in general. The main topics planned are:
 The study of advanced type systems dedicated to verification, for controlling aliasing, and their use for obtaining easiertoprove verification conditions. Modern typing system in the style of Rust, involving ownership and borrowing, will be considered.
 The design of frontends of Why3 for the proofs of programs where aliasing cannot be fully controlled statically, via adequate memory models, aiming in particular at extraction to C; and also for concurrent programs.
 The continuation of fruitful work on concurrent parameterized systems, and its corresponding specific SMTbased modelchecking.
 Concurrent programming on weak memory models, on one hand as an extension of parameterized systems above, but also in the specific context of OCaml multicore.
 In particular in the context of the ProofInUse joint lab, design methods for Ada, C, C++ or Java using memory models involving finegrain analysis of pointers. Rust programs could be considered as well.
3.3 Verification of Computer Arithmetic
Permanent researchers: S. Boldo, C. Marché, G. Melquiond
We of course want to keep this axis which is a major originality of Toccata. The main topics of the next 4 years will be:
 Fundamental studies concerning formalization of floatingpoint computations, algorithms, and error analysis. Related to numerical integration, we will develop the relationships between mathematical stability and floatingpoint stability of numerical schemes.
 A significant effort dedicated to verification of numerical programs written in C, Ada, C++. This involves combining specifications in real numbers and computation in floatingpoint, and underlying automated reasoning techniques with floatingpoint numbers and real numbers. A new approach we have in mind concerns some variant of symbolic execution of both code and specifications involving real numbers.
 We have not yet studied embedded systems. Our approach is first to tackle numerical filters. This requires more results on fixedpoint arithmetic and a careful study of overflows.
 Also a specific focus on arbitrary precision integer arithmetic, in the continuation of the ongoing PhD thesis of R. RieuHelft.
3.4 Spreading Formal Proofs
Permanent researchers: S. Boldo, S. Conchon, J.C. Filliâtre, C. Marché, G. Melquiond, A. Paskevich
This axis covers applications in general. The applications we currently have in mind are:
 Hybrid Systems, i.e., systems mixing discrete and continuous transitions. This theme covers many aspects such as general techniques for formally reasoning of differential equations, and extending SMTbased reasoning. The challenge is to support both abstract mathematical reasoning and concrete program execution (e.g., using floatingpoint representation). Hybrid systems will be a common effort with other members of the future laboratory joint with LSV of ENS Cachan.
 Applied mathematics, in the continuation of the current efforts towards verification of Finite Element Method. It has only been studied in the mathematical point of view during this period. We plan to also consider their floatingpoint behavior and a demanding application is that of molecular simulation exhibited in the new EMC2 project. The challenge here is both in the mathematics to be formalized, in the numerical errors that have never been studied (and that may be huge in specific cases), and in the size of the programs, which requires that our tools scale.
 Continuation of our work on analysis of shell scripts. The challenge is to be able to analyze a large number of scripts (more than 30,000 in the corpus of Debian packages installation scripts) in an automatic manner. An approach that will be considered is some form of symbolic execution.
 Explore proof tools for mathematics, in particular automated reasoning for real analysis (application: formalization of the weak Goldbach conjecture), and in number theory.
 Obtain and distribute verified OCaml libraries, as expected outcome of the VOCaL project.
 Formalization of abstract interpretation and WP calculi: in the continuation of the former project Verasco, and an ongoing project proposal joint with CEA List. The difficulty of achieving full verification of such tools will be mitigated by use of certificate techniques.
4 Application domains
The application domains we target involve safetycritical software, that is where a highlevel guarantee of soundness of functional execution of the software is wanted. Currently our industrial collaborations or impact mainly belong to the domain of transportation: aerospace, aviation, railway, automotive.
Generally speaking, we believe that our increasing industrial impact is a representative success for our general goal of spreading deductive verification methods to a larger audience, and we are firmly engaged into continuing such kind of actions in the future.
4.1 SafetyCritical Software in Transportation

Transfer to aeronautics: Airbus France
Development of the control software of Airbus planes historically includes advanced usage of formal methods. A first aspect is the usage of the CompCert verified compiler for compiling C source code. Our work in cooperation with Gallium team for the safe compilation of floatingpoint arithmetic operations 3 is directly in application in this context. A second aspect is the usage of the FramaC environment for static analysis to verify the C source code. In this context, both our tools Why3 and AltErgo are indirectly used to verify C code.

Transfer to the community of Atelier B
In the former ANR project BWare, we investigated the use of Why3 and AltErgo as an alternative backend for checking proof obligations generated by Atelier B, whose main applications are railroadrelated. The transfer effort continues nowadays through the FUI project LCHIP.

ProofInUse joint lab: transfer to the community of Ada
development
Through the creation of the ProofInUse joint lab in 2014, with AdaCore company, we have a growing impact on the community of industrial development of safetycritical applications written in Ada. See the web page for a an overview of AdaCore's customer projects, in particular those involving the use of the SPARK Pro tool set. This impact involves both the use of Why3 for generating VCs on Ada source codes, and the use of AltErgo for performing proofs of those VCs.
The impact of ProofInUse can also be measured in term of job creation: the first two ProofInUse engineers, D. Hauzar and C. Fumex, employed initially on Inria temporary positions, have now been hired on permanent positions in AdaCore company. It is also interesting to notice that this effort allowed AdaCore company to get new customers, in particular the domains of application of deductive formal verification went beyond the historical domain of aerospace: application in automotive, cybersecurity, health (artificial heart).
4.2 Formal Analysis of Debian packages
Impactful results were produced in the context of the CoLiS project for the formal analysis of Debian packages. A first important step was the version 2 of the design of the CoLiS language done by B. Becker, C. Marché and other coauthors 39, that includes a modified formal syntax, a extended formal semantics, together with the design of concrete and symbolic interpreters. Those interpreters are specified and implemented in Why3, proved correct (following the initial approach for the concrete interpreter published in 2018 58 and an approach for symbolic interpretation 38), and finally extracted to OCaml code.
To make the extracted code effective, it must be linked together with a library that implements a solver for feature constraints 60, and also a library that formally specifies the behavior of basic UNIX utilities. The latter library is documented in details in a research report 59.
A third result is a large verification campaign running the CoLiS toolbox on all the packages of the current Debian distribution. The results of this campaign were reported in another article 37 that was submitted to TACAS conference in 2020, and finally presented in the 2021 edition. The most visible side effect of this experiment is the discovery of bugs: more than 150 bug reports have been filled against various Debian packages.
4.3 Extensions of ProofInUse joint lab
The current plans for continuation of the ProofInUse joint lab is to form a ProofInUse Consortium with an extension at a larger perimeter than Ada applications. We started to collaborate with the TrustInSoft company for the verification of C and C++ codes, including the use of Why3 to design verified and reusable C libraries (ongoing CIFRE PhD thesis). We also started to collaborate with Mitsubishi Electric R&D Centre Europe in Rennes for a specific usage of Why3 for verifying embedded devices (logic controllers). The recent best paper award at the FMICS conference is a result of this last collaboration.
5 Social and environmental responsibility
5.1 Footprint of research activities
Our research activities make use of computers for developing software and developing formal proofs. A continuous integration methodology for mature software like Why3 is mandatory for ensuring a safe software engineering process for maintenance and evolution. We make the necessary efforts to keep the energy consumption of such a continuous integration process as low as possible.
Ensuring the reproducibility of proofs in formal verification is essential. It is thus mandatory to replay such proofs regularly to make sure that our changes in our software do not loose existing proofs. For example, we need to make sure that the case studies in formal verification that we present in our gallery are reproducible. We also make the necessary efforts to keep the energy consumption for replaying proofs low, by doing it only when necessary.
As widely accepted nowadays, the major sources of environmental impact of research is travel to international conferences by plane, and renewal of electronic devices. The number of travels we made in 2021 remained very low with respect to previous years, of course because of the Covid pandemic. The impact on research was mitigated thanks to the possibility of participating to conferences using remote communication systems. We intend to continue limiting the environmental impact of our travels. Concerning renewal of electronic devices, that is mainly laptops and monitors, we have always been careful on keeping them usable for as long time as possible.
5.2 Impact of research results
Our research results aims at improving the quality of software, in particular in missioncritical contexts. As such, making software more safe is likely to reduce the necessity for maintenance operations and thus reducing energy costs.
Our efforts are mostly towards ensuring the safety of functional behavior of software, but we also increasingly consider the verification of their time or memory consumption. Reducing those would naturally induce a reduction in energy consumption.
Our research never involve any processing of personal data, and consequently we have no concern about preserving individual privacy, and no concern with respect to the RGPD (Règlement Général sur la Protection des Données).
6 Highlights of the year
6.1 Agrégation d'Informatique
In the past years, increasingly more Computer Science topics have been introduced in the high school curricula. This evolution resulted in an increasing need for teachers with high skills in that domain. The French ministry of education has decided in 2021 to create a new discipline in the concours de l'agrégation, which is the most selective competition for recruiting high school teachers. To prepare the first round of this recruiting competition taking place in 2022, Sylvie Boldo has been nominated as president of the competition committee. Notice that she is the only fulltime researcher to chair an agrégation committee this year.
6.2 Awards

VerifyThis Competition 2021
The team of JeanChristophe Filliâtre and Andrei Paskevich got the Best overall team award. The team of Quentin Garchery and Xavier Denis won the first place for the Best student team award.
VerifyThis is a series of program verification competitions, which takes place annually since 2011. The competition offers a number of challenges presented in natural language and pseudocode. Participants have to formalize the requirements, implement a solution, and formally verify the implementation for adherence to the specification.

FMICS 2021 best paper
Cláudio Belo Lourenço and Claude Marché, with coauthors from Mitsubishi Electric R&D (Rennes, France) received the BestPaper Award at the 26th International Conference on Formal Methods for Industrial Critical Systems.
Their contribution Automated Verification of Temporal Properties of Ladder Programs was valued by the jury as a “good example for how formal methods can be used in industrial applications” with “industrial interest for both legacy Ladder programs and programs to be developed”.
7 New software and platforms
The following lists all the software distributed publicly and for which at least one author is member of the team.
7.1 New software
7.1.1 AltErgo

Name:
Automated theorem prover for software verification

Keywords:
Software Verification, Automated theorem proving

Functional Description:
AltErgo is an automatic solver of formulas based on SMT technology. It is especially designed to prove mathematical formulas generated by program verification tools, such as FramaC for C programs, or SPARK for Ada code. Initially developed in Toccata research team, AltErgo's distribution and support are provided by OCamlPro since September 2013.

Release Contributions:
the "SAT solving" part can now be delegated to an external plugin, new experimental SAT solver based on miniSAT, provided as a plugin. This solver is, in general, more efficient on ground problems, heuristics simplification in the default SAT solver and in the matching (instantiation) module, reimplementation of internal literals representation, improvement of theories combination architecture, rewriting some parts of the formulas module, bugfixes in records and numbers modules, new option "noEmatching" to perform matching without equality reasoning (i.e. without considering "equivalence classes"). This option is very useful for benchmarks coming from AtelierB, two new experimental options: "saveusedcontext" and "replayusedcontext". When the goal is proved valid, the first option allows to save the names of useful axioms into a ".used" file. The second one is used to replay the proof using only the axioms listed in the corresponding ".used" file. Note that the replay may fail because of the absence of necessary ground terms generated by useless axioms (that are not included in .used file) during the initial run.
 URL:

Contact:
Sylvain Conchon

Participants:
Alain Mebsout, Évelyne Contejean, Mohamed Iguernelala, Stéphane Lescuyer, Sylvain Conchon

Partner:
OCamlPro
7.1.2 CoqInterval

Name:
Interval package for Coq

Keywords:
Interval arithmetic, Coq

Functional Description:
CoqInterval is a library for the proof assistant Coq.
It provides several tactics for proving theorems on enclosures of realvalued expressions. The proofs are performed by an interval kernel which relies on a computable formalization of floatingpoint arithmetic in Coq.
The Marelle team developed a formalization of rigorous polynomial approximation using Taylor models in Coq. In 2014, this library has been included in CoqInterval.
 URL:
 Publications:

Contact:
Guillaume Melquiond

Participants:
Assia Mahboubi, Érik MartinDorel, Guillaume Melquiond, JeanMichel Muller, Laurence Rideau, Laurent Théry, Micaela Mayero, Mioara Joldes, Nicolas Brisebarre, Thomas SibutPinote
7.1.3 Coquelicot

Name:
The Coquelicot library for real analysis in Coq

Keywords:
Coq, Real analysis

Functional Description:
Coquelicot is library aimed for supporting real analysis in the Coq proof assistant. It is designed with three principles in mind. The first is the userfriendliness, achieved by implementing methods of automation, but also by avoiding dependent types in order to ease the stating and readability of theorems. This latter part was achieved by defining total function for basic operators, such as limits or integrals. The second principle is the comprehensiveness of the library. By experimenting on several applications, we ensured that the available theorems are enough to cover most cases. We also wanted to be able to extend our library towards more generic settings, such as complex analysis or Euclidean spaces. The third principle is for the Coquelicot library to be a conservative extension of the Coq standard library, so that it can be easily combined with existing developments based on the standard library.
 URL:

Contact:
Sylvie Boldo

Participants:
Catherine Lelay, Guillaume Melquiond, Sylvie Boldo
7.1.4 Cubicle

Name:
The Cubicle model checker modulo theories

Keywords:
Model Checking, Software Verification

Functional Description:
Cubicle is an open source model checker for verifying safety properties of arraybased systems, which corresponds to a syntactically restricted class of parametrized transition systems with states represented as arrays indexed by an arbitrary number of processes. Cache coherence protocols and mutual exclusion algorithms are typical examples of such systems.
 URL:

Contact:
Sylvain Conchon

Participants:
Alain Mebsout, Sylvain Conchon
7.1.5 Flocq

Name:
The Flocq library for formalizing floatingpoint arithmetic in Coq

Keywords:
Floatingpoint, Arithmetic code, Coq

Functional Description:
The Flocq library for the Coq proof assistant is a comprehensive formalization of floatingpoint arithmetic: core definitions, axiomatic and computational rounding operations, highlevel properties. It provides a framework for developers to formally verify numerical applications.
Flocq is currently used by the CompCert verified compiler to support floatingpoint computations.
 URL:
 Publications:

Contact:
Sylvie Boldo

Participants:
Guillaume Melquiond, Pierre Roux, Sylvie Boldo
7.1.6 Gappa

Name:
The Gappa tool for automated proofs of arithmetic properties

Keywords:
Floatingpoint, Arithmetic code, Software Verification, Constraint solving

Functional Description:
Gappa is a tool intended to help formally verifying numerical programs dealing with floatingpoint or fixedpoint arithmetic. It has been used to write robust floatingpoint filters for CGAL and it is used to verify elementary functions in CRlibm. While Gappa is intended to be used directly, it can also act as a backend prover for the Why3 software verification plateform or as an automatic tactic for the Coq proof assistant.
 URL:
 Publications:

Contact:
Guillaume Melquiond

Participant:
Guillaume Melquiond
7.1.7 Why3

Name:
The Why3 environment for deductive verification

Keywords:
Formal methods, Trusted software, Software Verification, Deductive program verification

Functional Description:
Why3 is an environment for deductive program verification. It provides a rich language for specification and programming, called WhyML, and relies on external theorem provers, both automated and interactive, to discharge verification conditions. Why3 comes with a standard library of logical theories (integer and real arithmetic, Boolean operations, sets and maps, etc.) and basic programming data structures (arrays, queues, hash tables, etc.). A user can write WhyML programs directly and get correctbyconstruction OCaml programs through an automated extraction mechanism. WhyML is also used as an intermediate language for the verification of C, Java, or Ada programs.
 URL:

Contact:
Claude Marche

Participants:
Andriy Paskevych, Claude Marche, François Bobot, Guillaume Melquiond, JeanChristophe Filliâtre, Levs Gondelmans, Martin Clochard

Partners:
CNRS, Université ParisSud
7.1.8 Coq

Name:
The Coq Proof Assistant

Keywords:
Proof, Certification, Formalisation

Scientific Description:
Coq is an interactive proof assistant based on the Calculus of (Co)Inductive Constructions, extended with universe polymorphism. This type theory features inductive and coinductive families, an impredicative sort and a hierarchy of predicative universes, making it a very expressive logic. The calculus allows to formalize both general mathematics and computer programs, ranging from theories of finite structures to abstract algebra and categories to programming language metatheory and compiler verification. Coq is organised as a (relatively small) kernel including efficient conversion tests on which are built a set of higherlevel layers: a powerful proof engine and unification algorithm, various tactics/decision procedures, a transactional document model and, at the very top an integrated development environment (IDE).

Functional Description:
Coq provides both a dependentlytyped functional programming language and a logical formalism, which, altogether, support the formalisation of mathematical theories and the specification and certification of properties of programs. Coq also provides a large and extensible set of automatic or semiautomatic proof methods. Coq's programs are extractible to OCaml, Haskell, Scheme, ...

Release Contributions:
Coq version 8.14 integrates many usability improvements, as well as an important change in the core language. The main changes include:
 The internal representation of match has changed to a more spaceefficient and cleaner structure, allowing the fix of a completeness issue with cumulative inductive types in the typechecker. The internal representation is now closer to the userlevel view of match, where the argument context of branches and the inductive binders "in" and "as" do not carry type annotations.
 A new "coqnative" binary performs separate native compilation of libraries, starting from a .vo file. It is supported by coq_makefile.
 Improvements to typeclasses and canonical structure resolution, allowing more terms to be considered as classes or keys.
 More control over notation declarations and support for primitive types in string and number notations.
 Removal of deprecated tactics, notably omega, which has been replaced by a greatly improved lia, along with many bug fixes.
 New Ltac2 APIs for interaction with Ltac1, manipulation of inductive types and printing.
Many changes and additions to the standard library in the numbers, vectors and lists libraries. A new signed primitive integers library Sint63 is available in addition to the unsigned Uint63 library.

News of the Year:
Coq version 8.14 integrates many usability improvements, as well as an important change in the core language. See the changelog at https://coq.inria.fr/refman/changes.html#version814 for an overview of the new features and changes, along with the full list of contributors.
 URL:

Contact:
Matthieu Sozeau

Participants:
Yves Bertot, Frederic Besson, Tej Chajed, Cyril Cohen, Pierre Corbineau, Pierre Courtieu, Maxime Denes, Jim Fehrle, Julien Forest, Emilio Jesús Gallego Arias, Gaetan Gilbert, Georges Gonthier, Benjamin Grégoire, Jason Gross, Hugo Herbelin, Vincent Laporte, Olivier Laurent, Assia Mahboubi, Kenji Maillard, Érik MartinDorel, Guillaume Melquiond, PierreMarie Pedrot, Clément PitClaudel, Kazuhiko Sakaguchi, Vincent Semeria, Michael Soegtrop, Arnaud Spiwack, Matthieu Sozeau, Enrico Tassi, Laurent Théry, Anton Trunov, LiYao Xia, Theo Zimmermann

Partners:
CNRS, Université ParisSud, ENS Lyon, Université ParisDiderot
8 New results
8.1 Foundations and Spreading of Deductive Program Verification
Participants: Andrei Paskevich, Antoine Lanco, Benedikt Becker, Claude Marché, Cláudio Belo Lourenço, Clément Pascutto, Guillaume Cluzel, Guillaume Melquiond, JeanChristophe Filliâtre, Léo Andrès, Quentin Garchery, Sylvain Conchon, Sylvie Boldo, Xavier Denis, Yacine El Haddad.

A strong callbyneed calculus
T. Balabonski, A. Lanco, and G. Melquiond have devised a callbyneed lambdacalculus that enables strong reduction (that is, reduction inside the body of abstractions) and guarantees that arguments are only evaluated if needed and at most once 15. This calculus uses explicit substitutions and subsumes the existing strongcallbyneed strategy, but allows for more reduction sequences, and often shorter ones, while preserving the neededness. The calculus is normalizing in a strong sense: Whenever a lambdaterm $t$ admits a normal form $n$ in the lambdacalculus, then any reduction sequence from $t$ in the calculus eventually reaches a representative of the normal form $n$. Moreover, by adding some restrictions to it, the calculus gains the diamond property and only performs reduction sequences of minimal length, which makes it systematically better than the existing strategy. The Abella proof assistant has been used to formalize part of this calculus.

Certificates for Logic Transformations
In a context of formal program verification, using automatic provers, the trusted code base of verification environments is typically very broad. An environment such as Why3 implements many complex procedures: generation of verification conditions, logical transformations of proof tasks, and interactions with external provers. Considering only the logical transformations of Why3, their implementation already amounts to more than 17,000 lines of OCaml code. In order to increase our confidence in the correction of such a verification tool, Q. Garchery proposed a mechanism of certifying transformations, producing certificates that can be validated by an external tool, according to the skeptical approach. He explored two methods to validate certificates: one based on a dedicated verifier developed in OCaml, the other based on the universal proof checker Dedukti. A specificity of these certificates is to be “small grains” and composable, which makes the approach incremental, allowing to gradually add new certifying transformations 56. Among the new results in that topics, the approach is now supporting builtin theories such as equality and integer arithmetic 20. It is even possible to check certificates for proofs by strong induction on integers.

Simpler Proofs with Decentralized Invariants
When verifying programs where the data have some recursive structure, it is natural to make use of global invariants that are themselves recursively defined. Though this is mathematically elegant, this makes the proofs more complex, as the preservation of these invariants now requires induction. In particular, this makes the proofs less amenable to automation. An alternative is to use local invariants attached to individual components of the structure and which only involve a bounded number of elements. These are called decentralized invariants. When the structure is updated, the footprint of the modification only impacts a bounded number of invariants and reestablishing them does not require induction. In this paper 13, Filliâtre illustrates this idea on three nontrivial programs, for which fully automated proofs are achieved.
This paper appears in a special issue “E pur si muove” of the Journal of Logical and Algebraic Methods in Programming, that is tribute to José Manuel Esgalhado Valença on the occasion of his jubilation.

Abstraction and Genericity in Why3
The benefits of modularity in programming — abstraction barriers, which allow hiding implementation details behind an opaque interface, and genericity, which allows specializing a single implementation to a variety of underlying data types — apply just as well to deductive program verification, with the additional advantage of helping the automated proof search procedures by reducing the size and complexity of the premises and by instantiating and reusing onceproved properties in a variety of contexts. Filliâtre and Paskevich wrote a paper 53 demonstrating the modularity features of WhyML, the language of the program verification tool Why3. Instead of separating abstract interfaces and fully elaborated implementations, WhyML uses a single concept of module, a collection of abstract and concrete declarations, and a basic operation of cloning which instantiates a module with respect to a given partial substitution, while verifying its soundness. This mechanism brings into WhyML both abstraction and genericity, which is illustrated on a small verified Bloom filter implementation, translated into executable idiomatic C code.

Explaining Counterexamples with GiantStep Assertion
Checking
Identifying the cause of a proof failure during deductive verification of programs is hard: it may be due to an incorrectness in the program, an incompleteness in the program annotations, or an incompleteness of the prover. The changes needed to resolve a proof failure depend on its category, but the prover cannot provide any help on the categorization. When using an SMT solver to discharge a proof obligation, that solver can propose a model from a failed attempt, from which a possible counterexample can be derived. But the counterexample may be invalid, in which case it may add more confusion than help. To check the validity of a counterexample and to categorise the proof failure, B. Becker, C. Lourenço and C. Marché propose the comparison between the runtime assertionchecking (RAC) executions under two different semantics, using the counterexample as an oracle. The first RAC execution follows the normal program semantics, and a violation of a program annotation indicates an incorrectness in the program. The second RAC execution follows a novel “giantstep” semantics that does not execute loops nor function calls but instead retrieves return values and values of modified variables from the oracle. A violation of the program annotations only observed under giantstep execution characterizes an incompleteness of the program annotations. They implemented this approach in Why3 and evaluated it using examples from prior literature 27, 16
8.2 Reasoning on mutable memory in program verification
Participants: Andrei Paskevich, Benedikt Becker, Claude Marché, Cláudio Belo Lourenço, Clément Pascutto, Guillaume Cluzel, Guillaume Melquiond, JeanChristophe Filliâtre, Léo Andrès, Sylvain Conchon, Xavier Denis, Yacine El Haddad.

Deductive program verification for a language with a
Rustlike typing discipline
Rust is a fairly recent programming language for system programming, bringing static guarantees of memory safety through a strong ownership policy. This feature opens promising advances for deductive verification of Rust code. The project underlying the PhD thesis of X. Denis, supervised by J.H. Jourdan and C. Marché, is to propose techniques for the verification of Rust program, using a translation to a purelyfunctional language. The challenge of this translation is the handling of mutable borrows: pointers which control of aliasing in a region of memory. To overcome this, we used a technique inspired by prophecy variables to predict the final values of borrows 51. This method is implemented in a new standalone tool called Creusot. The specification language of Creusot features the notion of prophecy mentioned above, which is central for the specification of behavior of programs performing memory mutation. Prophecies also permit efficient automated reasoning for verifying about such programs. Moreover, Rust provides advanced abstraction features based on a notion of traits, extensively used in the standard library and in user code. The support for traits is another main feature of Creusot, because it is at the heart of its approach, in particular for providing complex abstraction of the functional behavior of programs 30.
8.3 Verification of Computer Arithmetic
Participants: Claude Marché, Diane GalloisWong, Guillaume Melquiond, Houda Mouhcine, Louise Ben SalemKnapp, Sylvie Boldo.

Plotting in a formally verified way
An invaluable feature of computer algebra systems is their ability to plot the graph of functions. Unfortunately, when one is trying to design a library of mathematical functions, this feature often falls short, producing incorrect and potentially misleading plots, due to accuracy issues inherent to this use case. G. Melquiond has extended the CoqInterval library so as to turn the Coq proof assistant into a tool for plotting function graphs that are guaranteed to be correct, by using reliable polynomial approximations 22.

Some Formal Tools for Computer Arithmetic: Flocq and Gappa
S. Boldo and G. Melquiond have developed several tools to help the user in writing proofs regarding computer arithmetic, e.g., certifying a bound on a roundoff error, while aiming at a high level of guarantee. Flocq is a library of mathematical definitions and theorems for the Coq proof assistant; Gappa is meant to compute bounds of values and errors, while producing the corresponding formal proof. Despite their age, they are still relevant nowadays 17.

RoundOff Errors and Hydrodynamics
The growth of the computing capacities makes it possible to obtain more and more precise simulation results, often calculated in binary64. However, exascale is pushing back the known limits and the problems of accumulating roundoff errors could come back and require to increase further the precision. But working with extended precision, regardless of the method used, has a significant cost in memory, computation time and energy. It is therefore important to measure the robustness of the binary64 format by anticipating the future computing resources in order to ensure its durability in numerical simulations. For this purpose, W. Weens, T. VazquezGonzalez and L. Ben SalemKnapp performed a set of numerical experiments 25. Those were performed with weak floats which were specifically designed to conduct an empirical study of roundoff errors in hydrodynamic simulations and to build an error model that extracts the part due to roundoff error in the results. This model confirms that errors remain dominated by the scheme errors in the performed numerical experiments. Other numerical experiments have been done in order to check whether binary64 provides enough accuracy in the context of hydrodynamics exascale computations 23.
Numerical simulations are carefullywritten programs, and their correctness is based on mathematical results. Nevertheless, those programs rely on floatingpoint arithmetic and the corresponding roundoff errors are often ignored. L. Ben SalemKnapp, S. Boldo and W. Weens studied a specific simple scheme applied to advection, that is a particular equation from hydrodynamics dedicated to the transport of a substance. Their work shows a tight bound on the roundoff error of the 1dimensional and 2dimensional upwind schemes, with an error roughly proportional to the number of steps. The error bounds are generic with respect to the floatingpoint format and exceptional behaviors are taken into account. Some experiments give an insight of the quality of the bounds 28.

Emulating roundtonearesttiestozero "augmented" floating
point operations
The 2019 version of the IEEE 754 Standard for FloatingPoint Arithmetic recommends that new “augmented” operations should be provided for the binary formats. These operations use a new “rounding direction”: round to nearest tiestozero. S. Boldo, C. Lauter, and J.M. Muller show how they can be implemented using the currently available operations, using roundtonearest tiestoeven with a partial formal proof of correctness 12.

Computable analysis and notions of continuity in Coq
We give a number of formal proofs of theorems from the field of computable analysis. Many of our results specify executable algorithms that work on infinite inputs by means of operating on finite approximations and are proven correct in Coq in the sense of computable analysis. We also formalize proofs of noncomputational results that support the correctness of our definitions. These include that the information theoretic notion of continuity used in the library is equivalent to the metric notion of continuity on Baire space, a complete comparison of the different concepts of continuity that arise from metric and representedspace structures and the discontinuity of the unrestricted limit operator on the real numbers and the task of selecting an element of a closed subset of the natural numbers 14.

A Coq Formalization of Lebesgue Integration of Nonnegative Functions
Integration, just as much as differentiation, is a fundamental calculus tool that is widely used in many scientific domains. Formalizing the mathematical concept of integration and the associated results in a formal proof assistant helps in providing the highest confidence on the correctness of numerical programs involving the use of integration, directly or indirectly. By its capability to extend the (Riemann) integral to a wide class of irregular functions, and to functions defined on more general spaces than the real line, the Lebesgue integral is perfectly suited for use in mathematical fields such as probability theory, numerical mathematics, and real analysis. In this article, we present the Coq formalization of $\sigma $algebras, measures, simple functions, and integration of nonnegative measurable functions, up to the full formal proofs of the Beppo Levi Theorem (monotone convergence) and Fatou's Lemma. More than a plain formalization of the known literature, we present several design choices made to balance the harmony between mathematical readability and usability of Coq theorems 11.
8.4 Spreading Formal Proofs
Participants: Andrei Paskevich, Antoine Lanco, Benedikt Becker, Claude Marché, Cláudio Belo Lourenço, Clément Pascutto, Diane GalloisWong, Guillaume Cluzel, Guillaume Melquiond, Houda Mouhcine, JeanChristophe Filliâtre, Louise Ben SalemKnapp, Léo Andrès, Quentin Garchery, Sylvain Conchon, Sylvie Boldo, Xavier Denis, Yacine El Haddad.

Verification of Ladder programs
Programmable Logic Controllers (PLCs) are industrial digital computers used as automation controllers in manufacturing processes. The Ladder language is a programming language used to develop PLC software. The aim of this work is to prove that a given Ladder program conforms to an expected temporal behavior given as a timing chart, describing scenarios of execution. C. Lourenço and C. Marché, in collaboration with Mitsubishi Electric R&D Centre Europe, developed an approach to translate the Ladder code and the timing chart into a program for the Why3 environment. The ultimate goal is twofold: first, by obtaining a complete proof, one can verify the conformance of the Ladder code with respect to the timing chart with a high degree of confidence. Second, when the proof is not fully completed, one can obtain a counterexample, illustrating a possible execution scenario of the Ladder code which does not conform to the timing chart 32, 21.

Runtime Assertion Checking for OCaml
Runtime assertion checking (RAC) is a convenient set of techniques that lets developers abstract away the process of verifying the correctness of their programs by writing formal specifications and automating their verification at runtime. In this work 18, Filliâtre and Pascutto present Ortac, a runtime assertion checking tool for OCaml libraries and programs. OCaml is a functional programming language in which idioms rely on an expressive type system, modules, and interface abstractions. Ortac consumes interfaces annotated with type invariants and function contracts and produces code wrappers with the same signature that check these specifications at runtime. It provides a flexible framework for traditional assertion checking, monitoring misbehaviors without interruptions, and automated fuzz testing for OCaml programs. This work presents an overview of Ortac features and highlights its main design choices.

Leveraging Formal Specifications to Generate Fuzzing Suites
When testing a library, developers typically first have to capture the semantics they want to check. They then write the code implementing these tests and find relevant test cases that expose possible misbehaviours. In this work, N. Osborne and C. Pascutto present a tool that automatically takes care of these last two steps by automatically generating fuzz testing suites from OCaml interfaces annotated with formal behavioral specifications. They also show some ongoing experiments on the capabilities and limitations of fuzzing applied to realworld libraries 24

Formal Analysis of Debian packages
Several new results were produced in the context of the CoLiS project for the formal analysis of Debian packages. A first important step is the version 2 of the design of the CoLiS language done by B. Becker, C. Marché and other coauthors 39, that includes a modified formal syntax, a extended formal semantics, together with the design of concrete and symbolic interpreters. Those interpreters are specified and implemented in Why3, proved correct (following the initial approach for the concrete interpreter published in 2018 58 and the recent approach for symbolic interpretation mentioned above 38), and finally extracted to OCaml code.
To make the extracted code effective, it must be linked together with a library that implements a solver for feature constraints 60, and also a library that formally specifies the behavior of basic UNIX utilities. The latter library is documented in details in a research report 59.
A third result is a large verification campaign running the CoLiS toolbox on all the packages of the current Debian distribution. The results of this campaign were reported in another article 37 that was presented at TACAS conference in 2021. The most visible side effect of this experiment is the discovery of bugs: more than 150 bugs report have been filled against various Debian packages. A journal paper reporting updated experimental results using an improved implementation of the platform, and on the new Debian stable distribution, is under submission.
9 Bilateral contracts and grants with industry
We have bilateral contracts which are closely related to a joint effort called the ProofInUse consortium. The objective of ProofInUse is to provide verification tools, based on mathematical proof, to industry users. These tools are aimed at replacing or complementing the existing test activities, whilst reducing costs.
This consortium is a followup of the former LabCom ProofInUse between Toccata and the SME AdaCore, funded by the ANR programme “Laboratoires communs”, from April 2014 to March 2017.
9.1 ProofInUseAdaCore Collaboration
Participants: Claude Marché [contact], JeanChristophe Filliâtre, Andrei Paskevich, Guillaume Melquiond, Benedikt Becker.
This collaboration is a joint effort of the Inria projectteam Toccata and the AdaCore company which provides development tools for the Ada programming language. It is funded by a 5year bilateral contract from Jan 2019 to Dec 2023.
The SME AdaCore is a software publisher specializing in providing software development tools for critical systems. A previous successful collaboration between Toccata and AdaCore enabled Why3 technology to be put into the heart of the AdaCoredeveloped SPARK technology.
The objective of ProofInUseAdaCore is to significantly increase the capabilities and performances of the Spark/Ada verification environment proposed by AdaCore. It aims at integration of verification techniques at the stateoftheart of academic research, via the generic environment Why3 for deductive program verification developed by Toccata.
9.2 ProofInUseMERCE Collaboration
Participants: Claude Marché [contact], Guillaume Melquiond, Cláudio Belo Lourenço, Yacine El Haddad.
This bilateral contract is part of the ProofInUse effort. This collaboration joins efforts of the Inria projectteam Toccata and the company Mitsubishi Electric R&D (MERCE) in Rennes. It is funded by a bilateral contract of 3 years and 6 months from Nov 2019 to April 2023.
MERCE has strong and recognized skills in the field of formal methods. In the industrial context of the Mitsubishi Electric Group, MERCE has acquired knowledge of the specific needs of the development processes and meets the needs of the group in different areas of application by providing automatic verification and demonstration tools adapted to the problems encountered.
The objective of ProofInUseMERCE is to significantly improve ongoing MERCE tools regarding the verification of Programmable Logic Controllers and also regarding the verification of numerical C codes.
9.3 ProofInUseTrustInSoft Collaboration
Participants: Claude Marché [contact], Guillaume Melquiond, Guillaume Cluzel.
This bilateral contract is part of the ProofInUse effort. This collaboration joins efforts of the Inria projectteam Toccata and the company TrustInSoft in Paris. It is funded by a bilateral contract of 24 months from Dec 2020 to Nov 2022.
TrustInSoft is an SME that offers the TISAnalyzer environment for analysis of safety and security properties of source codes written in C and C++ languages. A version of TISAnalyzer is available online, under the name TaaS (TrustInSoft as a Service).
The objective of ProofInUseTrustInSoft is to integrate Deductive Verification in the platform TISAnalyzer, with a special interest in the generation of counterexample to help the user in case of proof failure.
9.4 CEADAM Collaboration
Participants: Sylvie Boldo [contact], Louise Ben SalemKnapp.
A contract has been signed in 2021 between the CEADAM (“Direction des applications militaires”) and Toccata about the management of the PhD thesis of Louise Ben SalemKnapp with William Weens (CEADAM) and Guillaume Perrin (CEADAM). The PhD has stopped in October 2021, also ending the contract.
This topic of the PhD is between computer science and applied mathematics. We consider algorithms from numerical analysis and verify their good behavior on computers. This behavior, proven by supposing that the computations are perfect, could be put in fault by the problems of roundoff errors and of overflows due to computations in floatingpoint arithmetic. We plan to study the impact of roundoff errors in a hydrodynamic code. Hydrodynamics is the skeleton model of many physical models used in industry. It contains numerous technical, mathematical and numerical difficulties, which does not prevent its massive use in the simulation industry on increasingly complex problems. Today, the resolution of such problems requires the use of supercalculators, as well as the implementation of algorithms adapted to massively parallel calculation. The very large number of calculations required to produce results raises the question of their numerical quality.
9.5 CIFRE contract with Tarides company
Participants: JeanChristophe Filliâtre [contact], Clément Pascutto.
Clément Pascutto started a CIFRE PhD in June 2020, under then supervision of JeanChristophe Filliâtre (at Toccata) and Thomas Gazagnaire (at Tarides). The subject of the PhD is the dynamic and deductive verification of OCaml programs and its application to distributed data structures.
9.6 CIFRE contract with OCamlPro company
Participants: JeanChristophe Filliâtre [contact], Léo Andrès.
Léo Andrès started a CIFRE PhD in October 2021, under the supervision of JeanChristophe Filliâtre (at Toccata) and Pierre Chambart and Vincent Laviron (at OCamlPro). The subject of the PhD is the design, formalization, and implementation of a garbage collector for WebAssembly.
10 Partnerships and cooperations
10.1 European initiatives
10.1.1 FP7 & H2020 projects
EMC2, ERC Synergy project

Title:
Extremescale Mathematicallybased Computational Chemistry

Duration:
November 2019 – April 2026

Coordinators:
E. Cances, L. Grigori, Y. Maday, and J. P. Piquemal

Partners:
 LJLL and LCT, Sorbonne Université (France)
 Cermics, École Nationale des Ponts et Chaussées (France)

Inria contact:
Laura Grigori
 Website
EMC2 is an ERC Synergy project that aims to overcome some of the current limitations in the field of molecular simulation and aims to provide academic communities and industrial companies with new generation, dramatically faster and quantitatively reliable molecular simulation software. This will enable those communities to address major technological and societal challenges of the 21st century in health, energy and the environment for instance.
FRESCO, ERC Consolidator project

Title:
Fast and Reliable Symbolic Computation

Duration:
November 2021 – October 2026

Coordinator:
Assia Mahboubi
 Website
Using computers to formulate conjectures and consolidate proof steps pervades all mathematics fields, even the most abstract. Most computer proofs are produced by symbolic computations, using computer algebra systems. However, these systems suffer from severe, intrinsic flaws, rendering computational correction and verification challenging. The FRESCO project aims to shed light on whether computer algebra could be both reliable and fast. Researchers will disrupt the architecture of proof assistants, which serve as the best tools for representing mathematics in silico, enriching their programming features while preserving their compatibility with their logical foundations. They will also design novel mathematical software that should feature a highlevel, performanceoriented programming environment for writing efficient code to boost computational mathematics.
10.2 National initiatives
10.2.1 ANR NuSCAP
Participants: Guillaume Melquiond [contact], Sylvie Boldo.
The last twenty years have seen the advent of computeraided proofs in mathematics and this trend is getting more and more important. They request various levels of numerical safety, from fast and stable computations to formal proofs of the computations. Hovewer, the necessary tools and routines are usually ad hoc, sometimes unavailable, or inexistent. On a complementary perspective, numerical safety is also critical for complex guidance and control algorithms, in the context of increased satellite autonomy. We plan to design a whole set of theorems, algorithms and software developments, that will allow one to study a computational problem on all (or any) of the desired levels of numerical rigor. Key developments include fast and certified spectral methods and polynomial arithmetic, with subsequent formal verifications. There will be a strong feedback between the development of our tools and the applications that motivate it.
The project led by École Normale Supérieure de Lyon (LIP) has started in February 2021 and lasts for 4 years. Partners: Inria (teams Aric, Galinette, Lfant, Marelle, Toccata), École Polytechnique (LIX), Sorbonne Université (LIP6), Université Sorbonne Paris Nord (LIPN), CNRS (LAAS).
11 Dissemination
Participants: Andrei Paskevich, Antoine Lanco, Claude Marché, Diane GalloisWong, Guillaume Melquiond, JeanChristophe Filliâtre, Quentin Garchery, Sylvain Conchon, Sylvie Boldo, Xavier Denis.
11.1 Administration, Collective Responsibilities
 S. Boldo has been nominated president of the (first) concours de l'agrégation d'informatique that will recruit French computer science teachers for high school in 2022.
 S. Boldo, deputy scientific director (DSA) of Inria Saclay research center, until June 21.
 S. Boldo, member of the council of the Computer Science Graduate School of Université ParisSaclay (and cohead for open science).
 S. Boldo, member of the (national) Inria IES commission (”commission pour l'information et l'édition scientifique”) about scientific edition and publication models.
 S Boldo, member of the CLFP (“commission locale de formation permanente”).
 S. Boldo, member of the CoDiReV ParisSaclay (committee of the research heads of the ParisSaclay components and partners) until June 21.
 S. Boldo, deputy member of the CFVU ParisSaclay (“commission de la formation et de la vie universitaire”) until June 21.
 S. Boldo, member of the partners commission for the Digicosme Labex (“comité des tutelles du labex Digicosme”) until June 21.
 S. Boldo, member of the crisis unit of Inria Saclay until June 21.
 G. Melquiond, member of the scientific commission of Inria Saclay, in charge of selecting candidates for PhD grants, Postdoc grants, temporary leaves from universities (“délégations”).
 G. Melquiond, elected member of the ED STIC doctoral school from Université ParisSaclay, in charge of selecting candidates for PhD grants and monitoring PhD students.
 G. Melquiond, member of Inria's MissionJC (Jeunes Chercheurs), in charge of funding thematic research schools.
 G. Melquiond, responsible of Inria Saclay's FpR (Formation par la Recherche), in charge of funding participation of PhD students to thematic research schools.
 A. Paskevich, member of the CCSU (“commission consultative de spécialistes de l'université”), section 27, of Université ParisSaclay.
11.2 Promoting scientific activities
Chair of conference program committees
 A. Paskevich, 6th Workshop on Formal Integrated Development Environment, FIDE'2021
Member of the conference program committees
 S. Boldo, 2021 IEEE Symposium on Computer Arithmetic, ARITH'2021 (and will be in 2022)
 S. Boldo, 13th NASA Formal Methods Symposium, NFM'2021 (and will be in 2022)
 S. Boldo, 2022 Certified Programs and Proofs, CPP'2022
 S. Boldo, 13th International Conference on Interactive Theorem Proving, ITP'2022
 J.C. Filliâtre, Verification, Model Checking, and Abstract Interpretation, VMCAI 2021
 J.C. Filliâtre, 13th NASA Formal Methods Symposium, NFM'2021
 J.C. Filliâtre, XXV Brazilian Symposium on Programming Languages, SBLP 2021
 J.C. Filliâtre, Symposium on Languages, Applications and Technologies, SLATE 2021
 G. Melquiond, 28th IEEE Symposium on Computer Arithmetic, ARITH'2021
11.2.1 Journal
Member of the editorial boards
 J.C. Filliâtre, member of the editorial board of Journal of Functional Programming.
 G. Melquiond, member of the editorial board of Reliable Computing.
 A. Paskevich, member of the editorial board of Formal Methods in System Design.
11.2.2 Invited talks
 X. Denis: “Deductive verification of Rust programs”, Workshop Langages, Verification et Preuves, Mar. 12, 2021
 X. Denis: “Creusot: A prototype tool for verification of Rust software”, Workshop RustVerify, Apr 12, 2021
 J.C. Filliâtre: “Gospel, un langage de spécification pour OCaml”, Workshop Langages, Verification et Preuves, Mar. 12, 2021
 Q. Garchery: “Génération et vérification de certificats pour les transformations logiques”, Workshop Langages, Verification et Preuves, Nov. 23, 2021
11.2.3 Leadership within the scientific community
 S. Boldo, elected chair of the ARITH working group of the GDRIM (a CNRS subgroup of computer science) with L.S. Didier (Univ. Toulon).
 S. Boldo, steering committee member of the IEEE International Symposium on Computer Arithmetic.
 J.C. Filliâtre, chair of IFIP WG 1.9/2.15 verified Software.
11.2.4 Scientific expertise
 S. Boldo, member of the HCERES evaluation committee for the LaBRI laboratory in Bordeaux, January 18–21.
 S. Boldo, vicepresident of the Inria CRCNISFP recruitment committee for Inria Saclay – ÎledeFrance research center.
 S. Boldo, member of the Inria DR recruitment committee (written part only)
 S. Boldo, member of the Inria PEDR committees
 S. Boldo, member of the Scientific Council of CentraleSupélec (until June 21)
 J.C. Filliâtre, grading the entrance examination at X/ENS (“option informatique”).
 C. Marché, president of the Inria CRCNISFP recruitment committee for InriaParisRocquencourt research center.
 G. Melquiond, grading the entrance examination at X/ENS (“option informatique”).
11.3 Teaching  Supervision  Juries
11.3.1 Teaching
 S. Boldo, Floatingpoint Arithmetic and Beyond, 6h, M2, École Normale Supérieure de Lyon, France.
 S. Conchon and J.C. Filliâtre, DIU Enseigner l'Informatique au Lycée, 2 weeks, rectorat de Versailles (together with T. Balabonski and K. Nguyen).
 J.C. Filliâtre, Langages de programmation et compilation, 25h, L3, École Normale Supérieure, France.
 J.C. Filliâtre, Les bases de l'algorithmique et de la programmation, 15h, L3, École Polytechnique, France.
 J.C. Filliâtre, Compilation, 18h, M1, École Polytechnique, France.
 Q. Garchery, Compilation, 24h, L3, Université ParisSaclay, France.
 Q. Garchery, Programmation Fonctionnelle Avancée, 24h, L3, Université ParisSaclay, France.
 Q. Garchery, Algorithmique, 10h, 2nd year, Polytech, Université ParisSaclay, France.
 A. Lanco, Projet, 20h, L3, Université ParisSaclay, France.
 A. Lanco, Compilation, 24h, L3, Université ParisSaclay, France.
 C. Marché, Proofs of Programs, 12h, M2, Master Parisien de Recherche en Informatique (MPRI).
 G. Melquiond, Initiation à la recherche, 12h, M1, MPRI, École Normale Supérieure ParisSaclay, France.
 G. Melquiond, Floatingpoint Arithmetic and Beyond, 12h, M2, École Normale Supérieure de Lyon, France.
 A. Paskevich, Vérification Déductive, 12h, M1, MPRI, Université ParisSaclay, France.
 A. Paskevich, Principes de systèmes d'exploitation, 40h+54h, DUT2, IUT d'Orsay, Université ParisSaclay, France.
11.3.2 Supervision
 PhD: D. GalloisWong, “Vérification formelle et filtres numériques”, since Oct. 2017, supervised by S. Boldo and T. Hilaire, defended in March 2021 26.
 PhD in progress: Q. Garchery, “Certification de la génération et de la transformation d’obligations de preuve”, since Oct. 2018, supervised by C. Keller, C. Marché and A. Paskevich.
 PhD in progress: A. Lanco, “Stratégies pour la réduction forte”, since Oct. 2019, supervised by T. Balabonski and G. Melquiond.
 PhD in progress: C. Pascutto, “Runtime and Deductive Verification of OCaml programs and applications to Mergeable Data Structures”, since June 2020, supervised by J.C. Filliâtre.
 PhD stopped: L. Ben SalemKnapp, “Erreurs d’arrondi sur un code d’hydrodynamique”, from Oct. 2020 to Oct. 2021, supervised by S. Boldo, W. Weens and G. Perrin.
 PhD in progress: X. Denis, “Deductive program verification for Rust”, since Oct. 2020, supervised by J.H. Jourdan and C. Marché.
 PhD in progress: L. Andrès, “Formalization of a garbage collector for WebAssembly”, since Oct. 2021, supervised by J.C. Filliâtre.
11.3.3 Juries
 S. Boldo, member and reviewer of the habilitation (HDR) committee of Assia Mahboubi (Jan 5)
 S. Boldo, member and president of the PhD defense of Maxime Jacquemin (U. ParisSaclay, July 15)
11.4 Popularization
11.4.1 Interventions
 S. Boldo, participant of a speeddating with high school female students during the RJMI (Rencontres des Jeunes Mathématiciennes et Informaticiennes) organized online by Inria Saclay (Feb 26)
 S. Boldo, animation of a stand for the Inria Saclay  ÎledeFrance Fête de la science (Oct 8)
12 Scientific production
12.1 Major publications
 1 inproceedingsAnalysing installation scenarios of Debian packages.Tools and Algorithms for the Construction and Analysis of SystemsTACAS 2020  26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems12079Lecture Notes in Computer ScienceThe conference took place online, because it couldn't be held in Dublin, IrelandApril 2020, 235253
 2 articleLet's Verify This with Why3.International Journal on Software Tools for Technology Transfer (STTT)1762015, 709727
 3 articleVerified Compilation of FloatingPoint Computations.Journal of Automated Reasoning542February 2015, 135163URL: https://hal.inria.fr/hal00862689
 4 bookComputer Arithmetic and Formal Proofs: Verifying Floatingpoint Algorithms with the Coq System.ISTE Press  ElsevierDecember 2017, URL: https://hal.inria.fr/hal01632617
 5 articleThe Matrix Reproved.Journal of Automated Reasoning6032018, 365383URL: https://hal.inria.fr/hal01617437
 6 inproceedingsA Threetier Strategy for Reasoning about FloatingPoint Numbers in SMT.Computer Aided Verification2017, URL: https://hal.inria.fr/hal01522770
 7 articleThe Spirit of Ghost Code.Formal Methods in System Design4832016, 152174URL: https://hal.archivesouvertes.fr/hal01396864v1
 8 articleFormally Verified Approximations of Definite Integrals.Journal of Automated Reasoning622February 2019, 281300
 9 inproceedingsA Why3 Framework for Reflection Proofs and its Application to GMP's Algorithms.9th International Joint Conference on Automated ReasoningLecture Notes in Computer ScienceOxford, United KingdomJuly 2018, URL: https://hal.inria.fr/hal01699754
 10 inproceedingsA Nonlinear Arithmetic Procedure for ControlCommand Software Verification.24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)Thessalonique, GreeceApril 2018, URL: https://hal.archivesouvertes.fr/hal01737737
12.2 Publications of the year
International journals
 11 articleA Coq Formalization of Lebesgue Integration of Nonnegative Functions.Journal of Automated Reasoning2021
 12 articleEmulating roundtonearest tiestozero "augmented" floatingpoint operations using roundtonearest tiestoeven arithmetic.IEEE Transactions on Computers707July 2021, 1046  1058
 13 articleSimpler Proofs with Decentralized Invariants.Journal of Logical and Algebraic Methods in Programming121June 2021
 14 articleComputable analysis and notions of continuity in Coq.Logical Methods in Computer ScienceMay 2021
International peerreviewed conferences
 15 inproceedingsA strong callbyneed calculus.Proceedings of the 6th International Conference on Formal Structures for Computation and DeductionFSCD 2021  6th International Conference on Formal Structures for Computation and Deduction195Leibniz International Proceedings in Informatics9Buenos Aires, ArgentinaJuly 2021, 122
 16 inproceedingsExplaining Counterexamples with GiantStep Assertion Checking.FIDE 2021  6th Workshop on Formal Integrated Development EnvironmentsVirtual, United StatesElectronic Proceedings in Theoretical Computer ScienceMay 2021
 17 inproceedingsSome Formal Tools for Computer Arithmetic: Flocq and Gappa.ARITH 2021  28th IEEE International Symposium on Computer ArithmeticOnline, ItalyJune 2021
 18 inproceedingsOrtac: Runtime Assertion Checking for OCaml.RV'21  21st International Conference on Runtime VerificationLos Angeles, CA, United StatesOctober 2021
 19 inproceedingsAbstraction and Genericity in Why3.ISoLA 2021  9th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation12476Rhodes, Greece2020
 20 inproceedingsA Framework for Proofcarrying Logical Transformations.Proof eXchange for Theorem Proving336Electronic Proceedings in Theoretical Computer ScienceVirtual, United StatesEPTCSJuly 2021, 523
 21 inproceedingsAutomated Verification of Temporal Properties of Ladder Programs.FMICS 2021  Formal Methods for Industrial Critical Systems12863Lecture Notes in Computer ScienceParis, France2021
 22 inproceedingsPlotting in a Formally Verified Way.Proceedings of the 6th Workshop on Formal Integrated Development Environment338Electronic Proceedings in Theoretical Computer ScienceOnline, United StatesMay 2021, 3945
Conferences without proceedings
 23 inproceedings La double précision suffitelle à l'exascale ? AFADL 2021  20èmes journées Approches Formelles dans l'Assistance au Développement de Logiciels Vannes, France June 2021
 24 inproceedingsLeveraging Formal Specifications to Generate Fuzzing Suites.OCaml Users and Developers Workshop, colocated with the 26th ACM SIGPLAN International Conference on Functional ProgrammingVirtual, United StatesAugust 2021
 25 inproceedingsModeling roundoff errors in hydrodynamic simulations.NSV 2021  14th International Workshop on Numerical Software VerificationLos Angeles, United StatesJuly 2021
Doctoral dissertations and habilitation theses
 26 thesisCoq formalization of digital filter algorithms computed using finite precision arithmetic.Université ParisSaclayMarch 2021
Reports & preprints
 27 reportGiantstep Semantics for the Categorisation of Counterexamples.RR9407InriaApril 2021, 43
 28 miscBounding the RoundOff Error of the Upwind Scheme for Advection.August 2021
 29 miscA Coq Formalization of the Bochner integral.January 2022
 30 reportThe Creusot Environment for the Deductive Verification of Rust Programs.RR9448Inria Saclay  Île de France2021
 31 reportCompterendu de fin de projet ANR15CE250008 "VOCaL": Programme CE25 2015.LMF  Laboratoire Méthodes FormellesJune 2021
 32 reportFormal Analysis of Ladder Programs using Deductive Verification.RR9402InriaApril 2021, 25
 33 miscContinuation Passing as an Abstract Syntax for Deductive Verification.January 2021
12.3 Cited publications
 34 inproceedingsMultiProver Verification of FloatingPoint Programs.Fifth International Joint Conference on Automated Reasoning6173Lecture Notes in Artificial IntelligenceEdinburgh, ScotlandSpringerJuly 2010, 127141URL: http://hal.inria.fr/inria00534333
 35 inproceedingsCVC4.Computer Aided Verification6806Lecture Notes in Computer ScienceSpringer2011, 171177
 36 manualACSL: ANSI/ISO C Specification Language, version 1.4.2009
 37 inproceedingsAnalysing installation scenarios of Debian packages.Tools and Algorithms for the Construction and Analysis of Systems12079Lecture Notes in Computer Science2020, 235253URL: https://hal.archivesouvertes.fr/hal02355602
 38 inproceedingsGhost Code in Action: Automated Verification of a Symbolic Interpreter.Verified Software: Tools, Techniques and Experiments12031Lecture Notes in Computer ScienceNew York, United StatesJuly 2019, URL: https://hal.inria.fr/hal02276257
 39 techreportRevision 2 of CoLiS language: formal syntax, semantics, concrete and symbolic interpreters.HAL Archives OuvertesOctober 2019, URL: https://hal.inria.fr/hal02321743
 40 inproceedingsMETEOR : A successful application of B in a large project.Proceedings of FM'99: World Congress on Formal MethodsLecture Notes in Computer Science (SpringerVerlag)Springer VerlagSeptember 1999, 369387
 41 inproceedingsFormal Proof of a Wave Equation Resolution Scheme: the Method Error.Proceedings of the First Interactive Theorem Proving Conference6172LNCSEdinburgh, ScotlandSpringerJuly 2010, 147162URL: http://hal.inria.fr/inria00450789/
 42 articleWave Equation Numerical Resolution: a Comprehensive Mechanized Proof of a C Program.Journal of Automated Reasoning504April 2013, 423456URL: http://hal.inria.fr/hal00649240/en/
 43 inproceedingsCombining Coq and Gappa for Certifying FloatingPoint Programs.16th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning5625Lecture Notes in Artificial IntelligenceGrand Bend, CanadaSpringerJuly 2009, 5974
 44 articleFormal verification of numerical programs: from C annotated programs to mechanical proofs.Mathematics in Computer Science542011, 377393URL: http://hal.inria.fr/hal00777605
 45 articleProofs of numerical programs when the compiler optimizes.Innovations in Systems and Software Engineering722011, 151160URL: http://hal.inria.fr/hal00777639
 46 articleAn overview of JML tools and applications.International Journal on Software Tools for Technology Transfer (STTT)73June 2005, 212232
 47 inproceedingsGOSPEL  Providing OCaml with a Formal Specification Language.FM 2019 23rd International Symposium on Formal MethodsPorto, PortugalOctober 2019, URL: https://hal.inria.fr/hal02157484
 48 inproceedingsDeductive Verification with Ghost Monitors.Principles of Programming LanguagesNew Orleans, United States2020, URL: https://hal.inria.fr/hal02368284
 49 inproceedingsAltErgo 2.2.SMT Workshop: International Workshop on Satisfiability Modulo TheoriesOxford, United KingdomJuly 2018
 50 articleInstrumenting a Weakest Precondition Calculus for Counterexample Generation.Journal of Logical and Algebraic Methods in Programming992018, 97113URL: https://hal.inria.fr/hal01802488
 51 techreportDeductive program verification for a language with a Rustlike typing discipline.Université de ParisSeptember 2020, URL: https://hal.archivesouvertes.fr/hal02962804
 52 articleCertifying the floatingpoint implementation of an elementary function using Gappa.IEEE Transactions on Computers6022011, 242253URL: http://hal.inria.fr/inria00533968/en/
 53 inproceedingsAbstraction and Genericity in Why3.9th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation (ISoLA)12476Lecture Notes in Computer ScienceRhodes, GreeceSpringerOctober 2020, 122142URL: https://hal.inria.fr/hal02696246
 54 inproceedingsSpecification and Proof of HighLevel Functional Properties of BitLevel Programs.8th NASA Formal Methods Symposium9690Lecture Notes in Computer ScienceMinneapolis, MN, USASpringerJune 2016, 291306URL: https://hal.inria.fr/hal01314876
 55 inproceedingsAutomating the Verification of FloatingPoint Programs.Verified Software: Theories, Tools, and Experiments. Revised Selected Papers Presented at the 9th International Conference VSTTELecture Notes in Computer Science10712Heidelberg, GermanySpringerDecember 2017, URL: https://hal.inria.fr/hal01534533/
 56 inproceedingsDes transformations logiques passent leur certicat.Trenteetunièmes Journées Francophones des Langages ApplicatifsGruissan, FranceJanuary 2020, URL: https://hal.inria.fr/hal02384946
 57 inbookOpenJDK's Java.utils.Collection.sort() Is Broken: The Good, the Bad and the Worst Case.Computer Aided Verification: 27th International Conference, CAV 2015, San Francisco, CA, USA, July 1824, 2015, Proceedings, Part ID.Daniel KroeningC. S.Corina S. PăsăreanuChamSpringer International Publishing2015, 273289
 58 inproceedingsA Formally Verified Interpreter for a Shelllike Programming Language.Verified Software: Theories, Tools, and Experiments. Revised Selected Papers Presented at the 9th International Conference VSTTELecture Notes in Computer Science10712Heidelberg, GermanySpringerDecember 2017, URL: https://hal.inria.fr/hal01534747
 59 techreportSpecification of UNIX Utilities.HAL Archives OuvertesOctober 2019, URL: https://hal.inria.fr/hal02321691
 60 inproceedingsDeciding the FirstOrder Theory of an Algebra of Feature Trees with Updates.9th International Joint Conference on Automated ReasoningOxford, United KingdomJuly 2018, URL: https://hal.archivesouvertes.fr/hal01807474
 61 articleseL4: Formal verification of an OS kernel.Communications of the ACM536June 2010, 107115
 62 articleA formally verified compiler backend.Journal of Automated Reasoning4342009, 363446URL: http://hal.inria.fr/inria00360768/en/
 63 articleProving Tight Bounds on Univariate Expressions with Elementary Functions in Coq.Journal of Automated Reasoning2016, URL: https://hal.inria.fr/hal01086460
 64 inproceedingsZ3, An Efficient SMT Solver.TACAS4963Lecture Notes in Computer ScienceSpringer2008, 337340
 65 bookHandbook of Floatingpoint Arithmetic (2nd edition).Birkhäuser BaselJuly 2018
 66 inproceedingsHardwareDependent Proofs of Numerical Programs.Certified Programs and ProofsLecture Notes in Computer ScienceSpringerDecember 2011, 314329URL: http://hal.inria.fr/hal00772508