r-TuBound: loop bounds for WCET analysis (tool paper)

  • Authors:
  • Jens Knoop;Laura Kovács;Jakob Zwirchmayr

  • Affiliations:
  • TU Vienna, Austria;TU Vienna, Austria;TU Vienna, Austria

  • Venue:
  • LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe the structure and the usage of a new software tool, called r-TuBound, for deriving symbolic loop iteration bounds in the worst-case execution time (WCET) analysis of programs. r-TuBound implements algorithms for pattern-based recurrence solving and program flow refinement, and it was successfully tested on a wide range of examples. The purpose of this article is to illustrate what r-TuBound can do and how it can be used to derive the WCET of programs.