Skip to content

Research at St Andrews

Worst-case execution times for a purely functional language

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Author(s)

Armelle Bonenfant, Christian Ferdinand, Kevin Hammond, Reinhold Heckmann

School/Research organisations

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.

Close

Details

Original languageEnglish
Title of host publicationImplementation and Application of Functional Languages
Subtitle of host publication18th International Symposium, IFL 2006, Budapest, Hungary, September 4-6, 2006, Revised Selected Papers
EditorsZ Horvath, V Zsok, A Butterfield
Place of PublicationBerlin
PublisherSpringer-Verlag
Pages235-252
Number of pages18
ISBN (Electronic)978-3-540-74130-5
ISBN (Print)978-3-540-7412909
DOIs
Publication statusPublished - 2007
Event18th International Symposium on Implementation and Application of Functional Languages - Budapest, Hungary
Duration: 4 Sep 20066 Sep 2006

Publication series

NameLecture Notes in Computer Science
PublisherSpringer-Verlag Berlin
Volume4449
ISSN (Print)0302-9743

Conference

Conference18th International Symposium on Implementation and Application of Functional Languages
CountryHungary
CityBudapest
Period4/09/066/09/06

    Research areas

  • Behavior, Hume

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

ID: 64185179