Timing Analysis of Ada Tasking Programs (1996)
| Venue: | IEEE transactions on Software Engineering |
| Citations: | 35 - 4 self |
BibTeX
@ARTICLE{Corbett96timinganalysis,
author = {James C. Corbett},
title = {Timing Analysis of Ada Tasking Programs},
journal = {IEEE transactions on Software Engineering},
year = {1996},
volume = {22},
pages = {461--483}
}
Years of Citing Articles
OpenURL
Abstract
Concurrent real-time software is increasingly used in safety-critical embedded systems. Assuring the quality of such software requires the rigor of formal methods. In order to analyze a program formally, we must first construct a mathematical model of its behavior. In this paper, we consider the problem of constructing such models for concurrent real-time software. In particular, we provide a method for building mathematical models of real-time Ada tasking programs that are accurate enough to verify interesting timing properties, and yet abstract enough to yield a tractable analysis on nontrivial programs. Our approach differs from schedulability analysis in that we do not assume that the software has a highly restricted structure (e.g., a set of periodic tasks). Also, unlike most abstract models of real-time systems, we account for essential properties of real implementations, such as resource constraints and run-time overhead. Keywords--- timing analysis, real-time systems, program ...







