An Ada deadlock testing algorithm based on control and communication flow graphs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An Ada deadlock testing algorithm based on control and communication flow graphs

Full text

Pdf (629 KB)

Source

Annual International Conference on Ada archive
Proceedings of the conference on TRI-Ada '92 table of contents

Orlando, Florida, United States

Pages: 450 - 457

Year of Publication: 1992

ISBN:0-89791-529-1

Authors

Anneliese von Mayrhauser
Shao-Ming Simon Hsueh

Sponsor

SIGADA: ACM Special Interest Group on Ada Programming Language

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 5, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/143557.143991 What is a DOI?

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	Nissim Francez , Shaula A. Yemini, Symmetric intertask communication, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.4, p.622-636, Oct. 1985 [doi>10.1145/4472.4475]
	2	Narain Gehani, ADA: Concurrent Programming, Prentice-Hall, Inc., Upper Saddle River, NJ, 1984
	3	Shao-Ming Simon Hsueh, An Ada deadlock testing algorithm based on control and communication flow graphs, Illinois Institute of Technology, Chicago, IL, 1992
	4	Johnson, D. B. 1975. "Finding All the Elementary Circuits of a Directed Graph", SIAM Journal of Computing, vol. 4, no. 1, p. 77-84.
	5	Douglas L. Long , Lori A. Clarke, Task interaction graphs for concurrency analysis, Proceedings of the 11th international conference on Software engineering, p.44-52, May 1989, Pittsburgh, Pennsylvania, United States [doi>10.1145/74587.74592]
	6	Tadao Murata , Sol M. Shatz , Boris Shenker, Detection of Ada Static Deadlocks Using Petri Net Invariants, IEEE Transactions on Software Engineering, v.15 n.3, p.314-326, March 1989 [doi>10.1109/32.21759]
	7	James L. Peterson , Abraham Silberschatz, Operating system concepts (2nd ed.), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1985
	8	S. M. Roberts , Benito Flores, Systematic generation of Hamiltonian circuits, Communications of the ACM, v.9 n.9, p.690-694, Sept. 1966 [doi>10.1145/365813.365842]
	9	Richard N. Taylor, A general-purpose algorithm for analyzing concurrent programs, Communications of the ACM, v.26 n.5, p.361-376, May 1983 [doi>10.1145/69586.69587]
	10	James C. Tiernan, An efficient search algorithm to find the elementary circuits of a graph, Communications of the ACM, v.13 n.12, p.722-726, Dec. 1970 [doi>10.1145/362814.362819]
	11	A. von Mayrhauser, AMT—the Ada maintenance toolchest, Proceedings of the conference on TRI-Ada '91: today's accomplishments; tomorrow's expectations, p.294-299, October 21-25, 1991, San Jose, California, United States [doi>10.1145/126551.126581]