Towards Formally Verifiable WCET Analysis for a Functional Programming Language

Kevin Hammond Roy Dyckhoff Christian Ferdinand Reinhold Heckmann Martin Hofmann Steffen Jost Hans-Wolfgang Loidl Greg Michaelson Robert Pointon Norman Scaife 1 Jocelyn Serot 1 Andy Wallace
1 LASMEA - Laboratoire des sciences et matériaux pour l'électronique et d'automatique
Abstract : This paper describes ongoing work aimed at the construction of formal cost models and analyses to yield verifiable guarantees of resource usage in the context of real-time embedded systems. Our work is conducted in terms of the domain-specific language Hume, a language that combines functional programming for computations with finitestate automata for specifying reactive systems. We outline an approach in which high-level information derived from source-code analysis can be combined with worst-case execution time information obtained from high quality abstract interpretation of low-level binary code.
Keywords : WCET Functional programming Hume reactive systems
Type de document :
Communication dans un congrès
6th International Workshop on Worst-Case Execution Time Analysis, Jun 2006, Dresden, Germany. 2006
Liste complète des métadonnées
https://hal.archives-ouvertes.fr/hal-00103234
Contributeur : Jocelyn Serot <>
Soumis le : mardi 3 octobre 2006 - 17:03:10
Dernière modification le : jeudi 11 janvier 2018 - 06:17:20

Identifiants

  • HAL Id : hal-00103234, version 1

Collections

INSTITUT_PASCAL | PRES_CLERMONT

Citation

Kevin Hammond, Roy Dyckhoff, Christian Ferdinand, Reinhold Heckmann, Martin Hofmann, et al.. Towards Formally Verifiable WCET Analysis for a Functional Programming Language. 6th International Workshop on Worst-Case Execution Time Analysis, Jun 2006, Dresden, Germany. 2006. 〈hal-00103234〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

92

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD