We present the Leon verification system for a subset of the Scala programming language.
Along with several functional features of Scala, Leon supports imperative constructs such as …

Synthesis of program fragments from specifications can make programs easier to write and
easier to reason about. To integrate synthesis into programming languages, synthesis …

We describe techniques for synthesis and verification of recursive functional programs over
unbounded domains. Our techniques build on top of an algorithm for satisfiability modulo …

We introduce Refinement Reflection, a new framework for building SMT-based deductive
verifiers. The key idea is to reflect the code implementing a user-defined function into the …

We present a semi-decision procedure for checking satisfiability of expressive correctness
properties of recursive first-order functional programs. In our approach, both properties and …

We propose natural proofs for reasoning with programs that manipulate data-structures
against specifications that describe the structure of the heap, the data stored within it, and …

Several practical tools for automatically verifying functional programs (eg, Liquid Haskell
and Leon for Scala programs) rely on a heuristic based on unrolling recursive function …

The natural proof technique for heap verification developed by Qiu et al.[32] provides a
platform for powerful sound reasoning for specifications written in a dialect of separation …

First-order logic is a natural way of expressing properties of computation. It is traditionally
used in various program logics for expressing the correctness properties and certificates …

We present an extension of Scala that supports constraint programming over bounded and
unbounded domains. The resulting language, Kaplan, provides the benefits of constraint …