Worst-case execution times for a purely functional language

  • Authors:
  • Armelle Bonenfant;Christian Ferdinand;Kevin Hammond;Reinhold Heckmann

  • Affiliations:
  • School of Computer Science, University of St Andrews, St Andrews, UK;AbsInt GmbH, Saarbrücken, Germany;School of Computer Science, University of St Andrews, St Andrews, UK;AbsInt GmbH, Saarbrücken, Germany

  • Venue:
  • IFL'06 Proceedings of the 18th international conference on Implementation and application of functional languages
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.