A model of Ada programs for static deadlock detection in polynomial times

ACM SIGPLAN Notices

Volumn 26, Issue 12, 1991, Pages 97-107

  Masticola, Stephen P ^a   Ryder, Barbara G ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Ada; Anomalies; deadlocks; parallel and distributed programming; static analysis

Indexed keywords

EID: 84976694499     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/127695.122768     Document Type: Article

References (21)

1. Avrunin, G.S., Dillon, L. K., Wileden, J. C., and Riddle, W. E. “Constrained expressions: adding analysis capabilities to design methods for concurrent software systems.” IEEE Trans. on Software Eng., February 1986, 278-291.
2. American National Standards Institute. “ANSI/MIL-STD 1815A (1983) reference manual for the Ada programming language.” United States Government Printing Office, Washington DC, 1983.
3. Apt, K. R. “A static analysis of CSP programs.” Lecture Notes in Computer Science #164 - Logics of Programs (Proceedings, 1983) Springer-Verlag, pp. 1-17.
4. Barnes, J. Programming in Ada. (3rd edition) Addison Wesley, 1989. ISBN 0-201-17566-5.
5. Callahan, D. and Subhlok, J. “Static analysis of low-level synchronization.” SIGPLAN/SIGOPS Workshop on Parallel and Distributed Debugging, 1988, 100-111.
6. Callahan, D., Kennedy, K., and Subhlok, J. “Analysis of event synchronization in a parallel programming tool.” ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, Seattle, 1990, 21-30.
7. Dillon, L. K. “Verifying general safety properties of Ada tasking programs.” IEEE Trans. on Software Eng., January 1990, 51-63.
8. Duesterwald, Evelyn. “Static concurrency analysis in the presence of procedures.” TR #91-6, Dept. of Computer Science, University of Pittsburgh, March 1991.
9. Duesterwald, Evelyn. Private communication, 1991.
10. Long, D. L. and Clarke, L. A. “Task interaction graphs for concurrency analysis.” Eleventh International Conf. on Software Engineering, 1989, 44-52.
11. McDowell, C. E. “A practical algorithm for static analysis of parallel programs.” Journal of Parallel and Distributed Computing 6, 1989, 515-536.
12. Marlowe, T. J. and Ryder, B. G. “Properties of data flow frameworks: a unified model.” Acta Informatica 28, 1990, 121-163.
13. Masticola, S. P. and Ryder, B. G. “Static infinite wait anomaly detection in polynomial time.” Int'l. Conf. on Parallel Processing, 1990, 78-87.
14. Masticola, S. P. and Ryder, B. G. “Static infinite wait anomaly detection in polynomial time.” LCSR-TR-, 141 Laboratory for Computer Science Research, Rutgers University, 1990.
15. Masticola, S. P. and Ryder, B. G. “Detecting deadlocks in the Ada accept.. do and select constructs.” LCSR Technical Report, Rutgers Laboratory for Computer Science Research. In preparation.
16. Murata, T., Shenker, B., and Shatz, S. M. “Detection of Ada static deadlocks using Petri net invariants.” IEEE Trans. on Software Eng., March 1989, 314-326.
17. Saxena, A. “Static detection of deadlocks.” CU-CS-122-77, Dept. of Computer Science, University of Colorado at Boulder, 1977.
18. Taylor, R. N. “A general-purpose algorithm for analyzing concurrent programs.” Communications of the A CM, May 1983, 362-376.
19. Taylor, R. N. “Complexity of analyzing the synclironization structure of concurrent programs.” Acta Informatica, 19, 1983, 57-84.
20. Young, M. and Taylor, R. N. “Combining static concurrency analysis with symbolic execution.” IEEE Trans. on Software Eng., October 1988, 1499-1511.
21. Zhou, B., Yeh, R. T. and Ng, P. A. “Principle of deadlock detection in Ada programs.” IEEE Int'l Conf. on Distributed Computing, 1986, 572-579.