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 …

We propose a novel trace-guided approach to tackle the challenges of ambiguity and
generalization in synthesis of recursive functional programs from input-output examples. Our …

An integrated approach based on machine learning and data augmentation techniques has
been developed in order to predict the stiffness modulus of the asphalt concrete layer of an …

Program synthesis, which generates programs based on user-provided specifications, can
be obscure and brittle: users have few ways to understand and recover from synthesis …

Program synthesis promises to help software developers with everyday tasks by generating
code snippets automatically from input-output examples and other high-level specifications …

Though recent advances in machine learning have led to significant improvements in
natural language interfaces for databases, the accuracy and reliability of these systems …

Loops with multiple phases are challenging to verify because they require disjunctive
invariants. Invariants could also have the form of implication between a precondition for the …

A frequent programming pattern for small tasks, especially expressions, is to repeatedly
evaluate the program on an input as its editing progresses. The Read-Eval-Print Loop …

We present a novel decision tree-based synthesis algorithm of ranking functions for verifying
program termination. Our algorithm is integrated into the workflow of CounterExample …

Abstract Programming-by-example (PBE) is a synthesis paradigm that allows users to
generate functions by simply providing input-output examples. While a promising interaction …