Abstract
Many approaches have been presented to detect deadlock of Ada concurrent programs. Most of them adopt some kind of flow structure or Petri nets. In this paper, we express Ada rendezvous flow structure using process algebra. Through the deduction of process algebra expressions with equivalence, information about communications among processes can be obtained. Together with the help of communication dependence analysis, the paper proposes a static approach to detect deadlock in Ada rendezvous flow structure.
This work is supported in part by the National Natural Science Foundation of China (NSFC) (60073012), Natural Science Foundation of Jiangsu, China (BK2001004), Opening Foundation of State Key Laboratory of Software Engineering in Wuhan University, and Foundation of State Key Laboratory for Novel Software Technology in Nanjing University.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.C.M. Baeten, W.P. Weijland. Process Algebra. Cambridge University Press, Cambridge, United Kingdom, 1990.
J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, Cambridge, United Kingdom, 1990.
J. A. Bergstra, J. W. Klop, Process Algebra for Synchronous Communication. Information and Control, 60:109–137, 1984.
J. Blieberger, B. Burgstaller, B. Scholz. Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs. In Proc. of the Ada-Europe International Conference on Reliable Software Technologies, Potsdam, Germany, June 2000. Springer.
Zhenqiang Chen Baowen Xu. Slicing Concurrent Java Programs. ACM SIGPLAN Notices, 2001, 36(4): 41–47.
J. Cheng, K. Ushijima. Analyzing Ada Tasking Deadlocks and Livelocks Using Extended Petri Nets. In Lecture Notes in Computer Science #499, pp 125–146, Springer-Verlag, 1991.
James C. Corbett, Evaluating Deadlock Detection Methods for Concurrent Software. IEEE Transactions on Software Engineering, 1996, 22(3): 161–180.
Matthew B. Dwyer, Kari A. Nies, Lori A. Clarke. Compact Petri Net Representation for Concurrent Programs. ICSE, 1994.
R. Gedela, S. Shatz, H. Xu. Former Modeling of Synchronization Methods for Concurrent Objects in Ada 95. Proceedings of the ACM Annual International Conference on Ada (SIGAda-99), Redondo Beach, Calif., Oct. 1999, pp. 211–220.
A.H.M ter Hofstede. Task Structure Semantics through Process Algebra. Software Engineering Journal, 8(1): 14–20, January 1993.
ISO/IEC 8652:1995(E). Ada Reference Manual-Language and Standard Libraries.
Douglas L. Long, Lori A. Clarke. Task Interaction Graphs for Concurrency Analysis. In Proceedings of the 11 th ICSE, pp 44–52, Pittsburgh, May 1989.
Stephen P. Masticola, Static Detection of Deadlocks in Polynomial Time. A dissertation submitted to the Graduate School-New Brunswick Rutgers, The State University of New Jersey, May, 1993.
J. L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice Hall, Englewood Cliffs, N.J., 1981, ISBN 0-13661-983-5.
R.N. Taylor. Complexity of Analyzing the Synchronization Structure of Concurrent Programs. Acta Informatica, 19:57–84, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, Y., Xu, B., Chen, Z. (2002). Detecting Deadlock in Ada Rendezvous Flow Structure Based on Process Algebra. In: George, C., Miao, H. (eds) Formal Methods and Software Engineering. ICFEM 2002. Lecture Notes in Computer Science, vol 2495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36103-0_29
Download citation
DOI: https://doi.org/10.1007/3-540-36103-0_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00029-7
Online ISBN: 978-3-540-36103-9
eBook Packages: Springer Book Archive