论文信息 - r-TuBound: Loop Bounds for WCET Analysis (Tool Paper)

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

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.

Jens Knoop | Laura Kovács | Jakob Zwirchmayr

[1] Benedikt Huber,et al. Worst‐case execution time analysis for a Java processor , 2010, Softw. Pract. Exp..

[2] Jens Knoop,et al. Symbolic Loop Bound Computation for WCET Analysis , 2011, Ershov Memorial Conference.

[3] Thomas A. Henzinger,et al. ABC: Algebraic Bound Computation for Loops , 2010, LPAR.

[4] Jan Gustafsson,et al. Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[5] Rajeev Alur,et al. A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[6] Pascal Sainrat,et al. Static Loop Bound Analysis of C Programs Based on Flow Analysis and Abstract Interpretation , 2008, 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications.

[7] Heung Seok Chae,et al. An adaptive load balancing management technique for RFID middleware systems , 2010 .

[8] Armin Biere,et al. Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays , 2009, TACAS.

[9] Jens Knoop,et al. An Evaluation of WCET Analysis using Symbolic Loop Bounds , 2011, WCET 2011.

[10] Frank Wolter,et al. Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[11] Jan Gustafsson,et al. WCET TOOL CHALLENGE 2011: REPORT , 2011, WCET 2011.

[12] Igor E. Shparlinski,et al. Arithmetic structure of recurrence sequences , 2003 .