We present PROPhESY, a tool for analyzing parametric Markov chains (MCs). It can
compute a rational function (ie, a fraction of two polynomials in the model parameters) for …

During the last decade, popular SMT solvers have been extended step-by-step with a wide
range of decision procedures for different theories. Some SMT solvers also support the user …

Researchers have developed neural network verification algorithms motivated by the need
to characterize the robustness of deep neural networks. The verifiers aspire to answer …

The satisfiability problem is the problem of deciding whether a logical formula is satisfiable.
For first-order arithmetic theories, in the early 20th century some novel solutions in form of …

Satisfiability Modulo Theories (SMT) has significant application in various domains. In this
paper, we focus on quantifier-free Satisfiablity Modulo Real Arithmetic, referred to as SMT …

Incremental linearization is a conceptually simple, yet effective, technique that we have
recently proposed for solving SMT problems over nonlinear real arithmetic constraints. In …

This paper presents raSAT SMT solver, which is aimed to handle polynomial constraints
over both reals and integers with simple unified methodologies. Its three main features are …

Quantifier-free nonlinear arithmetic (QF_NRA) appears in many applications of satisfiability
modulo theories solving (SMT). Accordingly, efficient reasoning for corresponding …

The purpose of this paper is to explore the question" to what extent could we produce formal,
machine-verifiable, proofs in real algebraic geometry?" The question has been asked before …

This paper gives a brief overview of Tarski, a system for computing with Tarski formulas,
which are boolean combinations of non-linear polynomial constraints over the reals. It gives …