The research community working on formal software verification has historically evolved into
two main camps, grouped around two verification methods that are typically referred to as …

Hash maps are a common and important data structure in efficient algorithm
implementations. Despite their wide-spread use, real-world implementations are not …

In this work, we verify, using the Stainless program verifier, the mutable LongMap from the
Scala standard library, a hash table using open addressing within a single array. As an …

Recent investigations hint at the ability of large language models (LLMs) to generate formal
specifications for given program code. In this work, we systematically discuss and categorize …

Using tools for deductive verification, such as Frama-C, typically imposes substantial work
overhead in the form of manually writing annotations. In this chapter, we investigate …

Deductive verifiers require intensive user interaction in the form of writing precise
specifications, thereby limiting their use in practice. While many solutions have been …

Bounded verification has proved useful to detect bugs and to increase confidence in the
correctness of a program. In contrast to unbounded verification, reasoning about calls via …

Runtime Assertion Checking (RAC) is the discipline of verifying program assertions at
runtime, ie when executing the code. Nowadays, RAC usually relies on Behavioral Interface …

Abstract Model checking temporal properties of software is algorithmically hard. To be
practically feasible, it usually requires the creation of simpler, abstract models of the …

Deductive verifiers can be used to prove the correctness of programs by specifying the
program's intended behaviour using annotations such as pre-and postconditions …