InforLorV4, Hal, Corpus, bibRecord, 004E10

Towards Certifying Network Calculus

Identifieur interne : 004E10 ( Hal/Corpus ); précédent : 004E09; suivant : 004E11

Towards Certifying Network Calculus

Auteurs : Etienne Mabille ; Marc Boyer ; Loic Féjoz ; Stephan Merz

Source :

RBID : Hal:hal-00904796

Abstract

Network Calculus (NC) is an established theory for determining bounds on message delays and for dimensioning buffers in the design of networks for embedded systems. It is supported by academic and industrial tool sets and has been widely used, including for the design and certification of the Airbus A380 AFDX backbone. However, while the theory of NC is generally well understood, results produced by existing tools have to be trusted. We report here on work towards using the interactive proof assistant Isabelle/HOL for certifying the results of NC computations. In a nutshell, the NC tool outputs a trace of the calculations it performs, as well as their results. The validity of the trace is then established offline by a trusted checker.

Url:

https://hal.inria.fr/hal-00904796

DOI: 10.1007/978-3-642-39634-2_37

Links to Exploration step

Hal:hal-00904796

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Towards Certifying Network Calculus</title>
<author><name sortKey="Mabille, Etienne" sort="Mabille, Etienne" uniqKey="Mabille E" first="Etienne" last="Mabille">Etienne Mabille</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-104899" status="VALID"><orgName>Realtime-at-Work</orgName>
<orgName type="acronym">RTaW</orgName>
<desc><address><addrLine>INRIA, Espace Transfert, 615, rue du Jardin Botanique, 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.realtimeatwork.com</ref>
</desc>
<listRelation><relation active="#struct-366885" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-366885" type="direct"><org type="institution" xml:id="struct-366885" status="INCOMING"><orgName>RealTime-at-Work</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Boyer, Marc" sort="Boyer, Marc" uniqKey="Boyer M" first="Marc" last="Boyer">Marc Boyer</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-252057" status="VALID"><orgName>ONERA - The French Aerospace Lab</orgName>
<orgName type="acronym">Toulouse</orgName>
<desc><address><addrLine>F-31055 Toulouse</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.onera.fr</ref>
</desc>
<listRelation><relation active="#struct-300024" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300024" type="direct"><org type="institution" xml:id="struct-300024" status="VALID"><orgName>ONERA</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Fejoz, Loic" sort="Fejoz, Loic" uniqKey="Fejoz L" first="Loic" last="Féjoz">Loic Féjoz</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-104899" status="VALID"><orgName>Realtime-at-Work</orgName>
<orgName type="acronym">RTaW</orgName>
<desc><address><addrLine>INRIA, Espace Transfert, 615, rue du Jardin Botanique, 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.realtimeatwork.com</ref>
</desc>
<listRelation><relation active="#struct-366885" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-366885" type="direct"><org type="institution" xml:id="struct-366885" status="INCOMING"><orgName>RealTime-at-Work</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Merz, Stephan" sort="Merz, Stephan" uniqKey="Merz S" first="Stephan" last="Merz">Stephan Merz</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-107895" status="VALID"><idno type="RNSR">201020692C</idno>
<orgName>Modeling and Verification of Distributed Algorithms and Systems</orgName>
<orgName type="acronym">VERIDIS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/veridis</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423084" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName>
<orgName type="acronym">LORIA - FM</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-00904796</idno>
<idno type="halId">hal-00904796</idno>
<idno type="halUri">https://hal.inria.fr/hal-00904796</idno>
<idno type="url">https://hal.inria.fr/hal-00904796</idno>
<idno type="doi">10.1007/978-3-642-39634-2_37</idno>
<date when="2013-07-22">2013-07-22</date>
<idno type="wicri:Area/Hal/Corpus">004E10</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Towards Certifying Network Calculus</title>
<author><name sortKey="Mabille, Etienne" sort="Mabille, Etienne" uniqKey="Mabille E" first="Etienne" last="Mabille">Etienne Mabille</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-104899" status="VALID"><orgName>Realtime-at-Work</orgName>
<orgName type="acronym">RTaW</orgName>
<desc><address><addrLine>INRIA, Espace Transfert, 615, rue du Jardin Botanique, 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.realtimeatwork.com</ref>
</desc>
<listRelation><relation active="#struct-366885" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-366885" type="direct"><org type="institution" xml:id="struct-366885" status="INCOMING"><orgName>RealTime-at-Work</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Boyer, Marc" sort="Boyer, Marc" uniqKey="Boyer M" first="Marc" last="Boyer">Marc Boyer</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-252057" status="VALID"><orgName>ONERA - The French Aerospace Lab</orgName>
<orgName type="acronym">Toulouse</orgName>
<desc><address><addrLine>F-31055 Toulouse</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.onera.fr</ref>
</desc>
<listRelation><relation active="#struct-300024" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300024" type="direct"><org type="institution" xml:id="struct-300024" status="VALID"><orgName>ONERA</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Fejoz, Loic" sort="Fejoz, Loic" uniqKey="Fejoz L" first="Loic" last="Féjoz">Loic Féjoz</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-104899" status="VALID"><orgName>Realtime-at-Work</orgName>
<orgName type="acronym">RTaW</orgName>
<desc><address><addrLine>INRIA, Espace Transfert, 615, rue du Jardin Botanique, 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.realtimeatwork.com</ref>
</desc>
<listRelation><relation active="#struct-366885" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-366885" type="direct"><org type="institution" xml:id="struct-366885" status="INCOMING"><orgName>RealTime-at-Work</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Merz, Stephan" sort="Merz, Stephan" uniqKey="Merz S" first="Stephan" last="Merz">Stephan Merz</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-107895" status="VALID"><idno type="RNSR">201020692C</idno>
<orgName>Modeling and Verification of Distributed Algorithms and Systems</orgName>
<orgName type="acronym">VERIDIS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/veridis</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423084" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName>
<orgName type="acronym">LORIA - FM</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</analytic>
<idno type="DOI">10.1007/978-3-642-39634-2_37</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Network Calculus (NC) is an established theory for determining bounds on message delays and for dimensioning buffers in the design of networks for embedded systems. It is supported by academic and industrial tool sets and has been widely used, including for the design and certification of the Airbus A380 AFDX backbone. However, while the theory of NC is generally well understood, results produced by existing tools have to be trusted. We report here on work towards using the interactive proof assistant Isabelle/HOL for certifying the results of NC computations. In a nutshell, the NC tool outputs a trace of the calculations it performs, as well as their results. The validity of the trace is then established offline by a trusted checker.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Towards Certifying Network Calculus</title>
<author role="aut"><persName><forename type="first">Etienne</forename>
<surname>Mabille</surname>
</persName>
<email></email>
<idno type="halauthor">943564</idno>
<orgName ref="#struct-376274"></orgName>
<affiliation ref="#struct-104899"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Marc</forename>
<surname>Boyer</surname>
</persName>
<email>marc.boyer@onera.fr</email>
<idno type="idhal">marc-boyer-onera</idno>
<idno type="halauthor">561297</idno>
<orgName ref="#struct-300024"></orgName>
<affiliation ref="#struct-252057"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Loic</forename>
<surname>Féjoz</surname>
</persName>
<email></email>
<idno type="halauthor">943565</idno>
<orgName ref="#struct-376274"></orgName>
<affiliation ref="#struct-104899"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Stephan</forename>
<surname>Merz</surname>
</persName>
<email>Stephan.Merz@loria.fr</email>
<ptr type="url" target="http://www.loria.fr/~merz/"></ptr>
<idno type="halauthor">663400</idno>
<affiliation ref="#struct-107895"></affiliation>
</author>
<editor role="depositor"><persName><forename>Stephan</forename>
<surname>Merz</surname>
</persName>
<email>Stephan.Merz@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2013-11-15 11:27:37</date>
<date type="whenModified">2015-09-22 01:12:18</date>
<date type="whenReleased">2013-11-18 14:53:00</date>
<date type="whenProduced">2013-07-22</date>
<date type="whenEndEmbargoed">2013-11-15</date>
<ref type="file" target="https://hal.inria.fr/hal-00904796/document"><date notBefore="2013-11-15"></date>
</ref>
<ref type="file" subtype="author" n="1" target="https://hal.inria.fr/hal-00904796/file/final.pdf"><date notBefore="2013-11-15"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="104076"><persName><forename>Stephan</forename>
<surname>Merz</surname>
</persName>
<email>Stephan.Merz@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-00904796</idno>
<idno type="halUri">https://hal.inria.fr/hal-00904796</idno>
<idno type="halBibtex">mabille:hal-00904796</idno>
<idno type="halRefHtml">Sandrine Blazy and Christine Paulin-Mohring and David Pichardie. ITP - 4th International Conference on Interactive Theorem Proving, Jul 2013, Rennes, France. Springer, 7998, pp.484-489, 2013, Lecture Notes in Computer Science; Interactive Theorem Proving. <10.1007/978-3-642-39634-2_37></idno>
<idno type="halRef">Sandrine Blazy and Christine Paulin-Mohring and David Pichardie. ITP - 4th International Conference on Interactive Theorem Proving, Jul 2013, Rennes, France. Springer, 7998, pp.484-489, 2013, Lecture Notes in Computer Science; Interactive Theorem Proving. <10.1007/978-3-642-39634-2_37></idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="ONERA">ONERA - Office National d'Études et de Recherches Aérospatiales</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Towards Certifying Network Calculus</title>
<author role="aut"><persName><forename type="first">Etienne</forename>
<surname>Mabille</surname>
</persName>
<idno type="halAuthorId">943564</idno>
<orgName ref="#struct-376274"></orgName>
<affiliation ref="#struct-104899"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Marc</forename>
<surname>Boyer</surname>
</persName>
<email>marc.boyer@onera.fr</email>
<idno type="idHal">marc-boyer-onera</idno>
<idno type="halAuthorId">561297</idno>
<orgName ref="#struct-300024"></orgName>
<affiliation ref="#struct-252057"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Loic</forename>
<surname>Féjoz</surname>
</persName>
<idno type="halAuthorId">943565</idno>
<orgName ref="#struct-376274"></orgName>
<affiliation ref="#struct-104899"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Stephan</forename>
<surname>Merz</surname>
</persName>
<email>Stephan.Merz@loria.fr</email>
<ptr type="url" target="http://www.loria.fr/~merz/"></ptr>
<idno type="halAuthorId">663400</idno>
<affiliation ref="#struct-107895"></affiliation>
</author>
</analytic>
<monogr><meeting><title>ITP - 4th International Conference on Interactive Theorem Proving</title>
<date type="start">2013-07-22</date>
<date type="end">2013-07-26</date>
<settlement>Rennes</settlement>
<country key="FR">France</country>
</meeting>
<editor>Sandrine Blazy and Christine Paulin-Mohring and David Pichardie</editor>
<imprint><publisher>Springer</publisher>
<biblScope unit="serie"></biblScope>
<biblScope unit="volume">7998</biblScope>
<biblScope unit="pp">484-489</biblScope>
<date type="datePub">2013-07</date>
</imprint>
</monogr>
<idno type="doi">10.1007/978-3-642-39634-2_37</idno>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><classCode scheme="acm" n="D.2.4.2"></classCode>
<classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">Network Calculus (NC) is an established theory for determining bounds on message delays and for dimensioning buffers in the design of networks for embedded systems. It is supported by academic and industrial tool sets and has been widely used, including for the design and certification of the Airbus A380 AFDX backbone. However, while the theory of NC is generally well understood, results produced by existing tools have to be trusted. We report here on work towards using the interactive proof assistant Isabelle/HOL for certifying the results of NC computations. In a nutshell, the NC tool outputs a trace of the calculations it performs, as well as their results. The validity of the trace is then established offline by a trusted checker.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004E10 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 004E10 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Corpus
   |type=    RBID
   |clé=     Hal:hal-00904796
   |texte=   Towards Certifying Network Calculus
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Towards Certifying Network Calculus

Towards Certifying Network Calculus

Source :

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri