Formal model of interrupt program from a probabilistic perspective

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

Interrupt behaviors are extremely difficult to verify and reason about in the development of operating system due to their randomicity and nondeterminism. This paper proposes a formal model of interrupt program which is an extension of Dijkstra's language of guarded commands. The probabilistic operational semantics exhibiting how the effect of interrupt is produced is explored for the interrupt program. A number of algebraic laws for the computation properties that underlie the language are established in terms of the suggested probabilistic operational semantics. Furthermore, the time constraint of the interrupt program is elaborately specified and the corresponding verification can be carried out in our framework.

Original languageEnglish
Title of host publicationProceedings - 2011 16th IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 2011
Pages87-94
Number of pages8
DOIs
StatePublished - 2011
Event16th IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 2011 - Las Vegas, NV, United States
Duration: 27 Apr 201129 Apr 2011

Publication series

NameProceedings - 2011 16th IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 2011

Conference

Conference16th IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 2011
Country/TerritoryUnited States
CityLas Vegas, NV
Period27/04/1129/04/11

Keywords

  • Interrupt
  • Operational semantics
  • Probability
  • Verification

Fingerprint

Dive into the research topics of 'Formal model of interrupt program from a probabilistic perspective'. Together they form a unique fingerprint.

Cite this