10.4230/OASICS.WCET.2006.677
Hammond, Kevin
Kevin
Hammond
Ferdinand, Christian
Christian
Ferdinand
Heckmann, Reinhold
Reinhold
Heckmann
Dyckhoff, Roy
Roy
Dyckhoff
Hofman, Martin
Martin
Hofman
Jost, Steffen
Steffen
Jost
Loidl, Hans-Wolfgang
Hans-Wolfgang
Loidl
Michaelson, Greg
Greg
Michaelson
Pointon, Robert
Robert
Pointon
Scaife, Norman
Norman
Scaife
Sérot, Jocelyn
Jocelyn
Sérot
Wallace, Andy
Andy
Wallace
Towards Formally Verifiable WCET Analysis for a Functional Programming Language
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2006
Article
Worst-case execution time
functional programming
Hume
cost model
asynchronous
finite state machine
Mueller, Frank
Frank
Mueller
2006
2006-08-23
2006-08-23
2006-08-23
en
urn:nbn:de:0030-drops-6773
10.4230/OASIcs.WCET.2006
978-3-939897-03-3
2190-6807
10.4230/OASIcs.WCET.2006
OASIcs, Volume 4, WCET 2006
6th International Workshop on Worst-Case Execution Time Analysis (WCET'06)
2012
4
12
1
6
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Mueller, Frank
Frank
Mueller
2190-6807
Open Access Series in Informatics (OASIcs)
2006
4
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
6 pages
277674 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
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.
OASIcs, Vol. 4, 6th International Workshop on Worst-Case Execution Time Analysis (WCET'06), pages 1-6