This paper describes work in continuous reasoning, where formal reasoning about a
(changing) codebase is done in a fashion which mirrors the iterative, continuous model of …

There are two basic approaches to automated verification. In model checking, the system is
viewed as a graph representing possible execution steps. Properties are established by …

This paper proposes a modular proof system based on uninterpreted predicates. The
proposed proof system allows modular reasoning about programs with an open-world …

We formalize a Hoare logic for the partial correctness of while programs in PVS and prove its
soundness and relative completeness. We use the PVS higher-order logic to define the …

Cette thèse se positionne dans le domaine de la vérification déductive de programmes, qui
consiste à transformer une propriété à vérifier sur un programme en un énoncé logique …

Most modern (classical) programming languages support recursion. Recursion has also
been successfully applied to the design of several quantum algorithms and introduced in a …

Software systems can grow large and complex, and various programming disciplines have
been developed addressing the problem how programmers can cope with such complex …

Theorem 1 (Soundness & completeness of first-order logic). First-order logic is sound, ie⊣⊆
N, which means that⊣ φ implies N φ for all first-order formulas φ (all provable formulas are …

Correct well-designed semantics precedes solutions of principal research problems in
computer science. As a somewhat allusive, but spectacular illustration of this motto we may …

Many program verification tools rely on the translation of code annotated with properties into
an intermediate single-assignment form (in a more or less explicit way), and then on an …