Refinement types enrich a language's type system with logical predicates that circumscribe
the set of values described by the type. These refinement predicates provide software …

This paper presents the ELDARICA version 2 model checker. Over the last years we have
been develo** and maintaining ELDARICA as a state-of-the-art solver for Horn clauses …

In recent years they have been numerous works that aim to automate relational verification.
Meanwhile, although Constrained Horn Clauses (CHCs CHCs) empower a wide range of …

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 …

Loop invariants are fundamental to reasoning about programs with loops. They establish
properties about a given loop's behavior. When they additionally are inductive, they become …

We propose a general end-to-end deep learning framework Code2Inv, which takes a
verification task and a proof checker as input, and automatically learns a valid proof for the …

Verifying real-world programs often requires inferring loop invariants with nonlinear
constraints. This is especially true in programs that perform many numerical operations …

We propose a method for automatically finding refinement types of higher-order function
programs. Our method is an extension of the Ice framework of Garg et al. for finding …

Authors' addresses: Hari Govind VK, Department of Electrical and Computer Engineering,
University of Waterloo, Canada, hgvk94@ gmail. com; Sharon Shoham, Tel-Aviv University …