000 03268nam a22003855i 4500
001 297282
003 MX-SnUAN
005 20160429155416.0
007 cr nn 008mamaa
008 150903s2008 gw | o |||| 0|eng d
020 _a9783540741053
_99783540741053
024 7 _a10.1007/9783540741053
_2doi
035 _avtls000350751
039 9 _a201509030420
_bVLOAD
_c201405060239
_dVLOAD
_y201402171105
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA8.9-QA10.3
100 1 _aKroening, Daniel.
_eautor
_9332942
245 1 0 _aDecision Procedures :
_bAn Algorithmic Point of View /
_cby Daniel Kroening, Ofer Strichman.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aTexts in Theoretical Computer Science, An Eatcs Series,
_x1862-4499
500 _aSpringer eBooks
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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aStrichman, Ofer.
_eautor
_9332943
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783540741046
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-540-74105-3
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c297282
_d297282