A constraint solver and its application to path feasibility analysis

International Journal of Software Engineering and Knowledge Engineering

Volumn 11, Issue 2, 2001, Pages 139-156

  Zhang, Jian ^a   Wang, Xiaoxu ^a  

^a INSTITUTE OF SOFTWARE   (China)

Author keywords

Arrays; Constraint solving; Infeasible paths; Test data generation

Indexed keywords

ALGORITHMS; ARRAYS; BOOLEAN ALGEBRA; LINEAR PROGRAMMING; PROBLEM SOLVING; SET THEORY;

CONSTRAINT SOLVING; INFEASIBLE PATHS; PROGRAM TESTING; TEST DATA GENERATION;

CONSTRAINT THEORY;

EID: 0347137957     PISSN: 02181940     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218194001000487     Document Type: Article

References (27)

1. D. Hedley and M. A. Hennell, "The causes and effects of infeasible paths in computer programs", Proc. 8th Int. Conf. on Software. Engineering (1985), pp. 259-266.
2. E. J. Weyuker, "An empirical study of the complexity of data flow testing", Proc. 2nd Workshop on Software Testing, Verification and Analysis, Banff, Alberta, Canada (1988), pp. 188-195.
3. B. Korel and A. M. Al-Yami, "Assertion-oriented automated test data generation", Proc. 18th Int. Conf. on Software Engineering (1996), pp. 71-80.
4. A. Bertolino and M. Marré, "Automatic generation of path covers based on the control flow analysis of computer programs", IEEE Trans. Softw. Eng. SE-20 (1994) 885-899.
5. E. Weyuker, "Translatability and decidability questions for restricted classes of program schemas", SIAM J. on Computing 8 (1979) 587-598.
6. L. J. White and E. I. Cohen, "A domain strategy for computer program testing", IEEE Trans. Softw. Eng. SE-6 (1980) 247-257.
7. L. A. Clarke and D. J. Richardson, "Symbolic evaluation methods - Implementations and applications", in Computer Program Testing, eds. B. Chandrasekaran and S. Radicchi (North-Holland, Amsterdam, 1981), pp. 65-102.
8. R. A. DeMillo and A. J. Offutt, "Constraint-based automatic test data generation", IEEE Trans. Softw. Eng. SE-17 (1991) 900-910.
9. A. K. Mackworth, "Constraint satisfaction," in Encyclopedia of Artificial Intelligence, (ed.) S. C. Shapiro, Vol. 1 (John Wiley, New York, 1990), pp. 205-211.
10. P. R. Thie, An Introduction to Linear Programming and Game Theory (John Wiley, New York, 1979).
11. P. D. Coward, "Symbolic execution and testing", Information and Software Technology 33 (1991) 53-64.
12. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, San Francisco, 1979).
13. J. Zhang, "Specification analysis and test data generation by solving Boolean combinations of numeric constraints", Proc. First Asia-Pacific Conference on Quality Software, Hong Kong (Oct. 2000), pp. 267-274.
14. B. Korel and S. Yalamanchili, "Forward computation of dynamic program slices", Proc. Int'l Symp. on Software Testing and Analysis (ISSTA '94), Seattle, Washington, USA (1994), pp. 66-79.
15. R. Ferguson and B. Korel, "The chaining approach for software test data generation", ACM Trans, on Softw. Eng. and Methodology 5 (1996) 63-86.
16. A. Gotlieb, B. Botella and M. Rueher, "Automatic test data generation using constraint solving techniques", Proc. Int'l Symp. on Software Testing and Analysis (ISSTA '98), Clearwater Beach, Florida, USA (1998), pp. 53-62.
17. N. Tracey, J. Clark, and K. Mander, "Automated program flaw finding using simulated annealing", Proc. Int'l Symp. on Software Testing and Analysis (1998), pp. 73-81.
18. B. Korel and J. Laski, "STAD - A system for testing and debugging: User perspective" , Proc. 2nd Workshop on Software Testing, Verification and Analysis, Banff, Alberta, Canada (1988), pp. 13-20.
19. R. P. Pargas, M. J. Harrold and R. R. Peck, "Test-data generation using genetic algorithms", Software Testing, Verification and Reliability (1999).
20. A. J. Offutt and J. Pan, "Automatically detecting equivalent mutants and infeasible paths," Software Testing, Verification and Reliability 7 (1997) 165-192.
21. J. Jaffar and M. J. Maher, "Constraint logic programming: A survey," J. of Logic Programming 19/20 (1994) 503-581.
22. A. Goldberg, T. C. Wang and D. Zimmerman, "Applications of feasible path analysis to program testing", Proc. Int'l Symp. on Softw. Testing and Analysis (ISSTA '94), Seattle, Washington, USA (1994), pp. 80-94.
23. N. C. Heintze, J. Jaffar, S. Michaylov, P. J. Stuckey and R. H. C. Yap, "The CLP(R) programmer's manual", Version 1.2, Sept. 1992.
24. R. Jasper, M. Brennan, K. Williamson, B. Currier and D. Zimmerman, "Test data generation and feasible path analysis", Proc. Int'l Symp. on Software Testing and Analysis (ISSTA '94) Seattle, Washington, USA (1994) pp. 95-107.
25. pn upper bound on the complexity of Presburger arithmetic, J. of Computer and System Sciences 16 (1978) 323-332.
26. 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), Amsterdam, The Netherlands (1999), Lecture Notes in Computer Science, Vol. 1579, pp. 405-419.
27. A. J. Offutt and S. Liu, "Generating test data from SOFL specifications", J. of Systems and Software 49 (1999) 49-62.