WCET of OCaml Bytecode on Microcontrollers: An Automated Method and Its Formalisation

Abstract : Considering the bytecode representation of a program written in a high-level programming language enables portability of its execution as well as a factorisation of various possible analyses of this program. In this article, we present a method for computing the worst-case execution time (WCET) of an embedded bytecode program fit to run on a microcontroller. Due to the simple memory model of such a device, this automated WCET computation relies only on a control-flow analysis of the program, and can be adapted to multiple models of microcontrollers. This method evaluates the bytecode program using concrete as well as partially unknown values, in order to estimate its longest execution time. We present a software tool, based on this method, that computes the WCET of a synchronous embedded OCaml program. One key contribution of this article is a mechanically checked formalisation of the aforementioned method over an idealised bytecode language, as well as its proof of correctness.
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02340245
Contributor : Steven Varoumas <>
Submitted on : Wednesday, October 30, 2019 - 5:19:12 PM
Last modification on : Tuesday, January 28, 2020 - 9:53:13 AM

File

OASIcs-WCET-2019-5.pdf
Files produced by the author(s)

Identifiers

Citation

Steven Varoumas, Tristan Crolard. WCET of OCaml Bytecode on Microcontrollers: An Automated Method and Its Formalisation. 19th International Workshop on Worst-Case Execution Time Analysis (WCET 2019), Jul 2019, Stuttgart, Germany. pp.5:1--5:12, ⟨10.4230/OASIcs.WCET.2019.5⟩. ⟨hal-02340245⟩

Share

Metrics

Record views

37

Files downloads

16