<?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-20T02:18:15Z</responseDate>
  <request identifier="700" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:700</identifier>
        <datestamp>2024-03-06T10:28: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>Formalizing On Chip Communications in a Functional Style</dc:title>
          <dc:creator>Schmaltz, Julien</dc:creator>
          <dc:creator>Borrione, Dominique</dc:creator>
          <dc:subject>SoC's</dc:subject>
          <dc:subject>communication architectures</dc:subject>
          <dc:subject>formal methods</dc:subject>
          <dc:subject>automated theorem proving</dc:subject>
          <dc:description>This paper presents a formal model for representing {it any} on-chip communication architecture.&#13;
This model is described mathematically by a function, named $mathit{GeNoC}$.&#13;
The correctness of $mathit{GeNoC}$ is expressed as a theorem, which states that messages emitted&#13;
on the architecture reach their expected destination without modification of their content.&#13;
The model identifies the key constituents common to {it all} communication architectures and their essential properties,&#13;
from which the proof of the $GeNoC$ theorem is deduced. &#13;
Each constituent is represented by a function which has no {it explicit} definition but is constrained&#13;
to satisfy the essential properties.&#13;
Thus, the validation of a {it particular} architecture is reduced to the proof that its concrete definition satisfies the essential properties.&#13;
In practice, the model has been defined in the logic of the ACL2 theorem proving system.&#13;
We define a methodology that yields a systematic approach to the validation of communication architectures &#13;
at a high level of abstraction. To validate our approach, we exhibit several architectures that constitute&#13;
concrete instances of the generic model $GeNoC$. Some of these applications come from industrial designs, such as&#13;
the AMBA AHB bus or the Octagon network from ST Microelectronics.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Julien Schmaltz and Dominique Borrione</dc:contributor>
          <dc:date>2006</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 3, Workshop on Trustworthy Software (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/OASIcs.TrustworthySW.2006.700</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-7000</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.TrustworthySW.2006.700</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>
