000 04343nam a22005415i 4500
001 978-3-662-50497-0
003 DE-He213
005 20200421111156.0
007 cr nn 008mamaa
008 161122s2016 gw | s |||| 0|eng d
020 _a9783662504970
_9978-3-662-50497-0
024 7 _a10.1007/978-3-662-50497-0
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aKroening, Daniel.
_eauthor.
245 1 0 _aDecision Procedures
_h[electronic resource] :
_bAn Algorithmic Point of View /
_cby Daniel Kroening, Ofer Strichman.
250 _a2nd ed. 2016.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2016.
300 _aXXI, 356 p. 64 illus., 5 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTexts in Theoretical Computer Science. An EATCS Series,
_x1862-4499
505 0 _aIntroduction and Basic Concepts -- Decision Procedures for Propositional Logic -- From Propositional to Quantifier-Free Theories -- Equalities and Uninterpreted Functions -- Linear Arithmetic -- Bit Vectors -- Arrays -- Pointer Logic -- Quantified Formulas -- Deciding a Combination of Theories -- Propositional Encodings -- Applications in Software Engineering -- SMT-LIB 2.0: A Brief Tutorial -- A C++ Library for Developing Decision Procedures.
520 _aA decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry. The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework. Then, in separate chapters, they study decision procedures for propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas. They also study the problem of deciding combined theories based on the Nelson-Oppen procedure. The first edition of this book was adopted as a textbook in courses worldwide. It was published in 2008 and the field now called SMT was then in its infancy, without the standard terminology and canonic algorithms it has now; this second edition reflects these changes. It brings forward the DPLL(T) framework. It also expands the SAT chapter with modern SAT heuristics, and includes a new section about incremental satisfiability, and the related Constraints Satisfaction Problem (CSP). The chapter about quantifiers was expanded with a new section about general quantification using E-matching and a section about Effectively Propositional Reasoning (EPR). The book also includes a new chapter on the application of SMT in industrial software engineering and in computational biology, coauthored by Nikolaj Bj�rner and Leonardo de Moura, and Hillel Kugler, respectively. Each chapter includes a detailed bibliography and exercises. Lecturers' slides and a C++ library for rapid prototyping of decision procedures are available from the authors' website.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aComputers.
650 0 _aMathematical optimization.
650 1 4 _aComputer Science.
650 2 4 _aTheory of Computation.
650 2 4 _aSoftware Engineering/Programming and Operating Systems.
650 2 4 _aOptimization.
700 1 _aStrichman, Ofer.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783662504963
830 0 _aTexts in Theoretical Computer Science. An EATCS Series,
_x1862-4499
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-662-50497-0
912 _aZDB-2-SCS
942 _cEBK
999 _c53560
_d53560