SMT-based checking of refinement types for call-by-value languages is a well-studied
subject. Unfortunately, the classical translation of refinement types to verification conditions …

Satisfiability modulo theory solvers are increasingly being used to solve quantified formulas
over structures such as integers and term algebras. Quantifier instantiation combined with …

HipSpec is a system for automatically deriving and proving properties about functional
programs. It uses a novel approach, combining theory exploration, counterexample testing …

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 …

Conflict-Free Replicated Data Types (CRDTs) are a recent approach for keeping replicated
data consistent while guaranteeing the absence of conflicts among replicas. For correct …

Haskell has many delightful features. Perhaps the one most beloved by its users is its type
system that allows developers to specify and verify a variety of program properties at …

This paper presents an extension to Liquid Haskell that facilitates stating and semi-
automatically proving properties of typeclasses. Liquid Haskell augments Haskell with …

Code deficiencies and bugs constitute an unavoidable part of software systems. In safety-
critical systems, like aircrafts or medical equipment, even a single bug can lead to …

In this paper we introduce a new approach for proving quantified theorems over inductively
defined data-types. We present an automated prover that searches for a sequence of …

Verification problems of programs in various paradigms can be reduced to problems of
solving Horn clause constraints on predicate variables that represent unknown inductive …