<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-08-10T17:38:08Z</responseDate>
  <request identifier="2790" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2790</identifier>
        <datestamp>2024-03-06T11:09:21Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra</dc:title>
          <dc:creator>Abraham, Erika</dc:creator>
          <dc:creator>Corzilius, Florian</dc:creator>
          <dc:creator>Loup, Ulrich</dc:creator>
          <dc:creator>Sturm, Thomas</dc:creator>
          <dc:subject>SMT-solving</dc:subject>
          <dc:subject>Real Algebra</dc:subject>
          <dc:subject>Hybrid Systems</dc:subject>
          <dc:subject>Verification</dc:subject>
          <dc:subject>Synthesis</dc:subject>
          <dc:description>There are several methods for the synthesis and analysis of hybrid&#13;
systems that require efficient algorithms and tools for satisfiability&#13;
checking. For analysis, e.g., bounded model checking describes&#13;
counterexamples of a fixed length by logical formulas, whose&#13;
satisfiability corresponds to the existence of such a counterexample.&#13;
As an example for parameter synthesis, we can state the correctness of&#13;
a parameterized system by a logical formula; the solution set of&#13;
the formula gives us possible safe instances of the parameters.&#13;
&#13;
For discrete systems, which can be described by propositional logic&#13;
formulas, SAT-solvers can be used for the satisfiability checks. For&#13;
hybrid systems, having mixed discrete-continuous behavior, SMT-solvers&#13;
are needed.  SMT-solving extends SAT with theories, and has its main&#13;
focus on linear arithmetic, which is sufficient to handle, e.g.,&#13;
linear hybrid systems.  However, there are only few solvers for&#13;
more expressive but still decidable logics like the&#13;
first-order theory of the reals with addition and multiplication --&#13;
real algebra. Since the synthesis and analysis of non-linear&#13;
hybrid systems requires such a powerful logic, we need efficient&#13;
SMT-solvers for real algebra. Our goal is to develop such an&#13;
SMT-solver for the real algebra, which is both complete and&#13;
efficient.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Erika Abraham and Florian Corzilius and Ulrich Loup and Thomas Sturm</dc:contributor>
          <dc:date>2010</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 10271, Verification over discrete-continuous boundaries (2010)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.10271.2</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-27907</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10271.2</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
