<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd" xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>00000cmm a22000004i 4500</leader>
  <controlfield tag="001">UP-99796217611115323</controlfield>
  <controlfield tag="003">Buklod</controlfield>
  <controlfield tag="005">20140207092134.0</controlfield>
  <controlfield tag="006">m    go  j        </controlfield>
  <controlfield tag="007">cr |n |||auu|a</controlfield>
  <controlfield tag="008">110329s2011    xx         u |      eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
   <subfield code="a">9783834899491 (ebook)</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
   <subfield code="a">3834899496 (ebook)</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(iLib)UPD-00212405219</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">DML</subfield>
  </datafield>
  <datafield tag="041" ind1="0" ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="042" ind1=" " ind2=" ">
   <subfield code="a">DMLUC</subfield>
  </datafield>
  <datafield tag="084" ind1=" " ind2=" ">
   <subfield code="a">QA 76.9 A96</subfield>
   <subfield code="b">H47 2011eb</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Herde, Christian.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Efficient solving of large arithmetic constraint systems with complex boolean structure</subfield>
   <subfield code="h">[electronic resource]</subfield>
   <subfield code="b">proof engines for the analysis of hybrid discrete-continuous systems</subfield>
   <subfield code="c">by Christian Herde.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
   <subfield code="a">Wiesbaden</subfield>
   <subfield code="b">Vieweg+Teubner</subfield>
   <subfield code="c">2011.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">1 online resource (xvi, 163 p.)</subfield>
   <subfield code="b">ill.</subfield>
  </datafield>
  <datafield tag="506" ind1=" " ind2=" ">
   <subfield code="a">IP-based subscription, access limited to within on campus computer network.</subfield>
   <subfield code="c">Access via Electronic Resources  of the UPD University Library Website.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">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 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.</subfield>
  </datafield>
  <datafield tag="533" ind1=" " ind2=" ">
   <subfield code="a">Electronic reproduction.</subfield>
   <subfield code="b">New York</subfield>
   <subfield code="c">SpringerLink</subfield>
   <subfield code="d">2011.</subfield>
   <subfield code="n">Available via World Wide Web through SpringerLink.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Automatic theorem proving.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Constraints (Artificial intelligence).</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Computer science</subfield>
   <subfield code="x">Mathematics.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Electronic books.</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
   <subfield code="a">SpringerLink (Online service).</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="z">Available for University of the Philippines Diliman via SpringerLink. Click here to access</subfield>
   <subfield code="u">http://dx.doi.org/10.1007/978-3-8348-9949-1</subfield>
  </datafield>
  <datafield tag="856" ind1=" " ind2=" ">
   <subfield code="z">(viewed 15 September 2014)</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">FO</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="a">Monograph</subfield>
  </datafield>
  <datafield tag="852" ind1="0" ind2=" ">
   <subfield code="a">UPD</subfield>
   <subfield code="b">DMLR</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
   <subfield code="a">Electronic Resource</subfield>
  </datafield>
 </record>
</collection>
