Skip to content

Satisfiability From Core Algorithms to Novel Application Domains

Spend $50 to get a free movie!

ISBN-10: 3838101022

ISBN-13: 9783838101026

Edition: 2009

Authors: Marc Herbstritt

List price: $126.00
Blue ribbon 30 day, 100% satisfaction guarantee!
Out of stock
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!


The verification of systems to guarantee theircorrect behavior is discussed in this book. Themainly applied algorithmic method is the modelchecking technique combined with algorithmsfor solving the satisfiability problem (short: SAT).SAT-based verification of discrete systems has becomeone of the most effective technique within the last10 years, such that industrial as well as academicapplications heavily rely on it.The book covers the whole range of a SAT-based toolapplication. We propose extensions and concepts thatconcentrate on the core of a SAT-solver. However,these proposals are then transferred to novelverification models. Moreover, we describe approaches that incorporate the…    
Customers also bought

Book details

List price: $126.00
Copyright year: 2009
Publisher: S�dwestdeutscher Verlag f�r Hochschulschriften AG & Company KG
Binding: Paperback
Pages: 236
Size: 6.00" wide x 9.00" long x 0.50" tall
Weight: 0.704