Abstract
Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. This paper explains the principles of our Timing-Analysis methods, which use Abstract Interpretation to predict the system’s behavior on the underlying processor’s components and use Integer Linear Programming to determine a worst-case path through the program. Under the assumption that non-trivial systems are subject of the analyses, exhaustive analyses can not be performed and some uncertainty about the system’s behavior remains. Uncertainty, i.e., lack of information about a system’s execution states incurs cost in terms of precision of the upper and lower bounds on the execution times. Some cost figures are given for missing information of different types. These are measured in machine clock cycles. It is (intuitively) argued, that component-based software design and the use of middleware may induce intolerable costs in terms of precision.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cousot, P., Cousot, R.: Static Determination of Dynamic Properties of Generalized Type Unions. In: Proceedings of an ACM Conference on Language Design for Reliable Software, Raleigh, NC, March 1977, vol. 12(3), pp. 77–94 (1977)
Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Conference Record of the Fifth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Tucson, Arizona, pp. 84–97. ACM Press, New York (1978)
Ferdinand, C., Heckmann, R., Langenbach, M., Martin, F., Schmidt, M., Theiling, H., Thesing, S., Wilhelm, R.: Reliable and precise WCET determination for a real-life processor. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol. 2211, pp. 469–485. Springer, Heidelberg (2001)
Krishna, A.S., Klefstad, R., Schmidt, D.C., Corsaro, A.: Towards predictable real-time java object request brokers. In: Real Time Technology and Applications Symposium, p. 49. IEEE, Los Alamitos (2003)
Li, Y.-T.S., Malik, S., Wolfe, A.: Performance estimation of embedded software with instruction cache modeling. Design Automation of Electronic Systems 44(3), 257–279 (1999)
Lundquist, T., Stenström, P.: Timing anomalies in dynamically scheduled microprocessors. In: 20th IEEE Real-Time Systems Symposium (1999)
Shaw, A.C.: Reasoning About Time in Higher-Level Language Software. IEEE Transactions on Software Engineering 15(7), 875–889 (1989)
Theiling, H., Ferdinand, C., Wilhelm, R.: Fast and Precise WCET Prediction by Separate Cache and Path Analyses. Real-Time Systems 18(2/3), 157–179 (2000)
Thiele, L., Wilhelm, R.: Design for timing predictability. Real-Time Systems 28, 157–177 (2004)
Wilhelm, R.: Determination of bounds on execution times. In: Zurawski, R. (ed.) Embedded Systems Handbook, pp. 14–1, 14–24. CRC Press, Boca Raton (2005)
Wilhelm, R., Maurer, D.: Compiler Design. Addison-Wesley, Reading (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wilhelm, R. (2005). Timing Analysis and Timing Predictability. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, WP. (eds) Formal Methods for Components and Objects. FMCO 2004. Lecture Notes in Computer Science, vol 3657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561163_14
Download citation
DOI: https://doi.org/10.1007/11561163_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29131-2
Online ISBN: 978-3-540-31939-9
eBook Packages: Computer ScienceComputer Science (R0)