
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Mark Bartlett, Iain Bate, Dimitar Kazakov, "Accurate Determination of Loop Iterations for WorstCase Execution Time Analysis," IEEE Transactions on Computers, vol. 59, no. 11, pp. 15201532, November, 2010.  
BibTex  x  
@article{ 10.1109/TC.2010.59, author = {Mark Bartlett and Iain Bate and Dimitar Kazakov}, title = {Accurate Determination of Loop Iterations for WorstCase Execution Time Analysis}, journal ={IEEE Transactions on Computers}, volume = {59}, number = {11}, issn = {00189340}, year = {2010}, pages = {15201532}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2010.59}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Accurate Determination of Loop Iterations for WorstCase Execution Time Analysis IS  11 SN  00189340 SP1520 EP1532 EPD  15201532 A1  Mark Bartlett, A1  Iain Bate, A1  Dimitar Kazakov, PY  2010 KW  Realtime and embedded systems KW  performance of systems KW  testing and debugging KW  deduction and theorem proving KW  knowledge processing. VL  59 JA  IEEE Transactions on Computers ER   
[1] R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing, D. Whalley, G. Bernat, C. Ferdinand, R. Heckmann, T. Mitra, F. Mueller, I. Puaut, P. Puschner, J. Staschulat, and P. Stenström, "The WorstCase ExecutionTime Problem—Overview of Methods and Survey of Tools," Trans. Embedded Computing Systems, vol. 7, no. 3, pp. 153, 2008.
[2] R. Chapman, "Static Timing Analysis and Program Proof," PhD dissertation, Univ. of York, 1995.
[3] C. Cullmann and F. Martin, "DataFlow Based Detection of Loop Bounds," Proc. Seventh Int'l Workshop Worst Case Execution Time (WCET) Analysis, C. Rochange, ed., 2007.
[4] C. Park and A. Shaw, "A Source Level Tool for Predicting Deterministic Execution Times of Programs," Technical Report 890902, Dept. of Computer Science and Eng., Univ. of Washington, 1989.
[5] J. Gustafsson, A. Ermedahl, C. Sandberg, and B. Lisper, "Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution," Proc. 27th IEEE Int'l RealTime Systems Symp. (RTSS '06), pp. 5766, 2006.
[6] M. de Michiel, A. Bonenfant, H. Casse, and P. Sainrat, "Static Loop Bound Analysis of C Programs Based on Flow Analysis and Abstract Interpretation," Proc. 14th IEEE Int'l Conf. Embedded and RealTime Computing Systems and Applications (RTCSA '08), pp. 161166, 2008.
[7] M. Bartlett, I. Bate, and D. Kazakov, "Guaranteed Loop Bound Identification from Program Traces for WCET," Proc. 15th IEEE RealTime and Embedded Technology and Applications Symp. (RTAS '09), pp. 287294, Apr. 2009.
[8] R. Stansifer, "Presburger's Article on Integer Arithmetic: Remarks and Translation," Technical Report TR84639, Dept. of Computer Science, Cornell Univ., 1984.
[9] E. Vivancos, C. Healy, F. Mueller, and D. Whalley, "Parametric Timing Analysis," Proc. ACM SIGPLAN Workshop Languages, Compilers and Tools for Embedded Systems (LCTES '01), J. Fenwick and C. Norris, eds., pp. 8893, 2001.
[10] S. Bygde, A. Ermedahl, and B. Lisper, "An Efficient Algorithm for Parametric WCET Calculation," Proc. 16th Int'l Conf. RealTime Computing Systems and Applications (RTCSA '09), P. Kellenberger, ed., pp. 1321, 2009.
[11] E.J. Weyuker, "Axiomatizing Software Test Data Adequacy," IEEE Trans. Software Eng., vol. 12, no. 12, pp. 11281138, Dec. 1986.
[12] J. Wegener, H. Sthamer, B.F. Jones, and D.E. Eyres, "Testing RealTime Systems Using Genetic Algorithms," Software Quality J., vol. 6, pp. 127135, 1997.
[13] R. Kirner, I. Wenzel, B. Rieder, and P. Puschner, "Using Measurements as a Complement to Static WorstCase Execution Time Analysis," Intelligent Systems at the Service of Mankind, vol. 2, UBooks Verlag, 2005.
[14] P. Puschner and C. Koza, "Calculating the Maximum Execution Time of RealTime Programs," RealTime Systems, vol. 1, no. 2, pp. 159176, 1989.
[15] C.Y. Park, "Predicting Program Execution Times by Analyzing Static and Dynamic Program Paths," RealTime Systems, vol. 5, no. 1, pp. 3162, 1993.
[16] A. Ermedahl and J. Gustafsson, "Deriving Annotations for Tight Calculation of Execution Time," Proc. Third Int'l EuroPar Conf. Parallel Processing (EuroPar '97), pp. 12981307, 1997.
[17] C. Healy, V. Rustagi, D. Whalley, and R. Van Engelen, "Supporting Timing Analysis by Automatic Bounding of Loop Iterations," RealTime Systems, vol. 18, pp. 121148, 2000.
[18] D. Sehlberg, A. Ermedahl, J. Gustafsson, B. Lisper, and S. Wiegratz, "Static WCET Analysis of RealTime TaskOriented Code in Vehicle Control Systems," Proc. Second Int'l Symp. Leveraging Applications of Formal Methods, Verification and Validation (ISOLA '06), pp. 212219, 2006.
[19] R. Wilhelm, D. Grund, J. Reineke, M. Schlickling, M. Pister, and C. Ferdinand, "Memory Hierarchies, Pipelines, and Buses for Future Architectures in TimeCritical Embedded Systems," IEEE Trans. ComputerAided Design of Integrated Circuits and Systems, vol. 28, no. 7, pp. 966978, July 2009.
[20] X. Li, A. Roychoudhury, and T. Mitra, "Modeling OutofOrder Processors for Software Timing Analysis," Proc. 25th IEEE Int'l RealTime Systems Symp., pp. 92103, 2004.
[21] D. Kazakov and I. Bate, "New Directions in WorstCase Execution Time Analysis," Proc. 2008 IEEE World Congress Computational Intelligence, 2008.
[22] B. Lisper and M. Santos, "Model Identification for WCET Analysis," Proc. 15th IEEE RealTime and Embedded Technology and Applications Symp. (RTAS '09), Apr. 2009.
[23] A. Ermedahl, C. Sandberg, J. Gustafsson, S. Bygde, and B. Lisper, "Loop Bound Analysis Based on a Combination of Program Slicing Abstract Interpretation and Invariant Analysis," Proc. Seventh Int'l Workshop Worst Case Execution Time (WCET), C. Rochange, ed., 2007.
[24] N. Wilde and D. Knudson, "Understanding Embedded Software through Instrumentation: Preliminary Results from a Survey of Techniques," technical report, Dept. of Computer Science, Univ. of Florida, 1999.
[25] E. Kligerman and A.D. Stoyenko, "RealTime Euclid: A Language for Reliable RealTime Systems," IEEE Trans. Software Eng., vol. 12, no. 9, pp. 941949, Sept. 1986.
[26] N. Tawbi, "Estimation of Nested Loops Execution Time by Integer Arithmetic in Convex Polyhedra," Proc. Eighth Int'l Symp. Parallel Processing, pp. 217221, 1994.
[27] W. Pugh, "Counting Solutions to Presburger Formulas: How and Why," Proc. SIGPLAN Conf. Programming Language Design and Implementation, pp. 121134, 1994.
[28] P. Clauss, "Counting Solutions to Linear and Nonlinear Constraints through Ehrhart Polynomials: Applications to Analyze and Transform Scientific Programs," Proc. Int'l Conf. Supercomputing, pp. 278285, 1996.
[29] D.E. Knuth, "Johann Faulhaber and Sums of Powers," Math. Computation, vol. 61, no. 203, pp. 277294, 1993.
[30] S. Muggleton, "Learning from Positive Data," Proc. Sixth Int'l Workshop Inductive Logic Programming (ILP '96), Aug. 1997.
[31] A. Srinivasan, The Aleph Manual. Computing Laboratory, Oxford Univ, 2000.
[32] M. Bartlett, I. Bate, and D. Kazakov, "Challenges in Relational Learning for RealTime Systems Applications," Proc. 18th Int'l Conf. Inductive Logic Programming, pp. 4258, 2008.
[33] D. Kazakov and I. Bate, "Towards New Methods for Developing RealTime Systems: Automatically Deriving Loop Bounds Using Machine Learning," Proc. 11th IEEE Int'l Conf. Emerging Technologies and Factory Automation (ETFA), 2006.
[34] A. Betts and G. Bernat, "TreeBased WCET Analysis on Instrumentation Point Graphs," Proc. Ninth IEEE Int'l Symp. Object and ComponentOriented RealTime Distributed Computing (ISORC '06), pp. 558565, 2006.