| Constructing abstract models of concurrent real-time software |
| Full text |
Pdf
(900 KB)
|
| Source
|
International Symposium on Software Testing and Analysis
archive
Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
table of contents
San Diego, California, United States
Pages: 250 - 260
Year of Publication: 1996
ISBN:0-89791-787-1
Also published in ...
|
|
Author
|
|
James C. Corbett
|
Department of Information and Computer Science, University of Hawai'i at Manoa
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 13, Citation Count: 8
|
|
|
ABSTRACT
Concurrent real-time software is used in many safety-critical applications. Assuring the quality of such software requires the use of formal methods. Before a program can be analyzed formally, however, we must construct a mathematical model that captures the aspects of the program we want to verify. In this paper, we show how to construct mathematical models of concurrent real-time software that are suitable for analyzing the program's timing properties. 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 more abstract models of real-time systems, we account for essential properties of real implementations, such as resource constraints and run-time overhead.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
R. Alur , C. Courcoubetis , N. Halbwachs , T. A. Henzinger , P.-H. Ho , X. Nicollin , A. Olivero , J. Sifakis , S. Yovine, The algorithmic analysis of hybrid systems, Theoretical Computer Science, v.138 n.1, p.3-34, Feb. 6, 1995
[doi> 10.1016/0304-3975(94)00202-T]
|
| |
2
|
|
| |
3
|
|
| |
4
|
J. C. Corbett. Modeling and analysis of real-time Ada tasking programs, in Ramamritham {15}, pages 132-141.
|
| |
5
|
A. N. Fredette and R. Cleaveland. RTSL: a formal language for real-time schedulability analysis. In Proceedings of the Real-Time Systems Symposium, pages 274-283, 1993.
|
| |
6
|
|
| |
7
|
|
| |
8
|
|
 |
9
|
|
| |
10
|
|
| |
11
|
|
| |
12
|
S.Lim, Y. Bae, G.T. Jang, B.Rhee, S. Min, C.Y. Park, H. Shin, K. Park, and C. S. Kim. An accurate worst case timing analysis technique for RISC processors. In Ramamritham {15}, pages 97-108.
|
| |
13
|
|
| |
14
|
|
| |
15
|
K. Ramamritham, editor. Proceedings of the Real- Time Systems Symposium. IEEE Computer Society Press, Dec. 1994.
|
| |
16
|
|
| |
17
|
|
CITED BY 8
|
|
|
|
|
George S. Avrunin , James C. Corbett , Laura K. Dillon, Analyzing partially-implemented real-time systems, Proceedings of the 19th international conference on Software engineering, p.228-238, May 17-23, 1997, Boston, Massachusetts, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|