Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure: Proof Engines for the Analysis of Hybrid Discrete-continuous Systems - Christian Herde - 書籍 - Springer Fachmedien Wiesbaden - 9783834814944 - 2011年2月10日
カバー画像とタイトルが一致しない場合、正しいのはタイトルです

Christian Herde
Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure: Proof Engines for the Analysis of Hybrid Discrete-continuous Systems 2011 edition

価格
¥ 10.403
税抜

遠隔倉庫からの取り寄せ

発送予定日 年8月25日 - 年9月10日
Christian Herde の新しいリリースのお知らせを受け取る

お客様の声：

EU消費者保護法に基づく14日間の返品ポリシー
Trustpilotで高評価
iMusicのウィッシュリストに追加

まだ評価がありません

Due to the growing use of more and more complex computerized systems in the safety-critical applications, the formal verification of such systems is increasingly gaining importance. Many automatic and semi-automatic schemes for hardware and software verification ultimately rely on decision procedures for discharging the proof obligations generated during the verification process. Christian Herde deals with the development of such procedures, providing 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. Although aiming at providing tool support for the verification of hybrid discrete-continuous systems, most of the techniques he describes are general purpose and have applications in many other domains, like operations research, planning, software validation, and electronic design automation.

163 pages, 30 black & white illustrations, 12 black & white tables, biography

メディア 書籍     Paperback Book   (ソフトカバーで背表紙を接着した本)
リリース済み 2011年2月10日
ISBN13 9783834814944
出版社 Springer Fachmedien Wiesbaden
ページ数 163
寸法 148 × 210 × 9 mm   ·   226 g
言語 英語   ドイツ語  

同じ出版社からのその他の記事

Christian Herdeのすべてを見る ( 例： Paperback Book )