Decision Procedures An Algorithmic Point of View /

A 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 the...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: Kroening, Daniel (Συγγραφέας), Strichman, Ofer (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2016.
Έκδοση:2nd ed. 2016.
Σειρά:Texts in Theoretical Computer Science. An EATCS Series,
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04345nam a22005295i 4500
001 978-3-662-50497-0
003 DE-He213
005 20161122130503.0
007 cr nn 008mamaa
008 161122s2016 gw | s |||| 0|eng d
020 |a 9783662504970  |9 978-3-662-50497-0 
024 7 |a 10.1007/978-3-662-50497-0  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
072 7 |a UY  |2 bicssc 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a COM031000  |2 bisacsh 
082 0 4 |a 004.0151  |2 23 
100 1 |a Kroening, Daniel.  |e author. 
245 1 0 |a Decision Procedures  |h [electronic resource] :  |b An Algorithmic Point of View /  |c by Daniel Kroening, Ofer Strichman. 
250 |a 2nd ed. 2016. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2016. 
300 |a XXI, 356 p. 64 illus., 5 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Texts in Theoretical Computer Science. An EATCS Series,  |x 1862-4499 
505 0 |a Introduction 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 |a A 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 |a Computer science. 
650 0 |a Software engineering. 
650 0 |a Computers. 
650 0 |a Mathematical optimization. 
650 1 4 |a Computer Science. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Software Engineering/Programming and Operating Systems. 
650 2 4 |a Optimization. 
700 1 |a Strichman, Ofer.  |e author. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662504963 
830 0 |a Texts in Theoretical Computer Science. An EATCS Series,  |x 1862-4499 
856 4 0 |u http://dx.doi.org/10.1007/978-3-662-50497-0  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)