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

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 …

Synthesizing inductive loop invariants is fundamental to automating program verification. In
this work, we observe that Large Language Models (such as gpt-3.5 or gpt-4) are capable of …

Program synthesis is the mechanised construction of software. One of the main difficulties is
the efficient exploration of the very large solution space, and tools often require a user …

Program verification offers a framework for ensuring program correctness and therefore
systematically eliminating different classes of bugs. Inferring loop invariants is one of the …

Syntax-guided synthesis (SyGuS) aims to find a program satisfying semantic specification as
well as user-provided structural hypotheses. There are two main synthesis approaches …

Syntax-Guided Synthesis (SyGuS) is the computational problem of finding an
implementation f that meets both a semantic constraint given by a logical formula $\varphi …

In classic program synthesis algorithms, such as counterexample-guided inductive synthesis
(CEGIS), the algorithms alternate between a synthesis phase and an oracle (verification) …

The template-based approach to invariant generation is a parametric and relatively
complete methodology for inferring loop invariants. The relative completeness ensures the …

Many relevant problems in formal methods can be tackled using enumerative syntax-guided
synthesis (SyGuS). Algorithms for enumerative SyGuS range from universally applicable …