Distributed systems are notoriously hard to implement correctly due to non-determinism.
Finding the inductive invariant of the distributed protocol is a critical step in verifying the …

Distributed systems are complex and difficult to build correctly. Formal verification can
provably rule out bugs in such systems, but finding an inductive invariant that implies the …

Modifications to the data representation of an abstract data type (ADT) can require
significant semantic refactoring of the code. Motivated by this observation, this paper …

We present a system called Smyth for program sketching in a typed functional language
whereby the concrete evaluation of ordinary assertions gives rise to input-output examples …

We propose SE2GIS, a novel inductive recursion synthesis approach with the ability to both
synthesize code and declare a problem unsolvable. SE2GIS combines a symbolic variant of …

Formal verification can provably guarantee the correctness of critical system software, but
the high proof burden has long hindered its wide adoption. Recently, Large Language …

Real-life programs contain multiple operations whose semantics are unavailable to
verification engines, like third-party library calls, inline assembly and SIMD instructions …

Many invariant inference techniques reason simultaneously about states and predicates,
and it is well-known that these two kinds of reasoning are in some sense dual to each other …

Abstract Semantics-Guided Synthesis (SemGuS) is a programmable framework for defining
synthesis problems in a domain-and solver-agnostic way. This paper presents the …

Morgan and McIver's weakest pre-expectation framework is one of the most well-established
methods for deductive verification of probabilistic programs. Roughly, the idea is to …