Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure: Proof Engines for the Analysis of Hybrid Discrete-continuous Systems - Christian Herde - Bøker - Springer Fachmedien Wiesbaden - 9783834814944 - 10. februar 2011
Ved uoverensstemmelse mellom cover og tittel gjelder tittel

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

Pris
NOK 519

Bestillingsvarer

Forventes levert 21. - 29. okt
Få varsel om nye utgivelser fra Christian Herde
Legg til iMusic ønskeliste
eller

Ikke vurdert ennå

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

Media Bøker     Pocketbok   (Bok med mykt omslag og limt rygg)
Utgitt 10. februar 2011
ISBN13 9783834814944
Utgivere Springer Fachmedien Wiesbaden
Antall sider 163
Mål 148 × 210 × 9 mm   ·   226 g
Språk Engelsk   Tysk  

Mer fra samme **utgiver**