Analyzing Loop Paths for Execution Time Estimation

  • Abhik Roychoudhury
  • Tulika Mitra
  • Hemendra Singh Negi
Conference paper

DOI: 10.1007/11604655_53

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3816)
Cite this paper as:
Roychoudhury A., Mitra T., Negi H.S. (2005) Analyzing Loop Paths for Execution Time Estimation. In: Chakraborty G. (eds) Distributed Computing and Internet Technology. ICDCIT 2005. Lecture Notes in Computer Science, vol 3816. Springer, Berlin, Heidelberg

Abstract

Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level due to the inherent difficulty in detecting infeasible paths in a program’s control flow graph. In this paper, we study the problem of accurately bounding the execution time of a program loop. This involves infeasible path detection followed by timing analysis. We employ constraint propagation methods to detect infeasible paths spanning across loop iterations. Our timing analysis is exact modulo the infeasible path information provided. Moreover, the analysis is efficient since it relies on memoization techniques to avoid exhaustive enumeration of all paths through a loop. The precision of our timing analysis is demonstrated on different benchmark programs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Abhik Roychoudhury
    • 1
  • Tulika Mitra
    • 1
  • Hemendra Singh Negi
    • 1
  1. 1.School of Computing, National University ofSingapore

Personalised recommendations