Decision Procedures: An Algorithmic Point of View (Texts in Theoretical Computer Science. An EATCS Series) - Image 1

£30.74

Springer Decision Procedures: An Algorithmic Point of View (Texts in Theoretical Computer Science. An EATCS Series)

Name: Decision Procedures: An Algorithmic Point of View (Texts in Theoretical Computer Science. An EATCS Series)
Brand: Springer
Price: 30.74 GBP
Availability: InStock

Architecture & Microprocessors

Price History & Forecast

Last 23 days • 23 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 23 days • 1 price levels

Days at Price

Price Analysis

Most common price: £31 (23 days, 100.0%)

Price range: £31 - £31

Price levels: 1 different prices over 23 days

Description

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. Thefirst 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.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3662570653
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 13 July 2018
Listed Since: 13 July 2018

Barcode

No barcode data available

Springer Decision Procedures: An Algorithmic Point of View (Texts in Theoretical Computer Science. An EATCS Series)

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Declarative Logic Programming: Theory, Systems, and Applications (ACM Books)

Computation Engineering: Applied Automata Theory and Logic

Handbook of Satisfiability: Second Edition (Frontiers in Artificial Intelligence and Applications (IOS Press))

Rational Decision Making

Logic for Applications (Texts in Computer Science)

Language Computability and Formal Language Theory

Special Topics in Mathematics for Computer Scientists: Sets, Categories, Topologies and Measures

SAT 2005: Satisfiability Research in the Year 2005

Springer SAT 2005: Satisfiability Research in the Year 2005

Declarative Logic Programming: Theory, Systems, and Applications (ACM Books)

Formal Verification of Simulink/Stateflow Diagrams: A Deductive Approach

Set Theory for Computing: From Decision Procedures to Declarative Programming with Sets (Monographs in Computer Science)

Advanced Boolean Techniques: Selected Papers from the 13th International Workshop on Boolean Problems

The Calculus of Computation: Decision Procedures with Applications to Verification

Algorithmen - Eine Einführung

Decision Making: Uncertainty, Imperfection, Deliberation and Scalability: 538 (Studies in Computational Intelligence, 538)

Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications: 145 (Studies in Computational Intelligence, 145)

Satisfiability Problem: Theory and Applications (Series in Discrete Mathematics and Theoretical Computer Science)

Computation Engineering: Applied Automata Theory and Logic

Verification of Sequential and Concurrent Programs (Texts in Computer Science)

Springer Automatic Control, Robotics, and Information Processing 296

Automatic Control, Robotics, and Information Processing: 296 (Studies in Systems, Decision and Control, 296)

Synthesis of Finite State Machines: Logic Optimization

/uploads/images/products/2/B0D9H66CH7/de02f99d-bad7-4d89-b10c-cc7c8f380e2a.webp