Behavioral interface specification languages provide formal code-level annotations, such as
preconditions, postconditions, invariants, and assertions that allow programmers to express …

• 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 …

Traditionally, the full verification of a program's functional correctness has been obtained
with pen and paper or with interactive proof assistants, whereas only reduced verification …

In this paper we introduce a novel methodology for verifying a large set of Java programs
which builds on recent theoretical developments in program verification: it combines the …

The dynamic frames approach has proven to be a powerful formalism for specifying and
verifying object-oriented programs. However, it requires writing and checking many frame …

A program verifier is a tool that allows developers to prove that their code satisfies its
specification for every possible input and every thread schedule. These lecture notes …

This note describes a separation-logic-based approach for the specification and verification
of safety properties of pointer-manipulating imperative programs. We describe the approach …

SMT solvers are widely used as core engines in many applications. Therefore, robustness
and correctness are essential criteria. Current testing techniques used by developers of SMT …

Shared mutable objects pose grave challenges in reasoning, especially for data abstraction
and modularity. This paper presents a novel logic for error-avoiding partial correctness of …

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