Verifying min-plus Computations with Coq (extended version with appendix)
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)