000 03655nam a22005655i 4500
001 978-3-540-74105-3
003 DE-He213
005 20161121230718.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540741053
_9978-3-540-74105-3
024 7 _a10.1007/978-3-540-74105-3
_2doi
050 4 _aQ334-342
050 4 _aTJ210.2-211.495
072 7 _aUYQ
_2bicssc
072 7 _aTJFM1
_2bicssc
072 7 _aCOM004000
_2bisacsh
082 0 4 _a006.3
_223
100 1 _aKroening, Daniel.
_eauthor.
245 1 0 _aDecision Procedures
_h[electronic resource] :
_bAn Algorithmic Point of View /
_cby Daniel Kroening, Ofer Strichman.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _aXVI, 306 p.
_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 _aand Basic Concepts -- Decision Procedures for Propositional Logic -- Equality Logic and Uninterpreted Functions -- Decision Procedures for Equality Logic and Uninterpreted Functions -- Linear Arithmetic -- Bit Vectors -- Arrays -- Pointer Logic -- Quantified Formulas -- Deciding a Combination of Theories -- Propositional Encodings.
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 satisfiability modulo theories and then, in separate chapters, study decision procedures for each of the following theories: 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 and dedicate a chapter to modern techniques based on an interplay between a SAT solver and a decision procedure for the investigated theory. This textbook has been used to teach undergraduate and graduate courses at ETH Zurich, at the Technion, Haifa, and at the University of Oxford. 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 _aComputer logic.
650 0 _aMathematical logic.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aTheory of Computation.
650 2 4 _aSoftware Engineering.
700 1 _aStrichman, Ofer.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540741046
830 0 _aTexts in Theoretical Computer Science, An Eatcs Series,
_x1862-4499
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-74105-3
912 _aZDB-2-SCS
950 _aComputer Science (Springer-11645)
999 _c502854
_d502854