Skip to main content

r-TuBound: Loop Bounds for WCET Analysis (Tool Paper)

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7180)

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-28717-6_34
  • Chapter length: 10 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   74.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-28717-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   99.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blanc, R., Henzinger, T.A., Hottelier, T., Kovács, L.: ABC: Algebraic Bound Computation for Loops. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol. 6355, pp. 103–118. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  2. Brummayer, R., Biere, A.: Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 174–177. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  3. Everest, G., van der Poorten, A., Shparlinski, I., Ward, T.: Recurrence Sequences. Mathematical Surveys and Monographs, vol. 104. American Mathematical Society (2003)

    Google Scholar 

  4. Gustafsson, J., Ermedahl, A., Sandberg, C., Lisper, B.: Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution. In: Proc. of RTSS, pp. 57–66 (2006)

    Google Scholar 

  5. Knoop, J., Kovacs, L., Zwirchmayr, J.: An Evaluation of WCET Analysis using Symbolic Loop Bounds. In: Proc. of WCET (2011)

    Google Scholar 

  6. Knoop, J., Kovacs, L., Zwirchmayr, J.: Symbolic Loop Bound Computation for WCET Analysis. In: Proc. of PSI, p. 116 (2011)

    Google Scholar 

  7. De Michiel, M., Bonenfant, A., Cassé, H., Sainrat, P.: Static Loop Bound Analysis of C Programs Based on Flow Analysis and Abstract Interpretation. In: RTCSA, pp. 161–166 (2008)

    Google Scholar 

  8. Schoeberl, M., Puffitsch, W., Pedersen, R.U., Huber, B.: Worst-case Execution Time Analysis for a Java Processor. Software: Practice and Experience 40/6, 507–542 (2010)

    CrossRef  Google Scholar 

  9. Prantl, A.: The Termite Library, http://www.complang.tuwien.ac.at/adrian/termite/Manual/

  10. Prantl, A., Schordan, M., Knoop, J.: TuBound - A Conceptually New Tool for WCET Analysis. In: Proc. of WCET, pp. 141–148 (2008)

    Google Scholar 

  11. von Hanxleden, R., et al.: The WCET Tool Challenge 2011: Report. In: Proc. of WCET (2011) (under journal submission)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Knoop, J., Kovács, L., Zwirchmayr, J. (2012). r-TuBound: Loop Bounds for WCET Analysis (Tool Paper). In: Bjørner, N., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2012. Lecture Notes in Computer Science, vol 7180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28717-6_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28717-6_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28716-9

  • Online ISBN: 978-3-642-28717-6

  • eBook Packages: Computer ScienceComputer Science (R0)