Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/319294.319325acmconferencesArticle/Chapter ViewAbstractPublication PagesadaConference Proceedingsconference-collections
Article
Free access

Formal modeling of synchronization methods for concurrent objects in Ada 95

Published: 01 September 1999 Publication History

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

[1]
A. Burns and A. Wellings, Concurrency in Ada, Cambridge Press, 1995.
[2]
J. Barnes, Programming in Ada 95. Addison- Wesley, Inc., 1996.
[3]
T. Murata, "Petri Nets: Properties, Analysis and Applications," Proceedings of the IEEE, 77(4):541-580, April 1989.
[4]
D. Mandrioli, R. Zicari, C. Ghezzi and F. Tisato, "Modeling the Ada Task System by Petri Nets," Computer Languages, 10(1):43-61, 1985.
[5]
S.M. Shatz, S. Tu, T. Murata, and S. Duri, "An Application of Petri Net Reduction for Ada Tasking Deadlock Analysis," IEEE Transactions on Parallel and Distributed Systems, Vol. 7, No. 12, Dec. 1996, pp. 1307-1322.
[6]
S. Duri, U. Buy, R. Devarapalli, and S. M. Shatz, "Application and Experimental Evaluation of State Space Reduction Methods for Deadlock Analysis in Ada," ACM Transactions on Software Engineering Methodology, Vol. 3, No. 4, Oct. 1994, pp. 340-380.
[7]
R. Gedela and S. M. Shatz, "Formal Modeling of Advanced Tasking in Ada: A Petri Net Perspective," 2nd International Workshop on Software Engineering for Parallel and Distributed Systems (PDSE-97), Boston, May, 1997, pp. 4-14.
[8]
K. Jensen, "Coloured Petri Nets: A High Level Language for System Design and Analysis," Advances in Petri Nets 1990, G. Rozenberg (Editor), in Lecture Notes in Computer Science, 483, Springer-Verlag, 1990.
[9]
S.M. Shatz, et al, "Design and Implementation of a Petri Net Based Tool kit for Ada Tasking Analysis," IEEE Transactions On Parallel and Distributed Systems, Oct. 1990, pp.424-441.

Cited By

View all
  • (2003)QuasarProceedings of the 8th Ada-Europe international conference on Reliable software technologies10.5555/1757068.1757084(168-181)Online publication date: 16-Jun-2003
  • (2003)Quasar: A New Tool for Concurrent Ada Programs AnalysisReliable Software Technologies — Ada-Europe 200310.1007/3-540-44947-7_12(168-181)Online publication date: 18-Jun-2003
  • (2002)Detecting Deadlock in Ada Rendezvous Flow Structure Based on Process AlgebraFormal Methods and Software Engineering10.1007/3-540-36103-0_29(262-274)Online publication date: 10-Oct-2002

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGAda '99: Proceedings of the 1999 annual ACM SIGAda international conference on Ada
September 1999
251 pages
ISBN:1581131275
DOI:10.1145/319294
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1999

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Ada-95
  2. Petri net formalism
  3. concurrent objects
  4. distributed software
  5. synchronization methods

Qualifiers

  • Article

Conference

SIGAda99: ACM SIGAda Annual International Conference
October 17 - 21, 1999
California, Redondo Beach, USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)77
  • Downloads (Last 6 weeks)26
Reflects downloads up to 24 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2003)QuasarProceedings of the 8th Ada-Europe international conference on Reliable software technologies10.5555/1757068.1757084(168-181)Online publication date: 16-Jun-2003
  • (2003)Quasar: A New Tool for Concurrent Ada Programs AnalysisReliable Software Technologies — Ada-Europe 200310.1007/3-540-44947-7_12(168-181)Online publication date: 18-Jun-2003
  • (2002)Detecting Deadlock in Ada Rendezvous Flow Structure Based on Process AlgebraFormal Methods and Software Engineering10.1007/3-540-36103-0_29(262-274)Online publication date: 10-Oct-2002

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media