000 02313nam a22003855i 4500
001 978-3-8348-9949-1
003 DE-He213
005 20140220083819.0
007 cr nn 008mamaa
008 110329s2011 gw | s |||| 0|eng d
020 _a9783834899491
_9978-3-8348-9949-1
024 7 _a10.1007/978-3-8348-9949-1
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aCOM014000
_2bisacsh
082 0 4 _a004
_223
100 1 _aHerde, Christian.
_eauthor.
245 1 0 _aEfficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure
_h[electronic resource] :
_bProof Engines for the Analysis of Hybrid Discrete-Continuous Systems /
_cby Christian Herde.
264 1 _aWiesbaden :
_bVieweg+Teubner,
_c2011.
300 _aXVII, 163p. 30 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
520 _aDue 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.
650 0 _aComputer science.
650 1 4 _aComputer Science.
650 2 4 _aComputer Science, general.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783834814944
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-8348-9949-1
912 _aZDB-2-SCS
999 _c108743
_d108743