Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure: Proof Engines for the Analysis of Hybrid Discrete-continuous Systems - Christian Herde - Grāmatas - Springer Fachmedien Wiesbaden - 9783834814944 - 2011. gada 10. februāris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

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

Cena
€ 53,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 6. - 14. aug.
Saņemiet paziņojumus par jauniem Christian Herde izdevumiem
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

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

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 2011. gada 10. februāris
ISBN13 9783834814944
Izdevēji Springer Fachmedien Wiesbaden
Lapas 163
Izmēri 148 × 210 × 9 mm   ·   226 g
Valoda Angļu   Vācu  

Vairāk no tā paša izdevēja