Graph Models for Reachability Analysis of Concurrent Programs

ACM Transactions on Software Engineering and Methodology (TOSEM)

Volumn 4, Issue 2, 1995, Pages 171-213

  Pezzè, Mauro ^a   Taylor, Richard N ^b   Young, Michal ^c  

^a POLITECNICO DI MILANO   (Italy)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c PURDUE UNIVERSITY   (United States)

Author keywords

Ada tasking; process algebra; static analysis

Indexed keywords

CONCURRENT ENGINEERING; FINITE ELEMENT METHOD; GRAPH THEORY; PETRI NETS; SOFTWARE ENGINEERING; SYSTEMS ENGINEERING;

CONCURRENT PROGRAMS; GRAPH MODELS;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 0029280426     PISSN: 1049331X     EISSN: 15577392     Source Type: Journal    
DOI: 10.1145/210134.210180     Document Type: Article

References (68)

1. APPELBE, B., SMITH, K., AND MCDOWELL, C. 1989. Start/pat: A parallel-programming toolkit. IEEE Softw. 6, 4 (July), 29-38.
2. APT, K. R. 1983 A static analysis of CSP programs. In Proceedings of the Workshop on Program Logic (Pittsburgh, Pa., June). Lecture Notes in Computer Science, vol. 164. Springer-Verlag, New York. Published in 1984.
3. AUTANT, C., BELMESK, Z., AND SCHNOEBELEN, P. 1991. Strong bisimilarity on nets revisited. In PARLE '91, Parallel Architectures and Languages Europe (Eindhoven, The Netherlands, June). Lecture Notes in Computer Science, vol. 506. Springer-Verlag. Berlin, 295-312.
4. AVRUNIN, G. S., BUY, U. A., CORBETT, J. C., DILLON, L. K., AND WILEDEN, J. C. 1991. Automated analysis of concurrent systems with the constrained expression toolset. IEEE Trans. Softw. Eng. 17, 11 (Nov.), 1204-1222.
5. 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.
6. 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.
7. BEAVEN, M., ELMORE, B., MARINESCU, D. C., AND STANSIFER, R. 1991 VERT-verification of real-time programs. In Proceedings of the 15th Annual International Computer Software and Applications Conference (Sept.). IEEE Computer Society Press, Los Alamitos, Calif., 618-625.
8. BEAVEN, M., MARINESCU, D. C., AND STANSIFER, R. 1992 Modeling concurrent programs with colored Petri nets. Tech. Rep. CRPDC-92-4, Center for Research in Parallel and Distributed Computing, Dept of Computer Sciences, Univ of North Texas, Denton, Tex. Feb.
9. BERGSTRA, J. A. AND KLOP, J. W. 1984. Process algebra for synchronous communication. Inf. Contr. 60, 109-137.
10. 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.
11. BRYANT, R. E. Graph-based algorithms for boolean function manipulations. IEEE Trans. Comput. C-35, 8, 677-691.
12. BURCH, J. R., CLARKE, E. M., MCMILLAN, K. L., DILL, D. L., AND HWANG, L. J. 1990. Symbolic model checking: 1020 states and beyond In Proceedings of the 5th Annual Symposium on Logic in Computer Science (June). IEEE Computer Society Press, Los Alamitos, Calif.
13. CLARKE, E. M., EMERSON, E. A., AND SISTLA, A. P. 1986. Automatic verification of finite-state concurrent systems using temporal logic. ACM Trans. Program. Lang. Syst. 8, 2 (Apr.), 244-263.
14. CLEAVELAND, R, PARROW, J., AND STEFFEN, B. 1990 A semantics-based verification tool for finite-state systems. In Protocol Specification, Testing, and Verification, IX. North-Holland, Amsterdam. 287-302.
15. CLEAVELAND, R., PARROW, J., AND STEFFEN, B. 1991. The concurrency workbench: A semantics based tool for the verification of concurrent systems. In Proceedings of the Workshop on Automatic Verification Methods for Finite State Machines (Feb.). Lecture Notes in Computer Science, vol. 407. Springer-Verlag, New York, 24-37.
16. CORBETT, J. C. 1994. An empirical evaluation of three methods for deadlock analysis of Ada tasking programs. In Proceedings of the 1994 International Symposium on Software Testing and Analysis (ISSTA) (Seattle, Wash., Aug.). ACM, New York, 204-215.
17. DWYER, M. AND CLARKE, L. 1994. Data flow analysis for verifying properties of concurrent programs. In Proceedings of the 2nd ACM SIGSOFT Symposium on Foundations of Software Engineering (New Orleans, La., Dec.). ACM, New York, 62-75.
18. DWYER, M., CLARKE, L., AND NIES, K. 1995. A compact Petri net representation for concurrent programs. In Proceedings of the 17th International Conference on Software Engineering (ICSE 17) (Seattle, Wash., Apr.) IEEE Computer Society Press, Los Alamitos, Calif. To be published.
19. ENDERS, R., FILKORN, T., AND TAUBNER, D. 1991. Generating BDDs for symbolic model checking in CCS. In Proceedings of the 3rd Workshop on Computer Aided Verification. Lecture Notes in Computer Science, vol. 531. Springer-Verlag, New York, 263-278.
20. FERNANDEZ, J.-C. 1988. Aldebaran: Un Système de vérification par reduction de processus communicants. Ph.D. thesis, Univ. de Grenoble, Grenoble, France.
21. 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.
22. FORESTER, K. 1991. TIG-based Petri nets for modeling Ada tasking. Master's thesis, Dept. of Computer and Information Science, Univ. of Massachusetts, Amherst, Mass. June. Available as COINS Tech. Rep. 91-69.
23. 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. B. P. Miller and C. McDowell, Eds. ACM SIGPLAN Not. 26, 12, 76-84.
24. HENNESSY, M. 1988. Algebraic Theory of Processes MIT Press, Cambridge, Mass.
25. HOARE, C. A. R. 1985. Communicating Sequential Processes. Prentice-Hall International, London.
26. HOLZMANN, G. J. 1987. Automated protocol validation in Argos: Assertion proving and scatter searching. IEEE Trans. Softw. Eng. SE-13, 6 (June), 683-696.
27. HOLZMANN, G. J. 1991. Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs, N.J.
28. KARP, R. M. AND MILLER, R. E. 1969. Parallel program schemata. J. Comput. Syst. Sci. 3, (May).
29. KELLER, J. 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 Society Press, Los Alamitos, Calif., 208-218.
30. 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., Apr.). ACM, New York, 214-223.
31. 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). 44-52.
32. LONG, D. L. 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, Oct.). ACM Press, New York, 21-35.
33. MALHORTA, J., SMOLKA, S. A., GIACALONE, A., AND SHAPIRO, R. 1990. Winston-a tool for hierarchical design and simulation of concurrent systems. In Specification and Verification of Concurrent Systems, C. Rattray, Ed. Springer-Verlag, New York, 140-152.
34. MANDHIOLI, D., ZICARI, R., GHEZZI, C., AND TISATO, F. 1985. Modeling the Ada task system by Petri nets. Comput. Lang. 10, 1, 43-61.
35. MASTICOLA, S P. AND RYDER, B. G. 1990 Static infinite wait anomaly detection in polynomial time. Tech Rep. LCSR-TR-141, Dept of Computer Science, Rutgers Univ., Piscataway, N.J. Jan.
36. 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, B. P. Miller and C. McDowell, Eds. SIGPLAN Not. 26, 12, 97-107.
37. MCDOWELL, C. E. 1989. A practical algorithm for static analysis of parallel programs. J. Parallel Distrib. Comput. 6, 515-536.
38. MESEGUER, J. AND MONTANARI, U. 1990. Petri nets are monoids. Inf. Comput. 88, 105-155.
39. MILNER, R. 1980. A Calculus of Communicating Systems. Lecture Notes in Computer Science, vol 92. Springer-Verlag, New York
40. MILNER, R. 1989 Communication and Concurrency. Prentice-Hall International, London.
41. MORASCA. S. AND PEZZÉ, M. 1989. Validation of concurrent Ada programs using symbolic execution. In ESEC '89 2nd European Software Engineering Conference. Lecture Notes in Computer Science, vol 387. Springer-Verlag, Berlin, 469-486.
42. 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.
43. MURATA, T. 1989 Petri nets: Properties, analysis, and applications Proc IEEE 77, 4 (Apr.), 541-580.
44. OLDEROG, E.-R. 1989 Strong bisimilarity on nets: A new concept for comparing net semantics. In Lecture Notes in Computer Science Vol. 222. Springer-Verlag, New York, 549-573.
45. PETERSON, J. 1989. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs, N.J.
46. PEZZE, M. AND YOUNG, M. 1995. Complexity of recognizing deadlocked states in the TIC model of Ada tasking Tech Rep., Software Engineering Research Center, Dept. of Computer Science. Purdue Univ., West Lafayette, Ind. Also available as http://www.cs.purdue.edu/people/voung/papers.
47. 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.
48. REISIG, W. 1985 Petri Nets. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, New York.
49. SHATZ, S M AND CHENG, W K. 1988 A Petri net framework for automated static analysis of Ada tasking behavior J. Syst. Softw. 8, (Dec.), 343-359.
50. 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.
51. SHENKER, B., MURATA, T., AND SHATZ, S. M. 1986. Use of Petri net invariants to detect static deadlocks in Ada programs. In Proceedings of the Fall Joint Computer Conference (Nov) IEEE Computer Society Press, Los Alamitos, Calif., 1072-1081.
52. See also IEEE Trans. Softw Eng 15, 3 (Mar), 314-326.
53. SMOLKA, S. A 1984. Analysis of communicating finite state processes. Ph.D. thesis, Computer Science Tech. Rep. CS-84-05., Dept of Computer Science, Brown Univ, Providence, R.I.
54. STANSIFER, R. 1992. Critical paths and bisimulation for colored Petri nets. Tech. Rep., Dept. of Computer Sciences, Center for Research in Parallel and Distributed Computing, Univ. of North Texas, Denton, Tex.
55. SUNSHINE, C. A., Ed. 1986. Communication Protocol Modeling. Artech House, Dedham, Mass
56. TAYLOR, R. N. 1983a. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica 19. 57-84.
57. TAYLOR, R. N. 1983b. A general-purpose algorithm for analyzing concurrent programs. Commun. ACM 26, 5 (May), 362-376.
58. 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 Computer Systems (Amsterdam, Apr.). ACM, New York, 367-374
59. 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.
60. WINSKEL, G. 1984. A new definition of morphism on Petri nets. In STACS 84, Symposium of Theoretical Aspects of Computer Science (Paris, Apr.). Lecture Notes in Computer Science, vol. 166. Springer-Verlag, Berlin, 140-150.
61. WINSKEL, G. 1987. Petri nets, algebras, morphism, and compositionality. Inf. Comput. 72, 197-238.
62. WOLPER, P. 1986. Specifying interesting properties of programs in propositional temporal logics. In Proceedings of the 13th ACM Symposium on Principles of Programming Languages (St. Petersburg, Fla., Jan.). ACM, New York, 184-193.
63. YEH, W. J. 1993. Controlling state explosion in reachability analysis. Ph.D. thesis, Dept. of Computer Science, Purdue Univ., West Lafayette, Ind. Dec.
64. 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.
65. YEH, W. J. AND YOUNG, M. 1993. Compositional reachability analysis of Ada programs using process algebra. Tech. Rep., Dept. of Computer Science, Software Engineering Research Center, Purdue Univ., West Lafayette, Ind. July.
66. YEH, W. J. AND YOUNG, M. 1994. Redesigning tasking structures of Ada programs for analysis: A case study. Softw. Test. Verif. Rel. 4, (Dec.), 223-253.
67. YOUNG, M. 1988. How to leave out details: Error-preserving abstractions of state-space models. [n Proceedings of the 2nd Workshop on Software Testing, Verification, and Analysis (Banff, Canada, July). IEEE Computer Society Press, Los Alamitos, Calif., 63-70
68. YOUNG, M., TAYLOR, R. N., LEVINE, D. L., FORESTER, K., AND BRODBECK, D. 1995. A concurrency analysis tool suite for Ada programs: Rationale, design, and preliminary experience. ACM Trans. Softw. Eng. Meth. 4, 1 (Jan.), 65-106.