<?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-22T10:45:45Z</responseDate>
  <request identifier="160" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:160</identifier>
        <datestamp>2024-03-06T11:06:04Z</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>Removing Cycles in Esterel Programs</dc:title>
          <dc:creator>Lukoschus, Jan</dc:creator>
          <dc:creator>von Hanxleden, Reinhard</dc:creator>
          <dc:subject>Synchronous Languages</dc:subject>
          <dc:subject>compilation</dc:subject>
          <dc:subject>cyclic circuits</dc:subject>
          <dc:subject>constructiveness</dc:subject>
          <dc:subject>Esterel</dc:subject>
          <dc:description>Programs written in the synchronous programming language Esterel may&#13;
contain statically cyclic dependencies of signals, which inhibits the&#13;
application of certain compilation approaches that rely on static&#13;
scheduling. This talk proposes an algorithm which, given a&#13;
constructive synchronous program, performs a semantics-preserving&#13;
source-level code transformation that removes cyclic signal&#13;
dependencies. The transformation exploits the monotonicity of&#13;
constructive programs, and is illustrated in the context of Esterel,&#13;
but should be applicable to other synchronous languages as well.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Jan Lukoschus and Reinhard von Hanxleden</dc:contributor>
          <dc:date>2005</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 4491, Synchronous Programming - SYNCHRON'04 (2005)</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.04491.4</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-1606</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04491.4</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>
