<?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-07-22T08:34:56Z</responseDate>
  <request identifier="2334" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2334</identifier>
        <datestamp>2024-03-06T10:33:19Z</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>Deductive Verification of Continuous Dynamical Systems</dc:title>
          <dc:creator>Taly, Ankur</dc:creator>
          <dc:creator>Tiwari, Ashish</dc:creator>
          <dc:subject>Deductive Verification</dc:subject>
          <dc:subject>inductive invariants</dc:subject>
          <dc:subject>continuous and hybrid dynamical systems</dc:subject>
          <dc:subject>Theory of Reals</dc:subject>
          <dc:description>We define the notion of inductive invariants for&#13;
  continuous dynamical systems and use it&#13;
  to present inference rules for&#13;
  safety verification of polynomial continuous&#13;
  dynamical systems.&#13;
  We present two different sound and complete inference&#13;
  rules, but neither of these rules can be effectively applied.&#13;
  We then present several simpler and practical&#13;
  inference rules that are sound and relatively complete&#13;
  for different classes of inductive invariants.&#13;
  The simpler inference rules can be effectively checked when&#13;
  all involved sets are semi-algebraic.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Ankur Taly and Ashish Tiwari</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 4, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009)</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/LIPIcs.FSTTCS.2009.2334</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-23342</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2334</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
