Abstract cvc5 is the latest SMT solver in the cooperating validity checker series and builds
on the successful code base of CVC4. This paper serves as a comprehensive system …

Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …

Today's distributed systems are increasingly complex, leading to subtle bugs that are difficult
to detect with standard testing methods. Formal verification can provably rule out such bugs …

Formal methods applications often rely on SMT solvers to automatically discharge proof
obligations. SMT solvers handle quantified formulas using incomplete heuristic techniques …

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

SMT solvers have throughout the years been able to cope with increasingly expressive
formulas, from ground logics to full first-order logic (FOL). In contrast, the extension of SMT …

SMT-based applications increasingly rely on SMT solvers being able to deal with quantified
formulas. Current work shows that for formulas with quantifiers over uninterpreted sorts …

This paper introduces a new property called robust reachability which refines the standard
notion of reachability in order to take replicability into account. A bug is robustly reachable if …

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 …

This article presents Pardinus, an extension of the popular Kodkod relational model finder
with linear temporal logic (including past operators), to simplify the analysis of dynamic …