Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure: Proof Engines for the Analysis of Hybrid Discrete-Continuous  by Christian HerdeEfficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure: Proof Engines for the Analysis of Hybrid Discrete-Continuous  by Christian Herde

Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure: Proof…

byChristian Herde

Paperback | February 10, 2011

Pricing and Purchase Info

$141.95 online 
$165.95 list price save 14%
Earn 710 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

Christian Herde deals with the development of decision procedures as needed, e.g., for automatic verification of hardware and software systems via bounded model checking. He provides methods for efficiently solving formulae comprising complex Boolean combinations of linear, polynomial, and transcendental arithmetic constraints, involving thousands of Boolean-, integer-, and real-valued variables.
Dr. Christian Herde completed his doctoral thesis under the supervision of Prof. Dr. Martin Fränzle at the Department of Computing Science at the University of Oldenburg, Germany.
Loading
Title:Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure: Proof…Format:PaperbackDimensions:163 pagesPublished:February 10, 2011Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3834814946

ISBN - 13:9783834814944

Look for similar items by category:

Reviews

Table of Contents

Hybrid Dynamical Systems; Extending DPLL for Pseudo-Boolean Constraints; Integration of DPLL-SAT and Linear Programming; Integration of DPLL and Interval Constraint Solving