• There are IDEs for KeY, including an Eclipse extension, that make it easy to keep track of
proof obligations in larger projects [Hentschel et al., 2014c].• A stripped down version of …

Auto-active verifiers provide a level of automation intermediate between fully automatic and
interactive: users supply code with annotations as input while benefiting from a high level of …

This comprehensive and highly readable textbook teaches how to formally reason about
computer programs using an incremental approach and the verification-aware programming …

Multilingual programs, whose implementations are made of different languages, are gaining
traction especially in domains, such as web programming, that particularly benefit from the …

Verifiers that can prove programs correct against their full functional specification require, for
programs with loops, additional annotations in the form of loop invariants-properties that …

The comprehensive functionality and nontrivial design of realistic general-purpose container
libraries pose challenges to formal verification that go beyond those of individual benchmark …

Verification of a dynamically dispatched method call, E. m (), seems to depend on E's
dynamic type. To avoid case analysis and allow incremental development, object-oriented …

Contracts are a form of lightweight formal specification embedded in the program text. Being
executable parts of the code, they encourage programmers to devote proper attention to …

The comprehensive functionality and nontrivial design of realistic general-purpose container
libraries pose challenges to formal verification that go beyond those of individual benchmark …

This thesis is set in the field of formal methods, more precisely in the domain of deductive
program verification. Our working context is the Why3 framework, a set of tools to implement …