ACM Home Page
Please provide us with feedback. Feedback
Constructing abstract models of concurrent real-time software
Full text PdfPdf (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
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 13,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/229000.226323
What is a DOI?

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
 
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