ACM Home Page
Please provide us with feedback. Feedback
Formal modeling of synchronization methods for concurrent objects in Ada 95
Full text PdfPdf (605 KB)
Source Annual International Conference on Ada archive
Proceedings of the 1999 annual ACM SIGAda international conference on Ada table of contents
Redondo Beach, California, United States
Pages: 211 - 220  
Year of Publication: 1999
ISBN:1-58113-127-5
Also published in ...
Authors
Ravi K. Gedela  Dept. of EECS, Concurrent Software Lab, The University of Illinois at Chicago
Sol M. Shatz  Dept. of EECS, Concurrent Software Lab, The University of Illinois at Chicago
Haiping Xu  Dept. of EECS, Concurrent Software Lab, The University of Illinois at Chicago
Sponsors
SIGCAS: ACM Special Interest Group on Computers and Society
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGAPP: ACM Special Interest Group on Applied Computing
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGBIO: ACM Special Interest Group on Biomedical Computing
SIGCSE: ACM Special Interest Group on Computer Science Education
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 11,   Citation Count: 0
Additional Information:

abstract   references   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/319294.319325
What is a DOI?

ABSTRACT

One important role for Ada programming is to aid engineering of concurrent and distributed software. In a concurrent and distributed environment, objects may execute concurrently and need to be synchronized to serve a common goal. Three basic methods by which objects in a concurrent environment can be constructed and synchronized have been identified [1]. To formalize the semantics of these methods and to provide a formal model of their core behavior, we provide some graphic models based on the Petri net formalism. The purpose of this formal modeling is to illustrate the possibility of automatic program analysis for object-oriented features in Ada-95. Models for the three distributed- object synchronization methods are discussed, and a potential deadlock situation for one of the methods/models is illustrated. We conclude with some comparison of the three methods in terms of the model abstractions.


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
T. Murata, "Petri Nets: Properties, Analysis and Applications," Proceedings of the IEEE, 77(4):541-580, April 1989.
 
4
 
5
6
 
7
 
8
 
9

Collaborative Colleagues:
Ravi K. Gedela: colleagues
Sol M. Shatz: colleagues
Haiping Xu: colleagues