• Aucun résultat trouvé

The Nuts and Bolts of Yices

N/A
N/A
Protected

Academic year: 2022

Partager "The Nuts and Bolts of Yices"

Copied!
1
0
0

Texte intégral

(1)

The Nuts and Bolts of Yices

Bruno Dutertre

Computer Science Laboratory SRI International Bruno.Dutertre@sri.com

Abstract

At a high-level, the architecture of many SMT solvers is well known. It is the combination of a SAT solver and one or more decision procedures called theory solvers. But how to effectively implement such a combination is rarely discussed in the literature. This talk will focus on implementation issues. We will discuss the practical integration of CDCL-based SAT solvers and theory solvers. We will present data structures and algorithms employed by the Yices SMT solver, and examine preprocessing and formula simplification, which have a significant impact on a solver’s performance.

Yices is developed and distributed by SRI International. It is free for non-commercial use.

Source and binaries are available athttp://yices.csl.sri.com.

1

Références

Documents relatifs

Conflicts were not solved under flight level 320, and a delay t e was added when necessary for aircraft entering the Free Flight zone in order to separate them on entry

This last point means that V AMPIRE can only answer sat for the theory of uninterpreted functions, or for ground problems where all theory parts are passed to an SMT solver via

Theory Solvers Z3 uses a linear arithmetic solver based on the algorithm used in Yices [9].. The array theory uses lazy instantiation of

Même si l’utilisation de codes basés sur la résolution des équations de Navier-Stokes moyennées au sens de Reynolds (RANSE) est dominante, de nombreuses

To analyze pseudo-programs consisting of programming language statements and calls to unimplemented procedures, such as operations on ADT's, we compute the running time as a

Operating system format, which is used to check blocks and write directory information, is also different from SCSI Format Unit. • Disk data may get lost after SCSI

In the scheme of the (unbalanced) priority search tree outlined above, each node p divides the plane into two parts along the line x = p.x. All nodes of the left subtree lie to

We group the set of all inputs into classes of “similar” inputs and summarize the performance on all instances in the same class into a single number. The most useful grouping is