Efficient Composite Data Flow Analysis Applied to Concurrent Programs

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 33, Issue 7, 1998, Pages 51-58

  Naumovich, Gleb ^a   Clarke, Lori A ^a   Osterweil, Leon J ^a  

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

Author keywords

Concurrency; Data flow analysis; Static analysis

Indexed keywords

EID: 0347807438     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/277633.277642     Document Type: Article

References (13)

1. R. Bodik, R. Gupta, and M. L. Soffa. Refining data flow information using infeasible paths. In Proceedings of the 6th European Software Engineering Conference and the 5th ACM SIGSOFT Symposium on Foundations of Software Engineering, pages 361-377, September 1997.
2. M. Dwyer. Data Flow Analysis for Verifying Correctness Properties of Concurrent Programs. PhD thesis, University of Massachusetts, Amherst, 1995.
3. M. Dwyer and L. Clarke. Data flow analysis for verifying properties of concurrent programs. In Proceedings of the Second ACM SIGSOFT Symposium on Foundations of Software Engineering, pages 62-75, December 1994.
4. P. Godefroid and P. Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. In Proceedings of the Third Workshop on Computer Aided Verification, pages 417-428, July 1991.
5. L. H. Holley and B. K. Rosen. Qualified data flow problems. IEEE Transactions on Software Engineering, SE-7(1):60-78, January 1981.
6. G. J. Holzmann, P. Godefroid, and D. Pirottin. Coverage preserving reduction strategies for reachability analysis. In Proceedings of 12th International Conference on Protocol Specification, Testing, and Verification, INWG/IFIP, Orlando, Fl., June 1992.
7. J. E. Hopcroft and J. D. Ullman. Formal Languages and their Relation to Automata. Addison-Wesley, 1969.
8. T. J. Marlowe and B. G. Ryder. Properties of data flow frameworks. Acta Informatica, (28):121-163, 1990.
9. S. P. Masticola, T. J. Marlowe, and B. G. Ryder. Lattice frameworks for multisource and bidirectional data flow problems. ACM Transactions on Programming Languages and Systems, 17(5):777-803, September 1995.
10. G. Naumovich, L. A. Clarke, and L. J. Osterweil. Verification of communication protocols using data flow analysis. In Proc. of the Fourth ACM SIGSOFT Symposium on the Foundations of Software Engineering, pages 93-105, Oct. 1996.
11. G. Naumovich, L. A. Clarke, and L. J. Osterweil. Comparing implementation strategies for composite data flow analysis problems. Technical Report UM-CS-1997-043, University of Massachusetts, Amherst, August 1997.
12. K. M. Olender and L. J. Osterweil. Cecil: A Sequencing Constraint Language for Automatic Static Analysis Generation. IEEE Transactions on Software Engineering, 16(3):268-280, March 1990.
13. A. Valmari. A stubborn attack on state explosion. In E. M. Clarke and R. Kurshan, editors, Computer-Aided Verification, pages 25-41. American Mathematical Society, Providence RI, 1991. Number 3 in DIMACS Series in Discrete Mathematics and Theoretical Computer Science.