Symbolic execution of program paths involving pointer and structure variables

Proceedings - Fourth International Conference on Quality Software, QSIC 2004

Volumn , Issue , 2004, Pages 87-92

  Zhang, Jian ^a  

^a INSTITUTE OF SOFTWARE   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC DOMAIN REDUCTION (DDR); FLOW GRAPHS; PATH CONDITIONS (PC); SYMBOLIC EXECUTION;

ALGORITHMS; AUTOMATION; BENCHMARKING; CONSTRAINT THEORY; DATA REDUCTION; GRAPH THEORY; INFORMATION ANALYSIS; LINEAR PROGRAMMING; POLYNOMIALS; SEMANTICS;

COMPUTER SOFTWARE;

EID: 14044260005     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. A.V. Aho, R. Sethi and J.D. Ullman, Compilers: Principles, Techniques and Tools, Addison-Wesley, 1986.
2. R.S. Boyer, B. Elspas and K.N. Levitt, SELECT - a formal system for testing and debugging programs by symbolic execution, Proc. of the Int. conf. on Reliable Software, 234-245, 1975.
3. W.R. Bush, J.D. Pincus and D.J. Sielaff, A static analyzer for finding dynamic programming errors, Software - Practice and Experience, 30: 775-802, 2000.
4. L.A. Clarke, A system to generate test data and symbolically execute programs, IEEE Trans. Software Eng. 2(3): 215-222, 1976.
5. E.W. Dijkstra, A Discipline of Programming, Prentice-Hall, 1976.
6. J. Elgaard, A. Møller and M.I. Schwartzbach, Compile-time debugging of C programs working on trees, Proc. European Symp. on Programming (ESOP), LNCS 1782, 119-134, 2000.
7. E.L. Gunter and D. Peled, Path exploration tool, Proc. of the 5th Int'l Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), LNCS 1579, 405-419, 1999.
8. N. Gupta, A.P. Mathur and M.L. Soffa, Automated test data generation using an iterative relaxation method, Proc. of Int. Symp. on Foundations of Software Engineering (FSE), 231-244, 1998.
9. D. Hedley and M. A. Hennell, The causes and effects of infeasible paths in computer programs, Proc. 8th Int. Conf. on Software Engineering, 259-266, 1985.
10. M. Hind and A. Pioli, Which pointer analysis should I use?, Proc. Int. Symp. on Software Testing and Analysis (ISSTA), 113-123, 2000.
11. R.A. Kemmerer and S.T. Eckmann, UNISEX: a UNIx-based Symbolic EXecutor for Pascal, Software - Practice and Experience, 15(5): 439-458, 1985.
12. J.C. King, Symbolic execution and testing, Comm. of the ACM, 19(7): 385-394, 1976.
13. T. Lev-Ami, T. Reps, M. Sagiv and R. Wilhelm, Putting static analysis to work for verification: A case study, Proc. Int. Symp. on Software Testing and Analysis (ISSTA), 26-38, 2000.
14. A.J. Offutt, Z. Jin and J. Pan, The dynamic domain reduction procedure for test data generation, Software - Practice and Experience, 29(2): 167-193, 1999.
15. D.F. Yates and N. Malevris, Reducing the effects of infeasible paths in branch testing, ACM SIGSOFT Soft. Eng. Notes, 14(8): 48-54, 1989.
16. J. Zhang and X. Wang, A constraint solver and its application to path feasibility analysis, Int. J. of Software Engineering and Knowledge Engineering, 11(2): 139-156, 2001.