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

Descrizione completa

Dettagli Bibliografici
Autore principale: Herde, Christian
Ente Autore: SpringerLink (Online service)
Natura: Electronic Resource
Lingua:English
Pubblicazione: Wiesbaden Vieweg+Teubner 2011.
Soggetti:
Accesso online:Available for University of the Philippines Diliman via SpringerLink. Click here to access