Linear Approximation of Execution-Time Constraints

Formal Aspects of Computing

Volumn 15, Issue 4, 2003, Pages 319-348

  Lermer, Karl ^a   Fidge, Colin J ^a   Hayes, Ian J ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

Automatic constraint determination; Control flow analysis; Real time program analysis; Timing prediction; Worst case and best case execution times

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; HIGH LEVEL LANGUAGES; LINEAR PROGRAMMING; OPTIMIZATION; REAL TIME SYSTEMS; SEMANTICS; THEOREM PROVING;

AUTOMATIC CONSTRAINT DETERMINATION; CONTROL-FLOW ANALYSIS; EXECUTION TIMES; TIMING PREDICTION;

CONSTRAINT THEORY;

EID: 0348170953     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00165-003-0019-0     Document Type: Conference Paper

References (39)

1. [Alt96] Altenbernd, P.: On the false path problem in hard real-time programs. In Proceeding of the 8th Euromicro Workshop on Real-Time Systems (WRTS), pages 102-107, 1996.
2. [Ble74] Bledsoe, W. W.: The SUP-INF method in Presburger arithmetic. Memo ATP-18, Mathematics Department, University of Texas at Austin, December 1974.
3. [Ble75] Bledsoe, W. W.: A new method for proving certain Presburger formulas. Advance Papers, 4th International Joint Conference on Artificial Intelligence, Tibilisi, Georgia, pages 15-21, September 1975.
4. [BaW93] Back, R.-J. R. and von Wright, J.: Statement inversion and strongest postcondition. Science of Computer Programming, 20:223-251, 1993.
5. [BaW98] Back, R.-J. and von Wright, J.: Refinement Calculus: A Systematic Introduction. Springer, 1998.
6. [Car89] Carré, B.: Program analysis and verification. In C. T. Sennett, editor, High-Integrity Software, chapter 8, pages 176-197. Plenum Press, 1989.
7. [CBW94] Chapman, R., Burns, A. and Wellings, A. J.: Integrated program proof and worst-case timing analysis of SPARK Ada. In ACM Workshop on Language, Compiler and Tool Support for Real-Time Systems. ACM Press, 1994.
8. [CBW96] Chapman, R., Burns, A. and Wellings, A.: Combining static worst-case timing analysis and program proof. Real-Time Systems, 11:145-171, 1996.
9. [Cha95] Chapman, R.: Static Timing Analysis and Program Proof. PhD thesis, Department of Computer Science, University of York, UK, 1995.
10. [Dij76] Dijkstra, E. W.: A Discipline of Programming. Prentice-Hall, 1976.
11. [DiS90] Dijkstra, E. W. and Scholten, C. S.: Predicate Calculus and Program Semantics. Springer, 1990.
12. [ErG97] Ermedahl, A. and Gustafsson, J.: Deriving annotations for tight calculation of execution time. In C. Lengauer, M. Griebel, and S. Gorlatch, editors, Euro-Par'97; Parallel Processing, volume 1300 of Lecture Notes in Computer Science, pages 1298-1307. Springer, 1997.
13. [FHW99] Fidge, C. J., Hayes, I. J. and Watson, G.: The deadline command. IEE Proceedings: Software, 146(2):104-111, April 1999. Special Issue on Real-Time Systems.
14. [GHF98] Grundon, S., Hayes, I.J. and Fidge, C. J.: Timing constraint analysis. In C. McDonald, editor, Computer Science '98: Proceedings of the 21st Australasian Computer Science Conference, pages 575-586. Springer, 1998.
15. [GuP99] Gunter, E. L. and Peled, D.: Path exploration tool. In W. R. Cleaveland, editor, Tools and Algorithms for the Construction and Analysis of Systems (TACAS/ETAPS'99), volume 1579 of Lecture Notes in Computer Science, pages 405-419. Springer, 1999.
16. [Gri81] Gries, D.: The Science of Programming. Springer, 1981.
17. [HFL01] Hayes, I. J., Fidge, C. J. and Lermer, K.: Semantic characterisation of dead control-flow paths. IEE Proceedings: Software, 148(6):175-186, 2001.
18. [HaU97] Hayes, I. J. and Utting, M.: Coercing real-time refinement: A transmitter. In D. J. Duke and A. S. Evans, editors, BCS-FACS Northern Formal Methods Workshop, 1996, Electronic Workshops in Computing. Springer, 1997. http://www.ewic.org.uk/ewic/.
19. [HaU01] Hayes, I. J. and Utting, M.: A sequential real-time refinement calculus. Acta Informatica, 37:385-448, 2001.
20. [LAH99] Lo Ko, Al-Yaqoubi, N., Healy, C., Ratliff, E., Arnold, R., Whalley, D. and Harmon, M.: Timing constraint specification and analysis. Software: Practice and Experience, 29(1):77-98, 1999.
21. [LBJ95] 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.: An accurate worst case timing analysis for RISC processors. IEEE Transactions on Software Engineering, 21(7):593-604, July 1995.
22. [LFH02a] Lermer, K., Fidge, C. J. and Hayes, I. J.: Extracting execution time constraints from real-time programs. Technical Report 02-30, Software Verification Reseach Centre, University of Queensland, October 2002.
23. [LFH02b] Lermer, K., Fidge, C. J. and Hayes, I. J.: A theory for execution time derivation in real-time programs. Technical Report 02-13, Software Verification Reseach Centre, University of Queensland, April 2002.
24. [LFH03] Lermer, K., Fidge, C. J. and Hayes, I. J.: Formal semantics for program paths. In J. Harland, editor, Computing: The Australian Theory Symposium (CATS) 2003, volume 78 of Electronic Notes in Theoretical Computer Science (ENTCS), pages 1-24. Elsevier, February 2003.
25. [LiG98] Liu, Y A. and Gomez, G.: Automatic accurate time-bound analysis for high-level languages. In F. Mueller and A. Bestavros, editors, Languages, Compilers, and Tools for Embedded Systems (LCTES'98), volume 1474 of Lecture Notes in Computer Science, pages 31-40. Springer, 1998.
26. [LKM98] Lim, S., Kim, J. and Min, S. L.: A worst case timing analysis technique for optimized programs. In IEEE Real-Time Computing Systems and Applications, 1998.
27. [LiM95] Li, Y.-T. and Malik, S.: Performance analysis of embedded software using implicit path enumeration. ACM SIGPLAN Notices, 30(11):88-98, 1995.
28. [LMW95] Yau-Tsun Li, Malik, S. and Wolfe, A.: Efficient microarchitecture modeling and path analysis for real-time software. In Proceeding of the 16th IEEE Real-Time Systems Symposium, pages 298-307. IEEE Computer Society Press, December 1995.
29. [LMW97] Li, Y.-T, Malik, S. and Wolfe, A.: Cinderella: a retargetable environment for performance analysis of real-time software. In C. Lengauer, M. Griebel, and S. Gorlatch, editors, Euro-Par'97: Parallel Processing, volume 1300 of Lecture Notes in Computer Science, pages 1308-15. Springer, 1997.
30. [LuS98] Lundqvist, T. and Stenström, P.: Integrating path and timing analysis using instruction-level simulation techniques. In F. Mueller and A. Bestavros, editors, Languages, Compilers, and Tools for Embedded Systems (LCTES'98), volume 1474 of Lecture Notes in Computer Science, pages 1-15. Springer, 1998.
31. [MaS98] Marriott, K. and Stuckey, P. J.: Programming with Constraints: An Introduction. MIT Press, 1998.
32. [Par92] Park, C. Y.: Predicting Deterministic Execution Times of Real-Time Programs. PhD thesis, University of Washington, Seattle, 1992.
33. [Par93] Park, C. Y.: Predicting program execution times by analyzing static and dynamic program paths. Real-Time Systems, 5:31-62, 1993.
34. [PuK89] Puschner, P. and Koza, C.: Calculating the maximum execution time of real-time programs. Journal of Real-Time Systems, 1(2):159-176, 1989.
35. [PaS90] Park, C. Y and Shaw, A. C.: Experiments with a program timing tool based on source-level timing schema. In Proceedings of the IEEE Real-Time Systems Symposium, pages 72-81, Florida, December 1990.
36. [PuS97] Puschner, P. P. and Schedl, A. V.: Computing maximum task execution times: a graph-based approach. Real-Time Systems, 13(1):67-91, 1997.
37. [StA00] Stappert, F. and Altenbernd, P.: Complete worst-case execution time analysis of straight-line hard real-time programs. Journal of Systems Architecture: the EURO MICRO Journal, 46(4):339-355, 2000.
38. [Sha89] Shaw, A. C.: Reasoning about time in higher-level language software. IEEE Transactions on Software Engineering, 15(7):875-889, 1989.
39. [Sho77] Shostak, R. E.: On the SUP-INF method for proving Presburger formulas. Journal of the ACM, 24(4):529-543, 1977.