ACM SIGOPS Operating Systems Review
ACM SIGOPS Operating Systems Review
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Static checking of interrupt-driven software
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Communication and Concurrency
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Deadline Analysis of Interrupt-Driven Software
IEEE Transactions on Software Engineering
Interrupt Verification via Thread Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Certifying Low-Level Programs with Hardware Interrupts and Preemptive Threads
Journal of Automated Reasoning
Stack size analysis for interrupt-driven programs
SAS'03 Proceedings of the 10th international conference on Static analysis
Transparent and selective real-time interrupt services for performance improvement
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Formal Model of Interrupt Program from a Probabilistic Perspective
ICECCS '11 Proceedings of the 2011 16th IEEE International Conference on Engineering of Complex Computer Systems
Binary Code Level Verification for Interrupt Safety Properties of Real-Time Operating System
TASE '12 Proceedings of the 2012 Sixth International Symposium on Theoretical Aspects of Software Engineering
Hi-index | 0.00 |
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.