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

ver descrição completa

Detalhes bibliográficos

Autor principal:	Herde, Christian
Autor Corporativo:	SpringerLink (Online service)
Formato:	Electronic Resource
Idioma:	English
Publicado em:	Wiesbaden Vieweg+Teubner 2011.
Assuntos:	Automatic theorem proving. Constraints (Artificial intelligence). Computer science > Mathematics. Electronic books.
Acesso em linha:	Available for University of the Philippines Diliman via SpringerLink. Click here to access