Flow analysis for verifying properties of concurrent software systems

ACM Transactions on Software Engineering and Methodology

Volumn 13, Issue 4, 2004, Pages 359-430

  Dwyer, Matthew B ^a,d   Clarke, Lori A ^b,e   Cobleigh, Jamieson M ^b,e   Naumovich, Gleb ^c,f  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^b UNIVERSITY OF MASSACHUSETTS   (United States)

^c Polytechnic University   (United States)

^d UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^e Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^f POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Dataflow analysis; Finite state verification; Model checking

Indexed keywords

CONCURRENT PROGRAMMING-PARALLEL PROGRAMMING; FINITE-STATE VERIFICATION; MODEL CHECKING; SOFTWARE/PROGRAM VERIFICASTION;

ALGORITHMS; BEHAVIORAL RESEARCH; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; COSTS; DATA FLOW ANALYSIS; MATHEMATICAL MODELS; POLYNOMIALS; THEOREM PROVING;

SOFTWARE ENGINEERING;

EID: 12344305541     PISSN: 1049331X     EISSN: None     Source Type: Journal    
DOI: 10.1145/1040291.1040292     Document Type: Article

References (78)

1. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA.
2. 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. Engin. 17, 11 (Nov.), 1204-1222.
3. AVRUNIN, G. S., CORBETT, J. C., DWYER, M. B., PǍSǍREANU, C. S., AND SIEGEL, S. F. 1999. Comparing finite-state verification techniques for concurrent software. TR 99-69, University of Massachusetts, Department of Computer Science. (Nov.).
4. BALL, T. AND RAJAMANI, S. K. 2001. Automatically validating temporal safety properties of interfaces. In Proceedings of the 8th SPIN Workshop, M. B. Dwyer, Ed. Lecture Notes in Computer Science, vol. 2057. 101-122.
5. BOUWENS, C., MCKENZIE, R., AND DEAN, C. 1996. Investigating static data flow analysis for advanced distributed simulation verification. In Proceedings of the 15th Workshop in the Interoperability of Distributed Interactive Simulation. 473-478.
6. BRYANT, R. E. 1992. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24, 3 (Sept.), 293-318.
7. CHAMILLARD, A. T., CLARKE, L. A., AND AVRUNIN, G. S. 1996. An empirical comparison of static concurrency analysis techniques. TR 96-84, University of Massachusetts, Department of Computer Science. (May).
8. CHEUNG, S.-C. AND KRAMER, J. 1993. Tractable flow analysis for anomaly detection in distributed programs. In Proceedings of the 4th European Software Engineering Conference, I. Sommerville and M. Paul, Eds. Lecture Notes in Computer Science, vol. 717. 283-300.
9. CHEUNG, S.-C. AND KRAMER, J. 1996. Context constraints for compositional reachability analysis. ACM Trans. Softw. Engin. Method. 5, 4 (Oct.), 334-377.
10. CLARKE, JR., E. M., GRUMBERG, O., AND PELED, D. A. 1999. Model Checking. MIT Press, Cambridge, MA.
11. CLEAVELAND, R., PARROW, J., AND STEFFEN, B. 1993. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Trans. Program. Lang. Syst. 15, 1 (Jan.), 36-72.
12. CLICK, C. AND COOPER, K. D. 1995. Combining analyses, combining optimizations. ACM Trans. Program. Lang. Syst. 77, 2 (March), 181-196.
13. COBLEIGH, J. M., CLARKE, L. A., AND OSTERWEIL, L. J. 2001. The right algorithm at the right time: Comparing data flow analysis algorithms for finite state verification. In Proceedings of the 23rd International Conference on Software Engineering. 37-46.
14. COBLEIGH, J. M., GIANNAKOPOULOU, D., AND PǍSǍREANU, C. S. 2003. Learning assumptions for compositional verification. In Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, H. Garavel and J. Hatcliff, Eds. Lecture Notes in Computer Science, vol. 2619. 331-346.
15. CORBETT, J. C. AND AVRUNIN, G. S. 1994. Towards scalable compositional analysis. In Proceedings of the 2nd ACM SIGSOFT Symposium on the Foundations of Software Engineering. 53-61.
16. CORBETT, J. C. AND AVRUNIN, G. S. 1995. Using integer programming to verify general safety and liveness properties. Form. Meth. Syst. Des. 6, 1 (Jan.), 97-123.
17. CORBETT, J. C., DWYER, M. B., HATCLIFF, J., LAUBACH, S., PǍSǍREANU, C. S., ROBBY, AND ZHENG, H. 2000. Bandera: Extracting finite-state models from Java source code. In Proceedings of the 22nd International Conference on Software Engineering. 439-448.
18. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the 4th ACM Symposium on Principles of Programming Languages. 238-252.
19. DEMARTINI, C., IOSIF, R., AND SISTO, R. 1999. A deadlock detection tool for concurrent Java programs. Softw.-Prac. Exper. 29, 7 (June), 577-603.
20. DIJKSTRA, E. W. 1976. A Discipline of Programming. Prentice Hall, Englewood Cliffs, NJ.
21. DURI, S., BUY, U., DEVARAPALLI, R., AND SHATZ, S. M. 1993. Using state space reduction methods for deadlock analysis in Ada tasking. In Proceedings of the 1993 International Symposium on Software Testing and Analysis. 51-60.
22. DWYER, M. B. 1995. Data flow analysis for verifying correctness properties of concurrent programs. Ph.D. thesis, University of Massachusetts, Amherst.
23. DWYER, M. B. 1997. Modular flow analysis for concurrent software. In Proceedings of the 12th IEEE International Conference on Automated Software Engineering. 264-273.
24. DWYER, M. B., AVRUNIN, G. S., AND CORBETT, J. C. 1999. Patterns in property specifications for finite-state verification. In Proceedings of the 21st International Conference on Software Engineering. 16-22.
25. DWYER, M. B. AND CLARKE, L. A. 1994. Data flow analysis for verifying properties of concurrent programs. In Proceedings of the 2nd ACM SIGSOFT Symposium on the Foundations of Software Engineering. 62-75.
26. DWYER, M. B., HATCLIFF, J., JOEHANES, R., LAUBACH, S., PǍSǍREANU, C. S., ROBBY, VISSER, W., AND ZHEN, H. 2001. Tool-supported program abstraction for finite-state verification. In Proceedings of the 23rd International Conference on Software Engineering. 177-187.
27. FLANAGAN, C., LEINO, K. R. M., LILLIBRIDGE, M., NELSON, G., SAXE, J. B., AND STATA, R. 2002. Extended static checking for Java. In Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation. 234-245.
28. GRAF, S. AND SAÏDI, H. 1997. Construction of abstract state graphs with PVS. In Proceedings of the 9th International Conference on Computer-Aided Verification, O. Grumberg, Ed. Lecture Notes in Computer Science, vol. 1254. 72-83.
29. HECHT, M. S. 1977. Flow Analysis of Computer Programs. The Computer Science Library Programming Language Series. Elsevier, North-Holland.
30. HELMBOLD, D. AND LUCKHAM, D. 1985. Debugging Ada tasking programs. IEEE Softw. 2,2 (March), 47-57.
31. HENZINGER, T. A., JHALA, R., MAJUMDAR, R., AND SUTRE, G. 2002. Lazy abstraction. In Proceedings of the 29th ACM Symposium on Principles of Programming Languages. 58-70.
32. HOARE, C. A. R. 1969. An axiomatic basis for computer programming. Comm. ACM 12, 10 (Oct.), 576-580.
33. HOLLEY, L. H. AND ROSEN, B. K. 1981. Qualified data flow problems. IEEE Trans. Softw. Engin. SE-7, 1 (Jan.), 60-78.
34. HOLZMANN, G. J. 1997. The model checker SPIN. IEEE Trans. Softw. Engin. 23, 5 (May), 279-295.
35. HOLZMANN, G. J. 2000. Logic verification of ANSI-C code with SPIN. In Proceedings of the 7th SPIN Workshop, K. Havelund, J. Penix, and W. Visser, Eds. Lecture Notes in Computer Science, vol. 1885. 131-147.
36. HOWDEN, W. E. 1986. A functional approach to program testing and analysis. IEEE Trans. Softw. Engin. SE-12, 10 (Oct.), 997-1005.
37. HUISMAN, M., JACOBS, B., AND VAN DEN BERG, J. 1999. A case study in class library verification: Java's Vector class. In Object-Oriented Technology: ECOOP'99 Workshop Reader, A. M. D. Moreira and S. Demeyer, Eds. Lecture Notes in Computer Science, vol. 1743. 109-110.
38. JACKSON, D. AND VAZIRI, M. 2000. Finding bugs with a constraint solver. In Proceedings of the 2000 International Symposium on Software Testing and Analysis. 14-21.
39. JOHNSON, S. C. 1978. Lint, a C program checker. In Unix Programmer's Manual, AT&T Bell Laboratories.
40. 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. 208-218.
41. MANNA, Z. AND PNUELI, A. 1991. The Temporal Logic of Reactive and Concurrent Systems: Specification, Springer-Verlag.
42. MARLOWE, T. J. AND RYDER, B. G. 1990. Properties of data flow frameworks. Acta Infomat. 28, 2, 121-163.
43. MASTICOLA, S. P. 1993. Static detection of deadlocks in polynomial time. Ph.D. thesis, Rutgers University.
44. MASTICOLA, S. P., MARLOWE, T. J., AND RYDER, B. G. 1995. Lattice frameworks for multiscore and bidirectional data flow problems. ACM Trans. Program. Lang. Syst. 17, 5 (Sept.), 777-803.
45. MASTICOLA, S. P. AND RYDER, B. G. 1991. A model of Ada programs for static deadlock detection in polynomial time. In Proceedings of Workshop on Parallel and Distributed Debugging. 97-107.
46. MASTICOLA, S. P. AND RYDER, B. G. 1993. Non-concurrency analysis. In Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 129-138.
47. MCMILLAN, K. L. 1993. Symbolic Model Checking. Kluwer Academic Publishers.
48. MILNER, R. 1989. Communication and Concurrency. Prentice-Hall.
49. MÜLLER-OLM, M., SCHMIDT, D. A., AND STEFFEN, B. 1999. Model-checking: A tutorial introduction. In Proceedings of Static Analysis, Sixth International Symposium, A. Cortesi and G. Filé, Eds. Lecture Notes in Computer Science, vol. 1694. 330-354.
50. NAUMOVICH, G. AND AVRUNIN, G. S. 1998. A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel. In Proceedings of the 6th ACM SIGSOFT Symposium on the Foundations of Software Engineering. 24-34.
51. NAUMOVICH, G., AVRUNIN, G. S., AND CLARKE, L. A. 1999a. Data flow analysis for checking properties of concurrent Java programs. In Proceedings of the 21st International Conference on Software Engineering. 399-410.
52. NAUMOVICH, G., AVRUNIN, G. S., AND CLARKE, L. A. 1999b. An efficient algorithm for computing MHP information for concurrent Java programs. In Proceedings of the 7th European Software Engineering Conference held jointly with the 7th ACM SIGSOFT Symposium on the Foundations of Software Engineering, O. Nierstrasz and M. Lemoine, Eds. Lecture Notes in Computer Science, vol. 1687. 338-354.
53. NAUMOVICH, G., AVRUNIN, G. S., CLARKE, L. A., AND OSTERWEIL, L. J. 1997. Applying static analysis to software architectures. In Proceedings of the 6th European Software Engineering Conference held jointly with the 5th ACM SIGSOFT Symposium on the Foundations of Software Engineering, M. Jazayeri and H. Schauer, Eds. Lecture Notes in Computer Science, vol. 1301. 77-93.
54. NAUMOVICH, G. AND CLARKE, L. A. 2000. Classifying properties: An alternative to the safety-liveness classification. In Proceedings of the 8th ACM SIGSOFT Symposium on the Foundations of Software Engineering. 159-168.
55. NAUMOVICH, G., CLARKE, L. A., AND COBLEIGH, J. M. 1999. Using partial order techniques to improve performance of data flow analysis based verification. In Proceedings of the ACM SIGPLANSIGSOFT Workshop on Program Analysis For Software Tools and Engineering. 57-65.
56. NAUMOVICH, G., CLARKE, L. A., AND OSTERWEIL, L. J. 1996. Verification of communication protocols using data flow analysis. In Proceedings of the 4th ACM SIGSOFT Symposium on the Foundations of Software Engineering. 93-105.
57. NAUMOVICH, G., CLARKE, L. A., AND OSTERWEIL, L. J. 1998. Efficient composite data flow analysis applied to concurrent programs. In Proceedings of the ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering. 51-58.
58. NETZER, R. H. B. AND MILLER, B. P. 1990. Detecting data races in parallel program executions. In Proceedings of Languages and Compilers for Parallel Computing, Fourth International Workshop. 109-129.
59. OLENDER, K. M. AND OSTERWEIL, L. J. 1990. Cecil: A sequencing constraint language for automatic static analysis gereration. IEEE Trans. Softw. Engin. 16, 3 (March), 268-280.
60. OLENDER, K. M. AND OSTERWEIL, L. J. 1992, Interprocedural static analysis of sequencing constraints. ACM Trans. Softw. Engin. Method. 1, 1 (Jan.), 21-52.
61. OSTERWEIL, L. J. AND FOSDICK, L. D. 1976. DAVE - a validation error detection and documentation system for Fortran programs. Softw.-Prac. Exper. 6, 4 (Oct.-Dec.), 473-486.
62. PELED, D. 1998. Ten years of partial order reduction. In Proceedings of the 10th International Conference on Computer-Aided Verification, A. J. Hu and M. Y. Vardi, Eds. Lecture Notes in Computer Science, vol. 1427. 17-28.
63. RAMALINGAM, G. 2000. Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst. 22, 2 (March), 416-430.
64. REPS, T. W., HORWITZ, S., AND SAGIV, S. 1995. Precise interprocedural dataflow analysis via graph reachability. In Proceedings of the 22nd ACM Symposium, on Principles of Programming Languages. 49-61.
65. RYDER, B. G. 1974. The PFORT verifier. Softw.-Prac. Exper. 4, 4 (Oct.-Dec.), 359-377.
66. SALCIANU, A. AND RINARD, M. C. 2001. Pointer and escape analysis for multithreaded programs. In Proceedings of the 2001 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 12-23.
67. SCHMIDT, D. A. 1998. Data flow analysis is model checking of abstract interpretations. In Proceedings of the 25th ACM Symposium on Principles of Programming Languages. 38-48.
68. SCIENCE APPLICATIONS INTERNATIONAL CORPORATION. 1997. Advanced interoperability technology development: Investigating static data flow analysis for advanced distributed simulation verification. Tech. rep., SAIC. (May).
69. SMITH, R. L., AVRUNIN, G. S., CLARKE, L. A., AND OSTERWEIL, L. J. 2002. Propel: An approach supporting property elucidation. In Proceedings of the 24th International Conference on Software Engineering. 11-21.
70. SPIVEY, J. M. 1992. The Z Notation: A Reference Manual, 2nd ed. Prentice-Hall.
71. TAN, J., AVRUNIN, G. S., AND CLARKE, L. A. 2004. Heuristic-based model refinement for FLAVERS. In Proceedings of the 26th International Conference on Software Engineering. 635-644.
72. TAN, J., AVRUNIN, G. S., CLARKE, L. A., ZILBERSTEIN, S., AND LEUE, S. 2004. Heuristic-guided counterexample search in FLAVERS. In Proceedings of the 12th ACM SIGSOFT Symposium on the Foundations of Software Engineering 201-210.
73. TAYLOR, R. N. 1983a. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informat. 19, 1 (April), 57-84.
74. TAYLOR, R. N. 1983b. A general-purpose algorithm for analyzing concurrent programs. Comm. ACM 26, 5 (May), 362-376.
75. TAYLOR, R. N., BELZ, F. C., CLARKE, L. A., OSTERWEIL, L. J., SELBY, R. W., WILEDEN, J. C., WOLF, A. L., AND YOUNG, M. 1988. Foundations for the Arcadia environment architecture. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments. 1-13.
76. VISSER, W., HAVELUND, K., BRAT, G., AND PARK, S.-J. 2000. Model checking programs. In Proceedings of the 15th IEEE International Conference on Automated Software Engineering. 3-12.
77. YEH, W. J. AND YOUNG, M. 1991. Compositional reachability analysis using process algebra. In Proceedings of the 1991 Symposium on Testing, Analysis, and Verification. 49-59.
78. YOUNG, M., TAYLOR, R. N., LEVINE, D. L., NIES, K. A., AND BRODBECK, D. 1995. A concurrency analysis tool suite for Ada programs: Rational, design, and preliminary experience. ACM Trans. Softw. Engin. Method. 4, 1 (Jan.), 65-106.