Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure: Proof Engines for the Analysis of Hybrid Discrete-continuous Systems - Christian Herde - Libros - Springer Fachmedien Wiesbaden - 9783834814944 - 10 de febrero de 2011
En caso de que portada y título no coincidan, el título será el correcto

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

Precio
$ 55,99
sin IVA

Pedido desde almacén remoto

Entrega prevista 29 de jun. - 10 de jul.
Añadir a tu lista de deseos de 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

Medios de comunicación Libros     Paperback Book   (Libro con tapa blanda y lomo encolado)
Publicado 10 de febrero de 2011
ISBN13 9783834814944
Editores Springer Fachmedien Wiesbaden
Páginas 163
Dimensiones 148 × 210 × 9 mm   ·   226 g
Lengua Inglés   Alemán  

Mere med samme udgiver