Skip to main content
SpringerLink
Log in

Semantic theories of programs with nested interrupts

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

In the design of dependable software for embedded and real-time operating systems, time analysis is a crucial but extremely difficult issue, the challenge of which is exacerbated due to the randomness and nondeterminism of interrupt handling behaviors. Thus research into a theory that integrates interrupt behaviors and time analysis seems to be important and challenging. In this paper, we present a programming language to describe programs with interrupts that is comprised of two essential parts: main program and interrupt handling programs.We also explore a timed operational semantics and a denotational semantics to specify the meanings of our language. Furthermore, a strategy of deriving denotational semantics from the timed operational semantics is provided to demonstrate the soundness of our operational semantics by showing the consistency between the derived denotational semantics and the original denotational semantics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Regehra J. Safe and Structured Use of Interrupts in Real-time and Embedded Software. Handbook of Real-Time and Embedded Systems, CRC Press. 2007, 1–15

    Google Scholar 

  2. Tarski A. A Lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 1955, 5(2): 285–309

    Article  MATH  MathSciNet  Google Scholar 

  3. Hills T. Structured interrupts. ACM SIGOPS Operating Systems Review, 1993, 27: 51–68

    Article  Google Scholar 

  4. Regehra J, Cooprider N. Interrupt verification via thread verification. Electronic Notes in Theoretical Computer Science, 2007, 174(9): 139–150

    Article  Google Scholar 

  5. Feng X, Shao Z, Guo Y, Dong Y. Certifying low-level programs with hardware interrupts and preemptive threads. Journal of Automated Reasoning, 2009, 42: 301–347

    Article  MATH  Google Scholar 

  6. Leslie I, McAuley D, Black R, Roscoe T, Barham P, Evers D, Fairbairns R, Hyden E. The design and implementation of an operating system to support distributed multimedia applications. IEEE Journal of Selected Areas in Communications, 1996, 14: 1280–1297

    Article  Google Scholar 

  7. Kleiman S, Eykholt J. Interrupts as threads. ACM SIGOPS Operating Systems Review, 1995, 29: 21–26

    Article  Google Scholar 

  8. Brylow D, Damgaard N, Palsberg J. Static checking of interrupt-driven software. In: Proceedings of International Conference on Software Engineering. 2001, 47–56

    Google Scholar 

  9. Palsberg J, Ma D. A typed interrupt calculus. In: Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault Tolerant Systems. 2002, 291–310

    Chapter  Google Scholar 

  10. Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger T A, Palsberg J. Stack size analysis for interrupt-driven programs. In: Proceedings of International Static Analysis Symposium. 2003, 109–126

    Chapter  Google Scholar 

  11. Brylow D, Palsberg J. Deadline analysis of interrupt-driven software. IEEE Transactions on Software Engineering, 2004, 30: 634–655

    Article  Google Scholar 

  12. Bérard B, Haddad S. Interrupt timed automata. In: Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures. 2009, 197–211

    Google Scholar 

  13. Bérard B, Haddad S, Sassolas M. Real time properties for interrupt timed automata. In: Proceedings of the 17th International Symposium on Temporal Representation and Reasoning. 2010, 69–76

    Google Scholar 

  14. Bérard B, Haddad S, Sassolas M. Interrupt timed automata: verification and expressiveness. In: Proceedings of Formal Methods in System Design. 2012, 41–87

    Google Scholar 

  15. Li G, Yuen S, Adachi M. Environmental simulation of real-time systems with nested interrupts. In: Proceedings of the 3rd IEEE International Symposium on Theoretical Aspects of Software Engineering. 2009, 21–28.

    Google Scholar 

  16. Baeten J C M, Bergstra J A, Klop J W. Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Information IX(2), 1986, 9: 127–168

    MATH  MathSciNet  Google Scholar 

  17. Diertens B. New Features in PSF I - Interrupts, Disrupts, and Priorities. Report P9417, Programming Research Group - University of Amsterdam. 1994, 5–17

    Google Scholar 

  18. Engels A, Cobben T. Interrupt and disrupt in MSC: possibilities and problems. In: Proceedings of the 1st Workshop of the SDL Forum Society on SDL and MSC. 1998, 1–4

    Google Scholar 

  19. Hoare C A R. Communicating Sequential Processes. Prentice Hall, 1985

    Google Scholar 

  20. Hoare C A R, He J. Unifying Theories of Programming. Prentice Hall, 1998

    Google Scholar 

  21. Hoare C A R, He J. From algebra to operational semantics. Information Process Letter, 1993, 45: 75–80

    Article  MATH  MathSciNet  Google Scholar 

  22. Brookes S. Full abstraction for a shared-variable parallel language. Information and Computation, 1996, 127: 145–163

    Article  MATH  MathSciNet  Google Scholar 

  23. Bakker J, Vink E. Control flow semantics. The MIT Press, 1996

    Google Scholar 

  24. Hartog J. Probabilistic extensions of semantic models. Dissertation for PhD Degree, Vrije University, The Netherlands, 2002

    Google Scholar 

  25. Hartog J, Vink E. Mixing up nondeterminism and probability: a preliminary report. Electrontic Notes Theoretical Computer Science, 1999, 22: 88–110

    Article  Google Scholar 

  26. Hartog J, Vink E, Bakker J. Metric semantics and full abstractness for action refinement and probabilistic choice. Electronic Notes in Theoretical Computer Science, 2001, 40: 72–99

    Article  Google Scholar 

  27. Hartog J, Vink E. Verifying probabilistic programs using a Hoare like logic. International Journal of Foundations of Computer Science, 2002, 13: 315–340

    Article  MATH  MathSciNet  Google Scholar 

  28. Zhu H, Bowen J P, He J. From operational semantics to denotational semantics for Verilog. In: Proceedings of the 11th Advanced Research Working Conference on Correct Hardware Design and Verification Methods. 2001, 449–464

    Google Scholar 

  29. Zhu H, He J, Li J, Pu G, Bowen J P. Linking denotational semantics with operational semantics for web services. Innvoations Systems and Software Engineering, 2010, 6: 283–298

    Article  Google Scholar 

  30. Zhu H, Yang F, He J, Bowen J P, Sanders J W, Qin S. Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language. The Journal of Logic and Algebraic Programming, 2012, 81: 2–25

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Trusted Embedded Software Engineering Technology Research Center, East China Normal University, Shanghai, 200062, China

    Yanhong Huang & Jianqi Shi

  2. Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, 200062, China

    Yanhong Huang, Jifeng He, Huibiao Zhu, Yongxin Zhao & Jianqi Shi

  3. School of Computer Science and Software Engineering, Shenzhen University, Shenzhen, 518060, China

    Shengchao Qin

Authors
  1. Yanhong Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jifeng He
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Huibiao Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yongxin Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jianqi Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Shengchao Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Huibiao Zhu.

Additional information

Yanhong Huang is an assistant researcher in the National Trusted Embedded Software Engineering Technology Research Center and Software Engineering Institute, East China Normal University. She received her PhD from East China Normal University, China, in 2014. Her research focuses on formal methods, semantics theory, analysis, and verification of embedded systems.

Jifeng He is a professor and the Dean of Software Engineering Institute, East China Normal University. He is an academician of the Chinese academy of Sciences. He has been appointed as the chief scientist for several projects of National Natural Science Foundation of China and 973 program. He was also appointed as the leader of the creative research group of the National Natural Science Foundation of China. His recent work focuses on mathematical models for the co-design of software and hardware, design of real-time embedded systems, and cyber physical systems.

Huibiao Zhu is a professor of the Software Engineering Institute, East China Normal University, and is the executive deputy director of Shanghai Key Laboratory of Trustworthy Computing. He received his PhD in formal methods from London South Bank University in 2005. He has studied various semantics and their linking theories for Verilog, SystemC, Web services and probability systems. Currently he is the Chinese PI of the Sino-Danish Basic Research Center IDEA4CPS.

Yongxin Zhao is an associate professor of the Software Engineering Institute, East China Normal University. He was a postdoc in School of Computing of National University of Singapore, Singapore from 2012 to 2014. His research interests include program analysis and verification, semantics theory,Web services, and formal methods and he has more than 28 refereed publications.

Jianqi Shi received his PhD from East China Normal University, China, in 2012. He is an associate researcher of National Trusted Embedded Software Engineering Technology Research Center and East China Normal University. His research interests cover formal verification, binary code analysis, parallel computing, and mobile device security.

Shengchao Qin’s research interests lie mainly in formal methods, software engineering and programming languages, in particular, formal specification and modelling, program analysis and verification, programming theories, program logic such as separation logic. He has published more than 70 papers in international journals and peer-refereed international conferences.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Huang, Y., He, J., Zhu, H. et al. Semantic theories of programs with nested interrupts. Front. Comput. Sci. 9, 331–345 (2015). https://doi.org/10.1007/s11704-015-3251-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-015-3251-x

Keywords

Search

Navigation