<?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-22T06:37:41Z</responseDate>
  <request identifier="493" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:493</identifier>
        <datestamp>2024-03-06T11:06:34Z</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>And-Or Dependence Graphs for Slicing Statecharts</dc:title>
          <dc:creator>Fox, Chris</dc:creator>
          <dc:creator>Luangsodsai, Arthorn</dc:creator>
          <dc:subject>Slicing</dc:subject>
          <dc:subject>statecharts</dc:subject>
          <dc:subject>And-Or depdence graphs</dc:subject>
          <dc:subject>interference</dc:subject>
          <dc:subject>conditioning</dc:subject>
          <dc:description>The construction of an And-Or dependence graphs is illustrated, &#13;
and its use in slicing statecharts is described.  The additional &#13;
structure allows for more precise slices to be constructed in the &#13;
event of additional information, such as may be provided by &#13;
static analysis and model checking, and with constraints on the &#13;
global state and external events.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Chris Fox and Arthorn Luangsodsai</dc:contributor>
          <dc:date>2006</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 5451, Beyond Program Slicing (2006)</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.05451.5</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-4932</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05451.5</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>
