ENGLISH

Decision Procedures: An Algorithmic Point of View

By Daniel Kroening , Ofer Strichman , R.E. Bryant

Book information

Publisher
Springer
Year
2008
ISBN
3540741046, 9783540741046, 9783540741053
Language
english
Format
PDF
Filesize
3 MB (3651516 bytes)
Series
Texts in Theoretical Computer Science. An EATCS Series
Edition
1
Pages
312\312
Library
flazx.com
Time added
2010-02-18 13:16:04

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

Similar books