Application and Experimental Evaluation of State Space Reduction Methods for Deadlock Analysis in Ada

ACM Transactions on Software Engineering and Methodology (TOSEM)

Volumn 3, Issue 4, 1994, Pages 340-380

  Duri, S ^a   Buy, U ^a   Devarapalli, R ^a   Shatz, S M ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Ada tasking; automatic analysis; concurrency analysis; deadlock detection; experimental evaluation; state space explosion

Indexed keywords

ADA (PROGRAMMING LANGUAGE); MATHEMATICAL MODELS; MULTIPROGRAMMING; PETRI NETS; PROGRAM DEBUGGING; SOFTWARE ENGINEERING; STATE SPACE METHODS;

ADA TASKING; AUTOMATIC ANALYSIS; CONCURRENCY ANALYSIS; DEADLOCK DETECTION;

COMPUTER SYSTEM RECOVERY;

EID: 0028532451     PISSN: 1049331X     EISSN: 15577392     Source Type: Journal    
DOI: 10.1145/201024.201038     Document Type: Article

References (37)

1. AVRUNIN, G. S., BUY, U. A., CORBETT, J. C., DILLON, L. K., AND WILEDEN, J. C. 1991a. Automated analysis of concurrent systems with the constrained expression toolset. IEEE Trans. Softw. Eng. 17, 11, 1204-1222.
2. AVRUNIN, G. S., BUY, U. A., CORBETT, J. C., DILLON, L. K., AND WILEDEN, J. C. 1991b. Experiments with an improved constrained expression toolset. In Proceedings of the 4th Symposium on Testing, Analysis, and Verification (Victoria, British Columbia). ACM, New York, 178-187.
3. BERTHELOT, G. 1987. Checking properties of nets using transformations. In Advances in Petri nets. Lecture Notes in Computer Science, vol. 222. Springer-Verlag, New York, 19-40.
4. BUY, U. AND SLOAN, R. H. 1994. Analysis of real-time programs with simple time Petri nets. In Proceedings of the 1994 International Symposium on Software Testing and Analysis (Seattle, Wash.). ACM, New York, 228-239.
5. BUY, U., DEVARAPALLI, R., DURI, S., AND SHATZ, S. M. 1992. Using state space reduction to aid in Ada tasking analysis: Concepts and experiments. Tech. Rep. UIC-EECS-92-9, Concurrent Software Systems Lab, EECS Department, Univ. of Illinois, Chicago, Ill.
6. CORBETT, J. C. 1993. Identical tasks and counter variables in an integer programming-based approach to verification. In Proceedings of the 7th International Workshop on Software Specifications and Design (Redondo Beach, Calif.). ACM, New York, 100-109. To appear in ACM Software Engineering Notes.
7. DEVARAPALLI, R. 1993. Applying TOTAL to realistic Ada tasking programs: Experiments, problems, and solutions. Master's Project Rep., Dept. of EECS, Univ. of Illinois, Chicago, Ill.
8. DIJKSTRA, E. W. 1971. Hierarchical ordering of sequential processes. Acta Informatica 2, 2, 115-138.
9. DURI, S., BUY, U., DEVARAPALLI, R., AND SHATZ, S. M. 1993. Using state space methods for deadlock analysis in Ada tasking. In Proceedings of the 1993 International Symposium on Software Testing and Analysis (Cambridge, Mass.). ACM, New York, 51-60.
10. FUJITA-YUHAS, T., CLOUGH, A., AND VIDALE, R. 1990. Development methodology for hard real-time systems-IR&D 281 Final Report. Tech. Rep. CSDL-R-2307, The Charles Stark Draper Laboratory, Inc., Cambridge, Mass.
11. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability. W. H. Freeman & Company, New York.
12. GODEFROID, P. AND WOLPER, P. 1991. Using partial orders for the efficient verification of deadlock freedom and safety properties. In Computer-Aided Verification, K. G. Larsen and A. Skou, Eds. Lecture Notes in Computer Science, vol. 575. Springer-Verlag, New York, 332-342.
13. HELMBOLD, D. AND LUCKHAM, D. 1985. Debugging Ada tasking programs. IEEE Softw. 2, 2, 47-57.
14. HOLZMANN, G., GODEFROID, P., AND PIROTTIN, D. 1992. Coverage preserving reduction strategies for reachability analysis. In Proceedings of the 12th International Symposium on Protocol Specification, Testing, and Verification (Lake Buena Vista, Fla.). North-Holland, Amsterdam, 349-363.
15. KARAM, G. M. AND BUHR, R. J. 1990. Starvation and critical race analyzers for Ada. IEEE Trans. Softw. Eng. 16, 8, 829-843.
16. LONG, D. L. AND CLARKE, L. A. 1989. Task interaction graphs for concurrency analysis. In Proceedings of the 11th International Conference on Software Engineering (Pittsburgh, Pa.). IEEE, New York, 44-52.
17. MASTICOLA, S. P. AND RYDER, B. G. 1991. A model of Ada programs for static deadlock detection in polynomial time. In Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging. ACM, New York, 97-107.
18. MCDOWELL, C. E. 1989. A practical algorithm for static analysis of parallel programs. J. Parall. Distrib. Process. (June), 515-536.
19. MCLENDON, W. W., JR. 1991. Modeling and analysis of Ada tasking using colored Petri nets. Master's thesis, Dept. of Computer Science, Boston University, Boston, Mass.
20. MORGAN, E. T. AND RAZOUK, R. 1987. Interactive state-space analysis of concurrent systems. IEEE Trans. Softw. Eng. 13, 10, 1080-1091.
21. MURATA, T. 1989. Petri nets: Properties, analysis and applications. Proc. IEEE 77, 4, 451-480.
22. MURATA, T., SHENKER, B., AND SHATZ, S. M. 1989. Detection of Ada static deadlocks using Petri net invariants. IEEE Trans. Softw. Eng. 15, 3, 314-326.
23. OSTERWEIL, L. AND CLARKE, L. A. 1992. A proposed testing and analysis research initiative. IEEE Softw. 9, 5, 89-96.
24. REIF, J. H. AND SMOLKA, S. A. 1988. The complexity of reachability in distributed communicating processes. Acta Informatica 25, 3, 333-354.
25. SHATZ, S. M. 1993. Development of Distributed Software: Concepts and Tools. Macmillan, New York.
26. SHATZ, S. M., MAI, K., BLACK, C., AND TU, S. 1990. Design and implementation of a Petri net-based toolkit for Ada tasking analysis. IEEE Trans. Parall. Distrib. Syst. 1, 4, 424-441.
27. SHATZ, S. M., TU, S., MURATA, T., AND DURI, S. 1993. Theory and application of Petri net reduction for Ada-tasking deadlock analysis. Tech. Rep. UIC-EECS 91-15, EECS Department, Univ. of Illinois, Chicago, Ill.
28. STARKE, P. H. 1991. Reachability analysis of Petri nets using symmetries. Syst. Anal. Model. Simul. 8, 293-303.
29. TAYLOR, R. 1983a. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica 19, 57-84.
30. TAYLOR, R. 1983b. A general purpose algorithm for analyzing concurrent programs. Commun. ACM 26, 5, 362-376.
31. Tu, S., SHATZ, S. M., AND MURATA, T. 1990. Applying Petri net reduction to support Ada-tasking deadlock detection. In Proceedings of the 11th International Conference on Distributed Computing Systems (Paris, France). IEEE, New York, 96-103.
32. VALMARI, A. 1991. A stubborn attack on state explosion. In Proceedings of the 2nd International Workshop on Computer-Aided Verification. Lecture Notes in Computer Science, vol. 531. Springer-Verlag, New York, 156-165.
33. VALMARI, A. 1988. Error detection by reduced reachability graph generation In Proceedings of the 9th European Workshop on Applications and Theory of Petri Nets (Venice, Italy). Springer-Verlag, Berlin, 95-112.
34. YEH, W. J. 1993. Controlling state explosion in reachability analysis. Ph.D. dissertation, Purdue University, West LaFayette, Ind.
35. YEH, W. J. AND YOUNG, M. 1991. Compositional reachability analysis using process algebra. In Proceedings of the 1991 International Symposium on Testing, Analysis, and Verification (Victoria, British Columbia). ACM, New York, 49-59.
36. YOUNG, M. AND TAYLOR, R. N. 1988. Combining static concurrency analysis with symbolic execution. IEEE Trans. Softw. Eng. 14, 10, 1499-1511.
37. YOUNG, M., TAYLOR, R. N., FORESTER, K., AND BRODBECK, D. 1989. Integrated concurrency analysis in a software development environment. In Proceedings of the ACM SIGSOFT '89 3rd Symposium on Software Testing, Analysis and Verification. Softw. Eng. Notes 14, 8, 200-209.