We describe the open-source tool dReal, an SMT solver for nonlinear formulas over the
reals. The tool can handle various nonlinear real functions such as polynomials …

We propose an approach for verifying non-linear hybrid systems using higher-order Taylor
models that are a combination of bounded degree polynomials over the initial conditions …

We introduce the notion of “δ-complete decision procedures” for solving SMT problems over
the real numbers, with the aim of handling a wide range of nonlinear functions including …

Writing accurate numerical software is hard because of many sources of unavoidable
uncertainties, including finite numerical precision of implementations. We present a …

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 …

Given any collection F of computable functions over the reals, we show that there exists an
algorithm that, given any sentence A containing only bounded quantifiers and functions in F …

Reachability analysis of nonlinear dynamical systems is a challenging and computationally
expensive task. Computing the reachable states for linear systems, in contrast, can often be …

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 …

Maintenance is recognised as the most difficult and expansive activity of the software
development process. Numerous techniques and processes have been proposed to ease …

Model‐based test generation techniques based on random input generation and guided
simulation do not satisfy the demands of high test coverage and completeness guarantees …