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 …

This paper presents an approach of safety verification based on neural networks for
continuous dynamical systems which are modeled as a system of ordinary differential …

Syntax-guided synthesis (SyGuS) is the computational problem of finding an implementation
$ f $ that meets both a semantic constraint given by a logical formula $\phi $ in a background …

Boolean functional synthesis is a fundamental problem in computer science with wide-
ranging applications and has witnessed a surge of interest resulting in progressively …

Given a Boolean specification between a set of inputs and outputs, the problem of Boolean
functional synthesis is to synthesise each output as a function of inputs such that the …

A representation invariant is a property that holds of all values of abstract type produced by a
module. Representation invariants play important roles in software engineering and …

In syntax-guided synthesis (SyGuS), a synthesizer's goal is to automatically generate a
program belonging to a grammar of possible implementations that meets a logical …

Inferring loop invariants is one of the most challenging problems in program verification. It is
highly desired to incorporate machine learning when inferring. This paper presents a …

In this paper, we present a novel learning framework for inferring stateful preconditions (ie,
preconditions constraining not only primitive-type inputs but also non-primitive-type object …

Precondition inference is an important problem with many applications. Existing
precondition inference techniques for programs with arrays have limited ability to find and …