Sciweavers

103 search results - page 1 / 21
» The Barcelogic SMT Solver
Sort
View
CAV
2008
Springer
121views Hardware» more  CAV 2008»
13 years 6 months ago
The Barcelogic SMT Solver
This is the first system description of the Barcelogic SMT solver, which implements all techniques that our group has been developing over the last four years as well as state-of-t...
Miquel Bofill, Robert Nieuwenhuis, Albert Oliveras...
LPAR
2005
Springer
13 years 10 months ago
Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
An overview is given of a number of recent developments in SAT and SAT Modulo Theories (SMT). In particular, based on our k of Abstract DPLL and Abstract DPLL modulo Theories, we e...
Robert Nieuwenhuis, Albert Oliveras
FORMATS
2010
Springer
13 years 2 months ago
Natural Domain SMT: A Preliminary Assessment
SMT solvers have traditionally been based on the DPLL(T) algorithm, where the driving force behind the procedure is a DPLL search over truth valuations. This traditional framework ...
Scott Cotton
STTT
2010
92views more  STTT 2010»
12 years 11 months ago
Don't care in SMT: building flexible yet efficient abstraction/refinement solvers
ion/refinement solvers1 Andreas Bauer , Martin Leucker , Christian Schallhart , Michael Tautschnig Computer Sciences Laboratory, Australian National University Institut f
Andreas Bauer 0002, Martin Leucker, Christian Scha...
LPAR
2010
Springer
13 years 2 months ago
Dafny: An Automatic Program Verifier for Functional Correctness
Traditionally, the full verification of a program's functional correctness has been obtained with pen and paper or with interactive proof assistants, whereas only reduced ver...
K. Rustan M. Leino