Efficient solving of large arithmetic constraint systems with complex Boolean structure : proof engines for the analysis of hybrid discretecontinuous systems
Resource Information
The work Efficient solving of large arithmetic constraint systems with complex Boolean structure : proof engines for the analysis of hybrid discretecontinuous systems represents a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Work, Language Material, Books.
The Resource
Efficient solving of large arithmetic constraint systems with complex Boolean structure : proof engines for the analysis of hybrid discretecontinuous systems
Resource Information
The work Efficient solving of large arithmetic constraint systems with complex Boolean structure : proof engines for the analysis of hybrid discretecontinuous systems represents a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Work, Language Material, Books.
 Label
 Efficient solving of large arithmetic constraint systems with complex Boolean structure : proof engines for the analysis of hybrid discretecontinuous systems
 Title remainder
 proof engines for the analysis of hybrid discretecontinuous systems
 Statement of responsibility
 Christian Herde ; With a foreword by Martin Fränzle
 Subject

 Automatic theorem proving
 Automatic theorem proving
 Automatic theorem proving
 Computer science  Mathematics
 Computer science  Mathematics
 Computer science  Mathematics
 Computer science  Mathematics
 Constraints (Artificial intelligence)
 Constraints (Artificial intelligence)
 Constraints (Artificial intelligence)
 Constraints (Artificial intelligence)
 Electronic resources
 Informatique
 Automatic theorem proving
 Language
 eng
 Summary
 Due to the growing use of more and more complex computerized systems in safetycritical applications, the formal verification of such systems is increasingly gaining importance. Many automatic and semiautomatic 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 realvalued variables. Although aiming at providing tool support for the verification of hybrid discretecontinuous 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
 Cataloging source
 GW5XE
 Dissertation note
 Diss. Universität Oldenburg, 2010.
 Image bit depth
 0
 LC call number
 QA76.9.A96
 LC item number
 H47 2011
 Literary form
 non fiction
 Nature of contents
 dictionaries
Context
Context of Efficient solving of large arithmetic constraint systems with complex Boolean structure : proof engines for the analysis of hybrid discretecontinuous systemsEmbed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/resource/r2g_sG7mrGM/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/r2g_sG7mrGM/">Efficient solving of large arithmetic constraint systems with complex Boolean structure : proof engines for the analysis of hybrid discretecontinuous systems</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Work Efficient solving of large arithmetic constraint systems with complex Boolean structure : proof engines for the analysis of hybrid discretecontinuous systems
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/resource/r2g_sG7mrGM/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/r2g_sG7mrGM/">Efficient solving of large arithmetic constraint systems with complex Boolean structure : proof engines for the analysis of hybrid discretecontinuous systems</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>