Metareasoning can be achieved in probabilistic programming languages (PPLs) using
agent models that recursively nest inference queries inside inference queries. However, the …

In the past decade, Satisfiability Modulo Theories (SMT) solvers have been used
successfully in a variety of applications including verification, automated theorem proving …

Abstract The annual Satisfiability Modulo Theories Competition (SMT-COMP) was initiated
in 2005 in order to stimulate the advance of state-of-the-art techniques and tools developed …

First order logic provides a convenient formalism for describing a wide variety of verification
conditions. Two main approaches to checking such conditions are pure first order automated …

SMT solvers typically reason about universal quantifiers via E-matching: syntactic matching
patterns for each quantifier prescribe shapes of ground terms whose presence in the SMT …

he cvc5 solver is today one of the strongest systems for solving first order problems with
theories but also without them. In this work we equip its enumeration-based instantiation …

We give a case study for a Satisfiability Modulo Theories (SMT) solver usage in functional
verification of a real world operating system. In particular, we present a view of the E …

Abstract Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient
and suitable for integrated theory reasoning. The most efficient SMT solvers rely on …

We demonstrate for the first time that Liquid Haskell, a refinement type checker for Haskell
programs, can be used for arbitrary theorem proving by verifying a parallel, monoidal string …

Multithreaded programs generally leverage efficient and thread-safe concurrent objects like
sets, key-value maps, and queues. While some concurrentobject operations are designed to …