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
StatePublished - 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

Related by author

  1. Automatically deriving cost models for structured parallel processes using hylomorphisms

    Castro, D., Hammond, K., Sarkar, S. & Alguwaifli, Y. Feb 2018 In : Future Generation Computer Systems. 79, Part 2, p. 653-668

    Research output: Contribution to journalArticle

  2. The Missing Link! A new skeleton for evolutionary multi-agent systems in Erlang

    Stypka, J., Turek, W., Byrski, A., Kisiel-Dorohinicki, M., Barwell, A. D., Brown, C. M., Hammond, K. & Janjic, V. Feb 2018 In : International Journal of Parallel Programming. 46, 1, p. 4-22 19 p.

    Research output: Contribution to journalArticle

  3. Proof-relevant Horn clauses for dependent type inference and term synthesis

    Farka, F., Komendantskya, E. & Hammond, K. 2018 In : Theory and Practice of Logic Programming. 18, 3-4, p. 484-501

    Research output: Contribution to journalArticle

  4. Type-based cost analysis for lazy functional languages

    Jost, S., Vasconcelos, P., Florido, M. & Hammond, K. Jun 2017 In : Journal of Automated Reasoning. 59, 1, p. 87-120 34 p.

    Research output: Contribution to journalArticle

ID: 64185179