|
|
|
|
| LEADER |
03672nam a22005655i 4500 |
| 001 |
978-3-540-74105-3 |
| 003 |
DE-He213 |
| 005 |
20151204140718.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2008 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540741053
|9 978-3-540-74105-3
|
| 024 |
7 |
|
|a 10.1007/978-3-540-74105-3
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a Q334-342
|
| 050 |
|
4 |
|a TJ210.2-211.495
|
| 072 |
|
7 |
|a UYQ
|2 bicssc
|
| 072 |
|
7 |
|a TJFM1
|2 bicssc
|
| 072 |
|
7 |
|a COM004000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 006.3
|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.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2008.
|
| 300 |
|
|
|a XVI, 306 p.
|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 and 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 |
|
|
|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 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 |
|a Computer science.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 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 9783540741046
|
| 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-540-74105-3
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
