| 書目名稱 | Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure | | 副標(biāo)題 | Proof Engines for th | | 編輯 | Christian Herde | | 視頻video | http://file.papertrans.cn/304/303008/303008.mp4 | | 圖書封面 |  | | 描述 | Due to the growing use of more and more complex computerized systems in 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.. | | 出版日期 | Book 2011 | | 關(guān)鍵詞 | constraint solving; formal verification; hybrid systems; model checking; satisfiability checking | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-8348-9949-1 | | isbn_softcover | 978-3-8348-1494-4 | | isbn_ebook | 978-3-8348-9949-1 | | copyright | Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH, Wiesbaden 2011 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-12 17:39
發(fā)表于 2025-3-21 18:24:59
