Identifying invariants is an important program analysis task with applications towards
program understanding, bug finding, vulnerability analysis, and formal verification. Existing …

In this paper we introduce a new approach for learning precise and general probabilistic
models of code based on decision tree learning. Our approach directly benefits an emerging …

Water is a prime necessity for the survival and sustenance of all living beings. Over the past
few years, the water quality of rivers has been adversely affected due to harmful wastes and …

Given a semantic constraint specified by a logical formula, and a syntactic constraint
specified by a context-free grammar, the Syntax-Guided Synthesis (SyGuS) problem is to …

A fundamental problem in program verification concerns inferring loop invariants. The
problem is undecidable and even practical instances are challenging. Inspired by how …

Informal natural language that describes code functionality, such as code comments or
function documentation, may contain substantial information about a program's intent …

We extend the data-driven approach to inferring preconditions for code from a set of test
executions. Prior work requires a fixed set of features, atomic predicates that define the …

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 …