Despite several decades of research, the problem of formal verification of infinite-state
systems has resisted effective automation. We describe a system---Ivy---for interactively …

Distributed protocols such as Paxos play an important role in many computer systems.
Therefore, a bug in a distributed protocol may have tremendous effects. Accordingly, a lot of …

Recent work has made great progress in verifying the forwarding correctness of networks
[26–28, 35]. However, these approaches cannot be used to verify networks containing …

This paper surveys the work to date on Ivy, a language and a tool for the formal specification
and verification of distributed systems. Ivy supports deductive verification using automated …

We present GRASShopper, a tool for compositional verification of heap-manipulating
programs against user-provided specifications. What makes our tool unique is its decidable …

Separation logic (SL) is a widely used formalism for verifying heap manipulating programs.
Existing SL solvers focus on decidable fragments for list-like structures. More complex data …

Verifying fine-grained optimistic concurrent programs remains an open problem. Modern
program logics provide abstraction mechanisms and compositional reasoning principles to …

High-level data types are often associated with semantic invariants that must be preserved
by any correct implementation. While having implementations enforce strong guarantees …

Separation Logic with inductive definitions is a well-known approach for deductive
verification of programs that manipulate dynamic data structures. Deciding verification …

This paper presents a novel automated procedure for discovering expressive shape
specifications for sophisticated functional data structures. Our approach extracts potential …