Efficient solving of large arithmetic constraint systems with complex boolean structure proof engines for the analysis of hybrid discrete-continuous systems

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 fo...

Descrición completa

Detalles Bibliográficos
Autor Principal: Herde, Christian
Autor Corporativo: SpringerLink (Online service)
Formato: Electronic Resource
Idioma:inglés
Publicado: Wiesbaden Vieweg+Teubner 2011.
Subjects:
Acceso en liña:Available for University of the Philippines Diliman via SpringerLink. Click here to access