The right algorithm at the right time: Comparing data flow analysis algorithms for finite state verification

Proceedings - International Conference on Software Engineering

Volumn 2001-May, Issue , 2001, Pages 37-46

  Cobleigh, Jamieson M ^a   Clarke, Lori A ^a   Osterweil, Leon J ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS ALGORITHMS; COUNTER EXAMPLES; DATA-FLOW ANALYSIS; FAULT FINDING; FINITE STATE VERIFICATION; PROPERTY; PROPERTY ANALYSIS; SOFTWARE ARTEFACTS; FAULT FINDING MODE; REASONING ENGINE; SOFTWARE ARTIFACTS;

DATA FLOW ANALYSIS; ALGORITHMS;

COMPUTER SIMULATION; COMPUTER SOFTWARE MAINTENANCE; COMPUTER SOFTWARE SELECTION AND EVALUATION; DATA FLOW ANALYSIS; OPTIMIZATION; PROGRAM DEBUGGING;

EID: 0035001143     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSE.2001.919079     Document Type: Conference Paper

References (21)

1. P. E. Ammann, P. E. Black, and W. Majurski. Using model checking to generate tests from specifications. In Proc. of the Second IEEEInt. Conf. on Formal Eng. Methods, pages 46-54, Dec. 1998.
2. R. Bharadwaj and C. L. Heitmeyer. Model checking complete requirements specifications using abstraction. Automated Soft. Eng., 6(1):37-68, Jan. 1999.
3. J. Callahan, E Schneider, and S. Easterbrook. Automated software testing using model-checking. In Proc. of the Second SPIN Workshop, Aug. 1996.
4. W. Chan, R. J. Anderson, P. Beame, and D. Notkin. Improving efficiency of symbolic model checking for state-based system requirements. In Proc. of the I998 Int. Symp. on Soft. Testing and Analysis, pages 102-1 12, Mar. 1998.
5. R. Dechter and J. Pearl. Generalized best-first search strategies and the optimality of A*. J. of the Assoc. of Computing Machinery, 32(3):505-536, July 1985.
6. M. B. Dwyer and L. A. Clarke. Data flow analysis for verifying properties of concurrent programs. In Proc. of the Second ACM SIGSOFT Symp. on the Found of Soft. Eng., pages 62-75, Dec. 1994.
7. R. Ford. Concurrent algorithms for real-time memory management. IEEE Software, pages 10-23, Sept. 1988.
8. K. Forester, C. MacFarlane, M. Cameron, and G. Bolcer. Chiron-1 user manual. Arcadia Document UCI-93-07, U. of California, Irvine, Sept. 1993.
9. A. Gargantini and C. Heitmeyer. Using model checking to generate tests from requirements specifications. In Proc. of the Seventh European Soft. Eng. Conf held jointly with the Seventh ACM SIGSOFT Symp. on the Found of Soft.Eng., pages 146162, Sept. 1999.
10. D. Helmbold and D. Luckham. Debugging Ada tasking programs. IEEE Software, 2(2):47-57, Mar. 1985.
11. M. Hind and A. Pioli. Which pointer analysis should I use? In Proc. of the 2000 Int. Symp. on Soft. Testing and Analysis, pages 113-123, Aug. 2000.
12. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, Inc., 1991.
13. H. Iwashita, T. Nakata, and E Hirose. CTL model checking based on forward state traversal. In Proc. of the 1996 IEEWACM Int. Conf. on Computer-Aided Design, pages 82-86, Nov. 1996.
14. D. Liang and M. J. Harmld. Efficient points-to analysis for whole-program analysis. In Proc. of the Seventh European Soft. Eng. Conf. held jointly with the Seventh ACM SIGSOFT Symp. on the Found. of Soft. Eng., pages 199-215, Sept. 1999.
15. T. J. Marlowe and B. G. Ryder. Properties of data flow frameworks: A unified model. Acta Infomatica, 28:121-163, 1990.
16. K. L. McMillan. Symbolic Model Checking:An Approach to the State Explosion Problem. Kluwer Academic Publishers, 1993.
17. G. Naumovich and G. S. Avrunin. A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel. In Proc. of the Sixth ACM SIGSOFT Symp. on the Found of Soft.Eng., pages 24-34, Nov. 1998.
18. G. Naumovich, G. S. Avrunin, and L. A. Clarke. Data flow analysis for checking properties of concurrent Java programs. In Proc. of the 2Znd Int. Conf. on Soft. Eng., pages 399410, May 1999.
19. G. Naumovich, L. A. Clarke, and L. J. Osterweil. Verification of communication protocols using data flow analysis. In Proc. of the Fourth ACM SIGSOFT Symp. on the Found. of Soft.Eng., pages 93-105, Oct. 1996.
20. G. Naumovich, L. A. Clarke, and L. J. Osterweil. Efficient composite data flow analysis applied to concurrent programs. In Proc. of the ACM SIGPLAN-SIGSOFT Workshop on Prog. Analysis For Soft. Tools and Eng., pages 51-58, June 1998.
21. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.