000 04321nam a22004335i 4500
999 _c88278
_d88278
_x1
001 88278
003 ES-MaUEC
005 20230207040630.0
007 cr nn 008mamaa
008 161122s2016 gw | s |||| 0|eng d
020 _a9783662504970
024 7 _a10.1007/978-3-662-50497-0
_2doi
040 _aES-MaUEC
050 4 _aQA279.4
_bK764 2016 EB
100 1 _aKroening, Daniel
_0http://id.loc.gov/authorities/names/no2009033013
_0Local
_9101914
245 1 0 _aDecision Procedures :
_bAn Algorithmic Point of View
_cby Daniel Kroening, Ofer Strichman.
250 _a2nd ed. 2016.
260 _aBerlin, Heidelberg
_bSpringer
_c2016
300 _a1 recurso en línea (XXI, 356 p.)
_b64 ilustraciones, 5 ilustraciones en color
336 _aTexto (visual)
_btxt
_2rdacontent
337 _aelectrónico
_bc
_2rdamedia
338 _arecurso electrónico
_bcr
_2rdacarrier
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 7 _aIngeniería del software
_2embne
_9152630
650 0 7 _aOrdenadores
_2embne
_9138111
650 0 7 _9145705
_aOptimización matemática
_2embne
650 7 _aInformática
_2embne
_9139268
700 1 _aStrichman, Ofer
_0Local
_9101915
830 0 _aTexts in Theoretical Computer Science. An EATCS Series
_x1862-4499
_9134292
856 4 0 _uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://link.springer.com/book/10.1007/978-3-662-50497-0zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
901 _ai9783662504970
907 _a.b12982829
_b10-10-17
_c08-03-17
942 _2lcc
_cLE
945 _aQA279.4 K764 2016 EB
_g1
_ieBOOK
_j0
_lmae
_o-
_pEUR0.00
_q-
_r-
_sb
_t15
_u0
_v0
_w0
_x0
_y.i11604669
_z06-04-17
988 _aEBOOK, EBSPRINGER
998 _am
_a_alco
_a_vill
_b - -
_cm
_dz
_e-
_feng
_ggw
_h0