A Concurrency Analysis Tool Suite for Ada Programs: Rationale, Design, and Preliminary Experience

ACM Transactions on Software Engineering and Methodology (TOSEM)

Volumn 4, Issue 1, 1995, Pages 65-106

  Young, Michal ^a   Taylor, Richard N ^b   Levine, David L ^b   Nies, Kari A ^b   Brodbeck, Debra ^b  

^a PURDUE UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Ada; concurrency; software development environments; static analysis; tool integration

Indexed keywords

CODES (SYMBOLS); COMPUTER AIDED SOFTWARE ENGINEERING; DISTRIBUTED COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROGRAM DEBUGGING; RELIABILITY; SOFTWARE ENGINEERING; SYSTEMS ANALYSIS; USER INTERFACES;

CONCURRENCY; STATIC ANALYSIS; TOOL INTEGRATION; VERIFICATION;

ADA (PROGRAMMING LANGUAGE);

EID: 0029222886     PISSN: 1049331X     EISSN: 15577392     Source Type: Journal    
DOI: 10.1145/201055.201080     Document Type: Article

References (53)

1. ANDREWS, G. R. 1991. Concurrent Programming: Principles and Practice. Benjamin/Cummings, Redwood City, Calif.
2. APT, K. R. 1983. A static analysis of CSP programs. In Proceedings of the Workshop on Program Logic (Pittsburgh, Pa.).
3. AVRUNIN, G. S., DILLON, L. K., WILEDEN, J. C., AND RIDDLE, W. E. 1986. Constrained expressions: Adding analysis capabilities to design methods for concurrent software systems. IEEE Trans. Softw. Eng. SE-12, 2 (Feb.), 278-292.
4. BAETEN, J. C. M. AND VAN GLABEEK, R. J. 1987. Another look at abstraction in process algebra. In Proceedings of the 14th International Colloquium on Automata. Languages, and Programming (ICALP) (Karlsruhe, Germany, July). Lecture Notes in Computer Science, vol. 267. Springer-Verlag, Berlin, 84-94.
5. BERGSTRA, J. A. AND KLOP, J. W. 1984. Process algebra for synchronous communication. Inf. Control 60, 109-137.
6. BROOKES, S. D., HOARE, C. A. R., AND ROSCOE, A. W. 1984. A theory of communicating sequential processes J. ACM 31, 3 (July), 560-599.
7. BUHR, R. J. A. 1984. System Design with Ada. Prentice-Hall, Englewood Cliffs, N.J.
8. 20 states and beyond. In Proceedings of the 5th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 428-439.
9. CLARKE, E. M., BROWNE, M. C., EMERSON, E. A., AND SISTAL, A. P. 1985. Using temporal logic for automatic verification of finite state systems. In Logics and Models of Concurrent Systems, K R. Apt, Ed Springer-Verlag, Berlin, 3-26.
10. CLARKE, E. M., EMERSON, E. A., AND SISTAL, A. P. 1986. Automatic verification of finite-state concurrent systems using temporal logic. ACM Trans. Program. Lang. Syst. 8, 2 (Apr.), 244-263.
11. CLEAVELAND, R., PARROW, J., AND STEFFEN, B. 1990. A semantics-based verification tool for finite-state systems. In Protocol Specification, Testing, and Verification. Vol. 9. North-Holland, Amsterdam, 287-302.
12. DILLON, L. K., AVRUNIN, G. S., AND WILEDEN, J. C. 1988. Constrained expressions: Toward broad applicability of analysis methods for distributed software systems. ACM Trans. Program. Lang. Syst. 10, 3 (July), 374-402.
13. FERNANDEZ, J.-C., GARAVEL, H., MOURNIER, L., RASSE, A., RODRIGUEZ, C., AND SIFAKIS, J. 1992. A toolbox for the verification of LOTOS programs. In Proceedings of the 14th International Conference on Software Engineering (Melbourne, Australia). IEEE Computer Society Press, Los Alamitos, Calif., 246-259.
14. FORESTER, K. 1991. IRIS-Ada reference manual. Arcadia Tech. Rep. UM-90-07, Univ. of Massachusetts, Amherst, Mass.
15. GODEFROID, P., HOLZMANN, G. J., AND PIROTTIN, D. 1993. State space caching revisited. In Proceedings of the 4th Workshop on Computer-Aided Verification (Montreal, Quebec, July). Lecture Notes in Computer Science, vol. 663. Springer-Verlag, Berlin, 175-186.
16. HELMBOLD, D. P. AND MCDOWELL, C. E. 1991. Computing reachable states of parallel programs. In Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging. ACM SIGPLAN Not. 26, 12, 76-84.
17. HENNESSY, M. 1988. Algebraic Theory of Processes. MIT Press Series in the Foundations of Computing. The MIT Press, Cambridge, Mass.
18. HILFINGER, P. N. 1982. Implementation strategies for Ada tasking idioms In Proceedings of the AdaTEC Conference on Ada. ACM, New York, 26-30.
19. HOARE, C. A. R. 1974. Monitors: An operating system structuring concept. Commun. ACM 17, 10 (Oct.).
20. HOLZMANN, G. J. 1991. Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs, N.J.
21. KANELLAKIS, P. C. AND SMOLKA, S A. 1990. CCS expressions, finite state processes, and three problems of equivalence. Inf. Comput. 86, 43-68.
22. KELLER, R. K., CAMERON, M., TAYLOR, R. N., AND TROUP, D. B. 1991. User interface development and software environments: The Chiron-1 system. In Proceedings of the 13th International Conference on Software Engineering (Austin, Tex., May). IEEE Computer Science Press, Los Alamitos, Calif., 208-218.
23. LADNER, R. E. 1979. The complexity of problems in systems of communicating sequential processes. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing (Atlanta, Ga., April). ACM, New York, 214-223.
24. LAM, S. S. AND SHANKAR, A. U. 1984. Protocol verification via projections. IEEE Trans. Softw. Eng. SE-10, 4 (July), 325-342.
25. LEBLANC, T. J. AND MELLOR-CRUMMERY, J. M. 1987. Debugging parallel programs with instant replay. IEEE Trans. Comput. C-36, 4 (Apr.), 471-482.
26. 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., May). IEEE Computer Society Press, Los Alamitos, Calif., 44-52.
27. LONG, D. AND CLARKE, L. A. 1991. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In Proceedings of the Symposium on Software Testing, Analysis, and Verification (TAV4) (Victoria, British Columbia, October). ACM Press, New York, 21-35.
28. MANDRIOLI, D., ZICARI, R., GHEZZI, C., AND TISATO, F. 1985. Modeling the Ada task system by Petri nets. Comput. Lang. 10, 1, 43-61.
29. MASTICOLA, S. P 1993. Static detection of deadlocks in polynomial time. Ph.D. thesis, Rutgers Univ., New Brunswick, N.J.
30. 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 SIGPLAN Not. 26, 12, 97-107.
31. MCDOWELL, C. E. 1989. A practical algorithm for static analysis of parallel programs. J. Parallel Distrib. Comput. 6, 515-536.
32. MILNER, R. 1989. Communication and Concurrency. Prentice-Hall, London.
33. MORGAN, E. T. AND RAZOUK, R. R. 1987. Interactive state-space analysis of concurrent systems. IEEE Trans. Softw. Eng. SE-13, 10 (Oct.), 1080-1091.
34. PETERSON, J. 1981. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs, N.J.
35. RAITHER, B., CAILLET, J.-F., AND DE SEZE, P. 1990. IDEFIX: A tool for debugging Ada tasks in a real-time environment. Technique et Science Informatiques 9, 2, 150-156.
36. RATEL, C., HALBWACHS, N., AND RAYMOND, P. 1991. Programming and verifying critical systems by means of the synchronous data-flow language LUSTRE. In Proceedings of the ACM SIGSOFT '91 Conference on Software for Critical Systems (New Orleans, La., Dec.). ACM, New York, 112-119.
37. RAZOUK, R. R. 1987. A guided tour of P-NUT. Tech. Rep. 86-25, Univ. of California, Irvine, Calif.
38. 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. Parallel Distrib. Syst. 1, 4 (Oct.), 424-441.
39. SMOLKA, S. A. 1984. Analysis of communicating finite state processes. Ph.D. thesis, Tech. Rep. CS-84-05, Dept. of Computer Science, Brown Univ., Providence, R.I.
40. SUNSHINE, C. A., (ED.). 1981. Communication Protocol Modeling. Artech House, Dedham, Mass.
41. TAI, K. C., CARVER, R. H., AND OBAID, E. E. 1991. Debugging concurrent Ada programs by deterministic execution. IEEE Trans. Softw. Eng. 17, 1 (Jan.), 45-63.
42. TAYLOR, R. N. 1983a. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica 19, 57-84.
43. TAYLOR, R. N. 1983b. A general-purpose algorithm for analyzing concurrent programs. Commun. ACM 26, 5 (May), 362-376.
44. TAYLOR, R. N. 1984. Debugging real-time software in a host-target environment. Technique et Science Informatiques 3, 4, 281-288.
45. TAYLOR, R. N. AND JOHNSON, G. F. 1993. Separations of concerns in the Chiron-1 user interface development and management system. In Proceedings of the Conference on Human Factors in Computing Systems (Amsterdam, Apr.). ACM, New York, 367-374.
46. TAYLOR, R. N., LEVINE, D. L., AND KELLY, C. D. 1992. Structural testing of concurrent programs. IEEE Trans. Softw. Eng. 18, 3 (Mar.), 206-215.
47. VALMARI, A. 1990. A stubborn attack on state explosion. In Computer-Aided Verification, 2nd International Conference Proceedings. Lecture Notes in Computer Science, vol. 531. Springer-Verlag, Berlin, 156-165.
48. WAMPLER, G. K. 1985. Static concurrency analysis of Ada programs. Master's thesis, Univ. of California, Irvine, Calif.
49. WEISS, S. N. 1988. A formal framework for the study of concurrent program testing. In Proceedings of the 2nd Workshop on Software Testing, Verification, and Analysis (Banff, Canada, July). ACM/SIGSOFT and IEEE-CS Software Engineering Technical Committee.
50. WILEDEN, J. C., WOLF, A. L., FISHER, C. D., AND TARR, P. L. 1988. PGRAPHITE: An experiment in persistent typed object management. In Proceedings of ACM SIGSOFT '88: 3rd Symposium on Software Development Environments (Boston, Nov.). ACM, New York, 130-142.
51. YEH, W. J. 1993. Controlling state explosion in reachability analysis. Ph.D. thesis, Dept. of Computer Sciences, Purdue Univ., West Lafayette, Ind.
52. YEH, W. J. AND YOUNG, M. 1991. Compositional reachability analysis using process algebra. In Proceedings of the Symposium on Software Testing, Analysis, and Verification (TAV4) (Victoria, British Columbia, Oct.). ACM Press, New York, 49-59.
53. YEH, W. J. AND YOUNG, M. 1993. Compositional reachability analysis of Ada programs using process algebra. Tech. Rep., Software Engineering Research Center, Dept. of Computer Sciences, Purdue Univ., West Lafayette, Ind.