8,716 Hits in 1.5 sec

Computing with an SMT Solver [chapter]

Nada Amin, K. Rustan M. Leino, Tiark Rompf
2014 Lecture Notes in Computer Science  
By design, such avoidance limits the extent to which the SMT solver is able to apply the definitions of user-defined functions.  ...  Satisfiability modulo theories (SMT) solvers that support quantifier instantiations via matching triggers can be programmed to give practical support for user-defined theories.  ...  Acknowledgments We thank Nik Swamy for useful comments on an earlier draft of this paper.  ... 
doi:10.1007/978-3-319-09099-3_2 fatcat:veoirjvmjffq7d3ihtoa77xxua

Automating Induction with an SMT Solver [chapter]

K. Rustan M. Leino
2012 Lecture Notes in Computer Science  
SMT solver.  ...  Sometimes an alternative to proof assistants, satisfiability modulo theories (SMT) solvers bring the hope of a higher degree of automation.  ...  I appreciate the valuable comments by Jean-Christophe Filliâtre and the referees on an earlier version of this paper.  ... 
doi:10.1007/978-3-642-27940-9_21 fatcat:jghhbkqa7reknhxopc37vr5a7i

Exact Incremental Analysis of Timed Automata with an SMT-Solver [chapter]

Bahareh Badban, Martin Lange
2011 Lecture Notes in Computer Science  
We then advocate the use of SMT solvers for the exact incremental analysis of timed automata via these problems.  ...  We present some experimental data obtained from a prototypical implementation measuring the practical feasibility of the approach to timed automata via SMT solvers.  ...  Furthermore, most SMT solvers nowadays comply with the SMT-LIB standards in the sense that it is clearly stated which theories they handle.  ... 
doi:10.1007/978-3-642-24310-3_13 fatcat:e2jrjjlzkbecfihih7xlnttjya

Separation Logic Verification of C Programs with an SMT Solver

Matko Botinčan, Matthew Parkinson, Wolfram Schulte
2009 Electronical Notes in Theoretical Computer Science  
The distinguishing features of the approach are representation of the C memory model in separation logic by means of rewrite rules suitable for automation and the careful integration of an SMT solver behind  ...  We thank Nikolaj Bjørner for providing us with details about Z3 and suggesting us the approach in Algorithm 1, and anonymous reviewers for helpful suggestions and remarks on the earlier version of this  ...  We present two algorithms used in the pure prover to compute congruence closure with an SMT solver.  ... 
doi:10.1016/j.entcs.2009.09.057 fatcat:m4qroup4cvgqplzlhhnlecg4qa

SMT-based Constraint Answer Set Solver EZSMT+ [article]

Da Shen, Yuliya Lierler
2019 arXiv   pre-print
Constraint answer set programming integrates answer set programming with constraint processing.  ...  System EZSMT+ is a constraint answer set programming tool that utilizes satisfiability modulo theory solvers for search.  ...  We design a process to After computing an answer set X of a program, the cmodels(diff) system invokes an SMT solver again by adding formulas encoding the fact that a newly computed model should be different  ... 
arXiv:1905.03334v2 fatcat:7grxo5l5yzbljl763rxxfykjme

Smten: Automatic Translation of High-Level Symbolic Computations into SMT Queries [chapter]

Richard Uhler, Nirav Dave
2013 Lecture Notes in Computer Science  
Development of computer aided verification tools has greatly benefited from SMT technologies; instead of writing an ad-hoc reasoning engine, designers translate their problem into SMT queries which solvers  ...  We demonstrate the use of Smten in the development of an SMT-based string constraint solver.  ...  Given match, the Symbolic monad can be used to easily describe an SMT-based tool which accepts a length i and regular expression as input, and uses an SMT solver to find a concrete string of length i matching  ... 
doi:10.1007/978-3-642-39799-8_45 fatcat:a7wbyboh4vhxdlfgm6p4qw5nhe

$$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation [chapter]

Erika Ábrahám, John Abbott, Bernd Becker, Anna M. Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio (+3 others)
2016 Lecture Notes in Computer Science  
Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, implementation and application  ...  Modern SMT solvers typically combine a SAT solver with one or more theory solvers as illustrated in Figure 2 .  ...  We are aware of only two SMT solvers that are complete for non-linear real arithmetic: Firstly, the prominent Z3 solver developed at Microsoft Research, which uses an elegant SMT-adaptation of the cylindrical  ... 
doi:10.1007/978-3-319-42547-4_3 fatcat:lfizdur2sfdprjhgcycuac4zum

Satisfiability checking and symbolic computation

E. Ábrahám, P. Fontaine, S. Forrest, A. Griggio, D. Kroening, W. M. Seiler, T. Sturm, J. Abbott, B. Becker, A. M. Bigatti, M. Brain, B. Buchberger (+3 others)
2017 ACM Communications in Computer Algebra  
Symbolic Computation and Satisfiability Checking are viewed as individual research areas, but they share common interests in the development, implementation and application of decision procedures for arithmetic  ...  SMT solvers typically combine a SAT solver with one or more theory solvers as illustrated in Figure 2 .  ...  Figure 1 : 1 History of Computer Algebra Systems and SAT/SMT solvers [1] Figure 2 : 2 The typical functioning of SMT solvers uses interval constraint propagation; MiniSmt tries to reduce problems to  ... 
doi:10.1145/3055282.3055285 fatcat:57th32bctrdwvmmds644xchqsy

SMT-RAT: An SMT-Compliant Nonlinear Real Arithmetic Toolbox [chapter]

Florian Corzilius, Ulrich Loup, Sebastian Junges, Erika Ábrahám
2012 Lecture Notes in Computer Science  
NRA is an important but hard-to-solve theory and only fragments of it can be handled by some of the currently available SMT solvers.  ...  We present SMT-RAT, a C++ toolbox offering theory solver modules for the development of SMT solvers for nonlinear real arithmetic (NRA).  ...  SMT solvers combine a SAT solver computing satisfying assignments for the Boolean structure of the SMT formula with procedures to check the consistency of theory constraints.  ... 
doi:10.1007/978-3-642-31612-8_35 fatcat:25uofmb2gvcpbkr5aj2xvxjibm

Symbolic Computation and Satisfiability Checking : Report of Dagstuhl Seminar 15471

Erika Ábrahám, Pascal Fontaine, Thomas Sturm, Dongming Wang, Erika Ábrahám, Pascal Fontaine, Thomas Sturm, Dongming Wang
2016 Dagstuhl Reports  
It gathered members of the two communities of symbolic computation (or computer algebra) and satisfiability checking (including satisfiability modulo theories).  ...  The seminar focused on satisfiability checking for combinations of first-order logic and subclasses thereof with arithmetic theories in a very liberal sense, also covering quantifiers and parameters.  ...  Nowadays, SMT-LIB is supported by all the main SMT solvers. It is used as the interface language of many tools (e.g. verification platforms) with their SMT solver backends.  ... 
doi:10.18154/rwth-2017-01217 fatcat:5aaxyhouqrdcfhhvek76vkdwjm

Modular strategic SMT solving with SMT-RAT

Gereon Kremer, Erika Ábrahám
2018 Acta Universitatis Sapientiae: Informatica  
We describe our CArL library for arithmetic computations, the available modules implemented on top of CArL, and how modules can be combined to satisfiability-modulo-theories (SMT) solvers.  ...  As a distinguishing feature, SMT-RAT provides a set of solving modules and supports their strategic combination.  ...  The current version of SMT-RAT can be compiled to an MCSAT-style SMT solver using an NLSAT-style explanation and it seems to work reliably on the SMT-LIB benchmark set.  ... 
doi:10.2478/ausi-2018-0001 fatcat:eedfeixfz5fc5jdph2g6rzrcye

All-Solution Satisfiability Modulo Theories: Applications, Algorithms and Benchmarks

Quoc-Sang Phan, Pasquale Malacaria
2015 2015 10th International Conference on Availability, Reliability and Security  
Secondly, we then propose algorithms to design an All-SMT solver on top of an existing SMT solver, and implement it into a prototype tool, called aZ3.  ...  In this paper, we study the problem of finding all solutions of an SMT problem with respect to a set of Boolean variables, henceforth All-SMT.  ...  Combining Bounded Model Checking with an All-SMT solver, we can compute multiple counterexamples in one run of the model checker. • Automated Test Generation: an All-SMT solver can be combined with a Bounded  ... 
doi:10.1109/ares.2015.14 dblp:conf/IEEEares/PhanM15 fatcat:3far5acohnbofhpr6sxq23lytq

Search-Space Partitioning for Parallelizing SMT Solvers [chapter]

Antti E. J. Hyvärinen, Matteo Marescotti, Natasha Sharygina
2015 Lecture Notes in Computer Science  
Nevertheless relatively little research exists on how parallel computing can be used to speed up SMT solving.  ...  The Satisfiability Modulo Theories (SMT) problem is the decision problem of determining whether a propositional formula is satisfiable, given that some of the variables have an interpretation with respect  ...  Nevertheless relatively little research exists on how parallel computing can be used to speed up SMT solving.  ... 
doi:10.1007/978-3-319-24318-4_27 fatcat:nozxmvmsgvctlni7avvc2camva

The OpenSMT Solver [chapter]

Roberto Bruttomesso, Edgar Pek, Natasha Sharygina, Aliaksei Tsitovich
2010 Lecture Notes in Computer Science  
This paper describes OpenSMT, an incremental, efficient, and open-source SMT-Solver.  ...  OpenSMT has been specifically designed to be easily extended with new theory-solvers, in order to be accessible for non-experts for the development of customized algorithms.  ...  Explanations for deductions are computed on demand. When an explanation for a deduction l is required, the literal ¬l is pushed in the T -solver 3 , and the explanation is computed by calling check.  ... 
doi:10.1007/978-3-642-12002-2_12 fatcat:n5gbjetmpzfz5g2ga7dz77gnjm

SMT-COMP: Satisfiability Modulo Theories Competition [chapter]

Clark Barrett, Leonardo de Moura, Aaron Stump
2005 Lecture Notes in Computer Science  
SMT solvers decide logical satisfiability (or dually, validity) with respect to a background theory expressed in classical first-order logic with equality.  ...  More detailed information can be found on the SMT-COMP web site: Entrants An entrant to SMT-COMP is an SMT solver submitted in either source code or binary  ... 
doi:10.1007/11513988_4 fatcat:e4hzz64iubcd5pfroydoludhqa
« Previous Showing results 1 — 15 out of 8,716 results