Investigating time properties of interrupt-driven programs

  • Authors:
  • Yanhong Huang;Yongxin Zhao;Jianqi Shi;Huibiao Zhu;Shengchao Qin

  • Affiliations:
  • Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, P.R. China;Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, P.R. China;Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, P.R. China;Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, P.R. China;School of Computing, Teesside University, UK

  • Venue:
  • SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.