Abstract
In design of dependable software for real-time embedded systems, time analysis is an important but challenging problem due in part to the randomicity and nondeterminism of interrupt handling behaviors. Time properties are generally determined by the behavior of the main program and the interrupt handling programs. In this paper, we present a small but expressive language for interrupt-driven programs and propose a timed operational semantics for it which can be used to explore various time properties. A number of algebraic laws for the computation properties that underlie the language are established on top of the proposed operational semantics. We depict a number of important time properties and illustrate them using the operational semantics via a small case study.
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
Zhao, Y., Huang, Y., He, J., Liu, S.: Formal Model of Interrupt Program from a Probabilistic Perspective. In: ICECCS (2011)
Regehra, J., Coopridera, N.: Interrupt Verification via Thread Verification. ENTCS (2007)
Regehra, J.: Random testing of interrupt-driven software. ACM (2005)
Kleiman, S., Eykholt, J.: Interrupts as threads. In: ACM SIGOPS (1995)
Feng, X., Shao, Z., Guo, Y., Dong, Y.: Certifying Low-Level Programs with Hardware Interrupts and Preemptive Threads. J. Autom. Reasoning 42(2-4) (2009)
Hills, T.: Structured interrupts. In: ACM SIGOPS (1993)
Cobben, T., Engels, A.: Interrupt and Disrupt in MSC: Possibilities and Problems (1998)
Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Syntax and Defining equations for an interrupt mechanism in process algebra. In: FIIX (1986)
Brylow, D., Damgaard, N., Palsberg, J.: Static Checking of Interrupt-driven Software. In: ICSE (2001)
Palsberg, J., Ma, D.: A Typed Interrupt Calculus. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol. 2469, pp. 291–310. Springer, Heidelberg (2002)
Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T.A., Palsberg, J.: Stack Size Analysis for Interrupt-driven Programs. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 109–126. Springer, Heidelberg (2003)
Brylow, D., Palsberg, J.: Deadline Analysis of Interrupt-Driven Software. IEEE Transactions on Software Engineering (2004)
Regehra, J.: Handbook of Real-Time and Embedded Systems. In: Safe and Structured Use of Interrupts in Real-Time and Embedded Software (2007)
Kleidermacher, D.: Minimizing Interrupt Response Time, Design Strategies and Methodologies 4(1) (2005)
Jeong, J., Seo, E., Kim, D.-S., Kim, J.-S., Lee, J., Jung, Y.-J., Kim, D.-H., Kim, K.: Transparent and Selective Real-Time Interrupt Services for Performance Improvement. In: Obermaisser, R., Nah, Y., Puschner, P., Rammig, F.J. (eds.) SEUS 2007. LNCS, vol. 4761, pp. 283–292. Springer, Heidelberg (2007)
Hoare, C.A.R., He, J.: Unifying Theories of Programming, Prentice Hall International Series in Computer Science (1998)
Shi, J., Zhu, L., Huang, Y., Guo, J., Zhu, H., Fang, H., Ye, X.: Binary Code Level Verfication for Interrupt Safety Properties of Real-Time Operating System. In: TASE (2012)
Milner, R.: Communication and Comcurrency. Prentice Hall International Series in Computer Science (1990)
Milner, R.: Communication and Mobile System: π − caculus. Cambirdge University Press (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, Y., Zhao, Y., Shi, J., Zhu, H., Qin, S. (2012). Investigating Time Properties of Interrupt-Driven Programs. In: Gheyi, R., Naumann, D. (eds) Formal Methods: Foundations and Applications. SBMF 2012. Lecture Notes in Computer Science, vol 7498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33296-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-33296-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33295-1
Online ISBN: 978-3-642-33296-8
eBook Packages: Computer ScienceComputer Science (R0)