Title
Towards formally verifiable resource bounds for real-time embedded systems
Abstract
This paper describes ongoing work aimed at the construction of formal cost models and analyses that are capable of producing verifiable guarantees of resource usage (space, time and ultimately power consumption) 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 finite-state automata for specifying reactive systems. We describe an approach in which high-level information derived from source-code analysis can be combined with worst-case execution time information obtained from abstract interpretation of low-level binary code. This abstract interpretation on the machine-code level is capable of dealing with complex architectural effects including cache and pipeline properties in an accurate way.
Year
DOI
Venue
2006
10.1145/1183088.1183093
SIGBED Review
Keywords
Field
DocType
finite state automata,reactive system,space time,worst case execution time,functional programming,domain specific language
Functional programming,Computer science,Cache,Abstract interpretation,Theoretical computer science,Real-time computing,Verifiable secret sharing,Distributed computing,Computation,Automaton,Binary code,Reactive system,Embedded system
Journal
Volume
Issue
Citations 
3
4
7
PageRank 
References 
Authors
0.55
36
3
Name
Order
Citations
PageRank
Kevin Hammond117517.81
Christian Ferdinand223821.61
Reinhold Heckmann3152994.73