Abstract
Parametric Worst-case execution time (WCET) analysis of a sequential program produces a formula that represents the worst-case execution time of the program, where parameters of the formula are user-defined parameters of the program (as loop bounds, values of inputs, or internal variables, etc).
In this article we propose a novel methodology to compute the parametric WCET of a program. Unlike other algorithms in the literature, our method is not based on Integer Linear Programming (ILP). Instead, we follow an approach based on the notion of symbolic computation of WCET formulae. After explaining our methodology and proving its correctness, we present a set of experiments to compare our method against the state of the art. We show that our approach dominates other parametric analyses and produces results that are very close to those produced by non-parametric ILP-based approaches, while keeping very good computing time.
- Franz Baader and Tobias Nipkow. 1998. Term Rewriting and All That. Cambridge University Press, New York, NY. Google Scholar
Digital Library
- Clément Ballabriga, Hugues Cassé, and Marianne De Michiel. 2009. A generic framework for blackbox components in WCET computation. In Proceedings of the 9th International Workshop on Worst-Case Execution Time Analysis (WCET’09), Vol. 10. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 1--12.Google Scholar
- Clément Ballabriga, Hugues Cassé, Christine Rochange, and Pascal Sainrat. 2010. OTAWA: An open toolbox for adaptive WCET analysis. In Software Technologies for Embedded and Ubiquitous Systems. Lecture Notes in Computer Science, Vol. 6399. Springer, Berlin, 35--46. Google Scholar
Digital Library
- Bilel Benhamamouch, Bruno Monsuez, and Franck Védrine. 2008. Computing WCET using symbolic execution. In Proceedings of the 2nd International Conference on Verification and Evaluation of Computer and Communication Systems (VECoS’08). British Computer Society, Swinton, UK, 128--139. Google Scholar
Digital Library
- Michel Berkelaar, Kjell Eikland, and Peter Notebaert. 2004. lp_solve 5.5, Open source (Mixed-Integer) Linear Programming system. Retrieved from http://lpsolve.sourceforge.net/5.5/.Google Scholar
- Armin Biere, Jens Knoop, Laura Kovács, and Jakob Zwirchmayr. 2013. The auspicious couple: Symbolic execution and WCET analysis. In Proceedings of the 13th International Workshop on Worst-Case Execution Time Analysis, Vol. 30. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 53--63.Google Scholar
- S. Bygde, A. Ermedahl, and B. Lisper. 2009. An efficient algorithm for parametric WCET calculation. In Proceedings of the 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA’09). IEEE, 13--21. Google Scholar
Digital Library
- Duc-Hiep Chu and Joxan Jaffar. 2011. Symbolic simulation on complicated loops for WCET path analysis. In Proceedings of the 9th ACM International Conference on Embedded Software (EMSOFT’11). ACM, New York, NY, 319--328. Google Scholar
Digital Library
- J. S. Cohen. 2002. Computer Algebra and Symbolic Computation: Mathematical Methods. Vol. 1 in the Ak Peters Series. Peters, Natick, MA. Google Scholar
Digital Library
- Antoine Colin and Guillem Bernat. 2002. Scope-tree: A program representation for symbolic worst-case execution time analysis. In Proceedings of the 14th Euromicro Conference on Real-Time Systems (ECRTS’02). IEEE, Washington, DC, 36:1--36:53. Google Scholar
Digital Library
- Paul Feautrier. 1988. Parametric integer programming. RAIRO Recherche Opérationnelle 22 (1988), 243--268.Google Scholar
Cross Ref
- Christian Ferdinand, Florian Martin, Reinhard Wilhelm, and Martin Alt. 1999. Cache behavior prediction by abstract interpretation. Sci. Comput. Program. 35, 2 (1999), 163--189. Google Scholar
Digital Library
- Matthew S. Hecht and Jeffrey D. Ullman. 1972. Flow graph reducibility. In Proceedings of the 4th Annual ACM Symposium on Theory of Computing. ACM, Denver, CO, 238--250. Google Scholar
Digital Library
- Johan Janssen and Henk Corporaal. 1997. Making graphs reducible with controlled node splitting. ACM Trans. Program. Lang. Syst. 19, 6 (Nov. 1997), 1031--1052. Google Scholar
Digital Library
- Y.-T. S. Li, Sharad Malik, and Andrew Wolfe. 1995. Efficient microarchitecture modeling and path analysis for real-time software. In Proceedings of the 16th IEEE Real-Time Systems Symposium. IEEE, 298--307. Google Scholar
Digital Library
- Y.-T. S. Li, S. Malik, and A. Wolfe. 1996. Cache modeling for real-time software: Beyond direct mapped instruction caches. In Proceedings of the 17th IEEE Real-Time Systems Symposium. IEEE, Washington, DC, 254--263. Google Scholar
Digital Library
- Sung-Soo Lim, Young Hyun Bae, Gyu Tae Jang, Byung-Do Rhee, Sang Lyul Min, Chang Yun Park, Heonshik Shin, Kunsoo Park, Soo-Mook Moon, and Chong Sang Kim. 1995. An accurate worst case timing analysis for RISC processors. IEEE Trans. Softw. Eng. 21, 7 (1995), 593--604. Google Scholar
Digital Library
- S. Mohan, F. Mueller, W. Hawkins, M. Root, C. Healy, and D. Whalley. 2005. ParaScale: Exploiting parametric timing analysis for real-time schedulers and dynamic voltage scaling. In Proceedings of the 26th IEEE International Real-Time Systems Symposium. IEEE, 232--242. Google Scholar
Digital Library
- Christine Rochange and Pascal Sainrat. 2009. A context-parameterized model for static analysis of execution times. In Transactions on High-Performance Embedded Architectures and Compilers II, Per Stenström (Ed.). Lecture Notes in Computer Science, Vol. 5470. Springer-Verlag, Berlin, 222--241. Google Scholar
Digital Library
- Tao Wei, Jian Mao, Wei Zou, and Yu Chen. 2007. A new algorithm for identifying loops in decompilation. In Proceedings of the 14th International Conference on Static Analysis (SAS’07). Springer-Verlag, Berlin, 170--183. Google Scholar
Digital Library
- Stephan Wilhelm and Björn Wachter. 2009. Symbolic state traversal for WCET analysis. In Proceedings of the 7th ACM International Conference on Embedded Software (EMSOFT’09). ACM, New York, NY, 137--146. Google Scholar
Digital Library
- Khaled Yakdan, Sebastian Eschweiler, Elmar Gerhards-Padilla, and Matthew Smith. 2015. No more gotos: Decompilation using pattern-independent control-flow structuring and semantics-preserving transformations. In Proceedings of the Network and Distributed System Security (NDSS’15), ISOC. Internet Society, San Diego, CA, USA.Google Scholar
Cross Ref
Index Terms
Symbolic WCET Computation
Recommendations
Calculating WCET estimates from timed traces
Real-time systems engineers face a daunting duty: they must ensure that each task in their system can always meet its deadline. To analyse schedulability they must know the worst-case execution time (WCET) of each task. However, determining exact WCETs ...
WCET squeezing: on-demand feasibility refinement for proven precise WCET-bounds
RTNS '13: Proceedings of the 21st International conference on Real-Time Networks and SystemsThe Worst-Case Execution Time (WCET) computed by a WCET analyzer is usually not tight, leaving a gap between the actual and the computed WCET of a program. In this article we present a novel on-demand WCET feasibility refinement technique, called WCET ...
Symbolic Cache Analysis for Real-Time Systems
Special issue on worst-case execution-time analysisCaches impose a major problem for predicting execution times of real-time systems since the cache behavior depends on the history of previous memory references. Too pessimistic assumptions on cache hits can obtain worst-case execution time estimates that ...






Comments