The automation of verification techniques based on first-order logic specifications has
benefitted greatly from verification infrastructures such as Boogie and Why. These offer an …

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

Rust's type system ensures memory safety: well-typed Rust programs are guaranteed to not
exhibit problems such as dangling pointers, data races, and unexpected side effects through …

We present the Leon verification system for a subset of the Scala programming language.
Along with several functional features of Scala, Leon supports imperative constructs such as …

Reduction to satisfiability of constrained Horn clauses (CHCs) is a widely studied approach
to automated program verification. Current CHC-based methods, however, do not work very …

We present a language-independent verification framework that can be instantiated with an
operational semantics to automatically generate a program verifier. The framework treats …

A key challenge for concurrent programming is that side-effects (memory operations) in one
thread can affect the behavior of another thread. In this paper, we present a type system to …

Most techniques to detect program errors, such as testing, code reviews, and static program
analysis, do not fully verify all possible executions of a program. They leave executions …

Device-driver development and testing is a complex and error-prone undertaking. For
example, testing errorhandling code requires simulating faulty inputs from the device. A …

We present Nagini, an automated, modular verifier for statically-typed, concurrent Python 3
programs, built on the Viper verification infrastructure. Combining established concepts with …