Verifying min-plus Computations with Coq (extended version with appendix) - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

Verifying min-plus Computations with Coq (extended version with appendix)

Abstract

Network-calculus is a theory that bounds delays in embedded networks such as AFDX networks used in modern airplanes. Effective computations rely on operators from the min-plus algebra on real functions. Algorithms on specific subsets can be found in the literature. Such algorithms and related implementations are however complicated. Instead of redeveloping a provably correct implementation, we take an existing implementation as an oracle and propose a Coq based verifier.
Fichier principal
Vignette du fichier
extended_version_HAL.pdf (497.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03176024 , version 1 (25-03-2021)

Identifiers

  • HAL Id : hal-03176024 , version 1

Cite

Lucien Rakotomalala, Pierre Roux, Marc Boyer. Verifying min-plus Computations with Coq (extended version with appendix). 13th NASA Formal Methods Symposium (NFM 2021), May 2021, virtual, United States. ⟨hal-03176024⟩

Collections

ONERA
110 View
181 Download

Share

Gmail Facebook X LinkedIn More