Access the full text.
Sign up today, get DeepDyve free for 14 days.
Stefan Bygde, Andreas Ermedahl, B. Lisper (2009)
An Efficient Algorithm for Parametric WCET Calculation2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Tao Wei, Jian Mao, Wei Zou, Yu Chen (2007)
A New Algorithm for Identifying Loops in Decompilation
Let t be the same tree as t but without the annotation on the root node and let (l , η ) = ω (t ). By definition of function eval
Antoine Colin, G. Bernat (2002)
Scope-tree: a program representation for symbolic worst-case execution time analysisProceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002
(2004)
lp_solve 5.5, open source (mixed-integer) linear programming
C. Ferdinand, Florian Martin, R. Wilhelm, M. Alt (1996)
Cache Behavior Prediction by Abstract Interpretation
Yau-Tsun Li, S. Malik, A. Wolfe (1995)
Efficient microarchitecture modeling and path analysis for real-time softwareProceedings 16th IEEE Real-Time Systems Symposium
D. Chu, J. Jaffar (2011)
Symbolic simulation on complicated loops for WCET Path Analysis2011 Proceedings of the Ninth ACM International Conference on Embedded Software (EMSOFT)
From item 2, eval(η , e, M ) = eval(η, e, n), which proves the lemma. To prove Theorem B.1, we consider each case of the inductive definition of the CFT separately
C. Ballabriga, H. Cassé, Christine Rochange, P. Sainrat (2010)
OTAWA: An Open Toolbox for Adaptive WCET Analysis
Stephan Wilhelm, Björn Wachter (2009)
Symbolic state traversal for WCET analysis
Chang Liu (2000)
Term rewriting and all thatACM SIGSOFT Softw. Eng. Notes, 25
We start by proving that if the property is valid for the result of ω, then it is also valid for the result of γ
Bilel Benhamamouch, B. Monsuez, Franck Védrine (2008)
Computing WCET using symbolic execution
S. Bygde, A. Ermedahl, B. Lisper (2009)
An efficient algorithm for parametric WCET calculationProceedings of the 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA’09). IEEE
Michel Berkelaar, Kjell Eikland, Peter Notebaert (2004)
lp_solve 5Retrieved from http://lpsolve.sourceforge.net/5.5/.
Yau-Tsun Li, S. Malik, A. Wolfe (1996)
Cache modeling for real-time software: beyond direct mapped instruction caches17th IEEE Real-Time Systems Symposium
C. Ballabriga, H. Cassé, M. Michiel (2009)
A Generic Framework for Blackbox Components in WCET Computation
Sung-Soo Lim, Young Bae, Gyu Jang, Byung-Do Rhee, S. Min, C. Park, Heonshik Shin, Kunsoo Park, Soo-Mook Moon, Chong-Sang Kim (1995)
An Accurate Worst Case Timing Analysis for RISC ProcessorsIEEE Trans. Software Eng., 21
Sibin Mohan, F. Mueller, William Hawkins, Michael Root, Christopher Healy, D. Whalley (2005)
ParaScale: exploiting parametric timing analysis for real-time schedulers and dynamic voltage scaling26th IEEE International Real-Time Systems Symposium (RTSS'05)
P. Feautrier (1988)
Parametric integer programmingRairo-operations Research, 22
A CFG TO CFT In this appendix
Y.-T. S. Li, S. Malik, A. Wolfe (1996)
Cache modeling for real-time software: Beyond direct mapped instruction cachesProceedings of the 17th IEEE Real-Time Systems Symposium. IEEE
and let (l, η) = γ (t ), (l 1 , η 1 ) = γ (t 1 ), and (l 2 , η 2 ) = γ
Johan Janssen, H. Corporaal (1997)
Making graphs reducible with controlled node splittingACM Trans. Program. Lang. Syst., 19
Paul Feautrier (1988)
Parametric integer programmingRAIRO Recherche Opérationnelle 22 (1988), 22
Franz Baader, Tobias Nipkow (1998)
Term Rewriting and All ThatCambridge University Press
(2002)
in the Ak Peters Series
Christine Rochange, P. Sainrat (2009)
A Context-Parameterized Model for Static Analysis of Execution TimesTrans. High Perform. Embed. Archit. Compil., 2
Khaled Yakdan, Sebastian Eschweiler, E. Gerhards-Padilla, Matthew Smith (2015)
No More Gotos: Decompilation Using Pattern-Independent Control-Flow Structuring and Semantic-Preserving Transformations
M. Hecht, J. Ullman (1972)
Flow graph reducibilityProceedings of the fourth annual ACM symposium on Theory of computing
Armin Biere, J. Knoop, L. Kovács, Jakob Zwirchmayr (2013)
The Auspicious Couple: Symbolic Execution and WCET Analysis
J. Cohen (2003)
Computer Algebra and Symbolic Computation: Mathematical Methods
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.
ACM Transactions on Embedded Computing Systems (TECS) – Association for Computing Machinery
Published: Dec 7, 2017
Keywords: Worst-case execution time
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.