Worst-case execution times for a purely functional language

Armelle Bonenfant; Christian Ferdinand; Kevin Hammond; Reinhold Heckmann

doi:10.1007/978-3-540-74130-5_14

Worst-case execution times for a purely functional language

Armelle Bonenfant^*, Christian Ferdinand, Kevin Hammond, Reinhold Heckmann

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This paper provides guaranteed bounds on worst-case execution times for a strict, purely functional programming notation. Our approach involves combining time information obtained using a low-level commercial analyser with a high-level source-derived model to give worst-case execution time information. We validate our results using concrete timing information obtained using machine code fragments executing on a Renesas M32C/85 microcontroller development board. Our results confirm experimentally that our worst-case execution time model is a good predictor of execution times.

Original language	English
Title of host publication	Implementation and Application of Functional Languages
Subtitle of host publication	18th International Symposium, IFL 2006, Budapest, Hungary, September 4-6, 2006, Revised Selected Papers
Editors	Z Horvath, V Zsok, A Butterfield
Place of Publication	Berlin
Publisher	Springer-Verlag
Pages	235-252
Number of pages	18
ISBN (Electronic)	978-3-540-74130-5
ISBN (Print)	978-3-540-7412909
DOIs	https://doi.org/10.1007/978-3-540-74130-5_14
Publication status	Published - 2007
Event	18th International Symposium on Implementation and Application of Functional Languages - Budapest, Hungary Duration: 4 Sept 2006 → 6 Sept 2006

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer-Verlag Berlin
Volume	4449
ISSN (Print)	0302-9743

Conference

Conference	18th International Symposium on Implementation and Application of Functional Languages
Country/Territory	Hungary
City	Budapest
Period	4/09/06 → 6/09/06

Keywords

Behavior
Hume

Access to Document

10.1007/978-3-540-74130-5_14

EP/C001346/1: Generative Programming for Embedded Systems
Hammond, K. (PI)
EPSRC
1/01/05 → 31/12/07
Project: Standard

Cite this

Bonenfant, A., Ferdinand, C., Hammond, K., & Heckmann, R. (2007). Worst-case execution times for a purely functional language. In Z. Horvath, V. Zsok, & A. Butterfield (Eds.), Implementation and Application of Functional Languages: 18th International Symposium, IFL 2006, Budapest, Hungary, September 4-6, 2006, Revised Selected Papers (pp. 235-252). (Lecture Notes in Computer Science; Vol. 4449). Springer-Verlag. https://doi.org/10.1007/978-3-540-74130-5_14

Bonenfant, Armelle ; Ferdinand, Christian ; Hammond, Kevin et al. / Worst-case execution times for a purely functional language. Implementation and Application of Functional Languages: 18th International Symposium, IFL 2006, Budapest, Hungary, September 4-6, 2006, Revised Selected Papers. editor / Z Horvath ; V Zsok ; A Butterfield. Berlin : Springer-Verlag, 2007. pp. 235-252 (Lecture Notes in Computer Science).

@inproceedings{fa5b4be6bb5e499194912316fbaa790f,

title = "Worst-case execution times for a purely functional language",

abstract = "This paper provides guaranteed bounds on worst-case execution times for a strict, purely functional programming notation. Our approach involves combining time information obtained using a low-level commercial analyser with a high-level source-derived model to give worst-case execution time information. We validate our results using concrete timing information obtained using machine code fragments executing on a Renesas M32C/85 microcontroller development board. Our results confirm experimentally that our worst-case execution time model is a good predictor of execution times.",

keywords = "Behavior, Hume",

author = "Armelle Bonenfant and Christian Ferdinand and Kevin Hammond and Reinhold Heckmann",

year = "2007",

doi = "10.1007/978-3-540-74130-5_14",

language = "English",

isbn = "978-3-540-7412909",

series = "Lecture Notes in Computer Science",

publisher = "Springer-Verlag",

pages = "235--252",

editor = "Z Horvath and V Zsok and A Butterfield",

booktitle = "Implementation and Application of Functional Languages",

address = "Germany",

note = "18th International Symposium on Implementation and Application of Functional Languages ; Conference date: 04-09-2006 Through 06-09-2006",

}

Bonenfant, A, Ferdinand, C, Hammond, K & Heckmann, R 2007, Worst-case execution times for a purely functional language. in Z Horvath, V Zsok & A Butterfield (eds), Implementation and Application of Functional Languages: 18th International Symposium, IFL 2006, Budapest, Hungary, September 4-6, 2006, Revised Selected Papers. Lecture Notes in Computer Science, vol. 4449, Springer-Verlag, Berlin, pp. 235-252, 18th International Symposium on Implementation and Application of Functional Languages, Budapest, Hungary, 4/09/06. https://doi.org/10.1007/978-3-540-74130-5_14

Worst-case execution times for a purely functional language. / Bonenfant, Armelle; Ferdinand, Christian; Hammond, Kevin et al.
Implementation and Application of Functional Languages: 18th International Symposium, IFL 2006, Budapest, Hungary, September 4-6, 2006, Revised Selected Papers. ed. / Z Horvath; V Zsok; A Butterfield. Berlin: Springer-Verlag, 2007. p. 235-252 (Lecture Notes in Computer Science; Vol. 4449).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Worst-case execution times for a purely functional language

AU - Bonenfant, Armelle

AU - Ferdinand, Christian

AU - Hammond, Kevin

AU - Heckmann, Reinhold

PY - 2007

Y1 - 2007

N2 - This paper provides guaranteed bounds on worst-case execution times for a strict, purely functional programming notation. Our approach involves combining time information obtained using a low-level commercial analyser with a high-level source-derived model to give worst-case execution time information. We validate our results using concrete timing information obtained using machine code fragments executing on a Renesas M32C/85 microcontroller development board. Our results confirm experimentally that our worst-case execution time model is a good predictor of execution times.

AB - This paper provides guaranteed bounds on worst-case execution times for a strict, purely functional programming notation. Our approach involves combining time information obtained using a low-level commercial analyser with a high-level source-derived model to give worst-case execution time information. We validate our results using concrete timing information obtained using machine code fragments executing on a Renesas M32C/85 microcontroller development board. Our results confirm experimentally that our worst-case execution time model is a good predictor of execution times.

KW - Behavior

KW - Hume

U2 - 10.1007/978-3-540-74130-5_14

DO - 10.1007/978-3-540-74130-5_14

M3 - Conference contribution

SN - 978-3-540-7412909

T3 - Lecture Notes in Computer Science

SP - 235

EP - 252

BT - Implementation and Application of Functional Languages

A2 - Horvath, Z

A2 - Zsok, V

A2 - Butterfield, A

PB - Springer-Verlag

CY - Berlin

T2 - 18th International Symposium on Implementation and Application of Functional Languages

Y2 - 4 September 2006 through 6 September 2006

ER -

Bonenfant A, Ferdinand C, Hammond K, Heckmann R. Worst-case execution times for a purely functional language. In Horvath Z, Zsok V, Butterfield A, editors, Implementation and Application of Functional Languages: 18th International Symposium, IFL 2006, Budapest, Hungary, September 4-6, 2006, Revised Selected Papers. Berlin: Springer-Verlag. 2007. p. 235-252. (Lecture Notes in Computer Science). doi: 10.1007/978-3-540-74130-5_14

Worst-case execution times for a purely functional language

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Projects

EP/C001346/1: Generative Programming for Embedded Systems

Cite this