ACM Home Page
Please provide us with feedback. Feedback
The universe model: an approach for improving the modularity and reliability of concurrent programs
Full text PdfPdf (1.08 MB)
Source Foundations of Software Engineering archive
Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications table of contents
San Diego, California, United States
Pages: 20 - 29  
Year of Publication: 2000
ISBN:1-58113-205-0
Also published in ...
Authors
Reimer Behrends  Dept. of Computer Science and Engineering, Michigan State University, East Lansing, MI
R. E. Kurt Stirewalt  Dept. of Computer Science and Engineering, Michigan State University, East Lansing, MI
Sponsors
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Citation Count: 4
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/355045.355049
What is a DOI?

ABSTRACT

We present the universe model, a new approach to concurrency management that isolates concurrency concerns and represents them in the modular interface of a component. This approach improves program comprehension, module composition, and reliability for concurrent systems. The model is founded on designer-specified invariant properties, which declare a component's dependencies on other concurrent components. Process scheduling is then automatically derived from these invariants. We illustrate the advantages of this approach by applying it to a real-world example.


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
E Arbab and G. A. Papadopoulos. Coordination Models and Languages. In The Engineering of Large Systems. Advances in Computers. Academic Press, 1998.
 
2
R. Behrends and R. E. K. Stirewalt. A High-Level Approach to Concurrency. Tech. Rep. MSU-CSE-00-6 (March 2000), Department of Computer Science and Engineering, Michigan State University.
 
3
 
4
5
6
 
7
C. M. Fleiner and M. Philippsen. Fair Multi-Branch Locking of Several Locks. In International Conference on Parallel and Distributed Computing and Systems, pages 537-545, Washington D.C., October 1997.
 
8
 
9
C.A.R. Hoare. Hints on Programming Language Design. In C. J. Bunyan (Ed.), State of the Art Report 20: Computer Systems Reliability, pages 505-534. Pergamon/infotech Publishing, 1974.
 
10
 
11
 
12
S. Letovsky and E. Soloway. Delocalized Plans and Program Comprehension. IEEE Softw. 3 (3) (1986).
 
13
 
14
 
15
S. M. Omohundro. The Sather Language. Tech. Rep. (1991), International Computer Science Institute, 1947 Center Street, Suite 600, Berkely, California 94704.
16
 
17
S. Rugaber and R. E. K. Stirewalt and L. Wills. Understanding Interleaved Code. Journal of Automated Software Engineering 3 (1) (1996).
 
18
S. Rugaber and R. E. K. Stirewalt and L. Wills. The Interleaving Problem in Program Understanding. In Proceedings of the IEEE Second Working Conference on Reverse Engineering, 1995.
 
19
A. Shah. State of the Art: JavaSpace, Java Report: The Source for Java Development 2 (5), 16 (1997).
 
20
 
21
22


Collaborative Colleagues:
Reimer Behrends: colleagues
R. E. Kurt Stirewalt: colleagues