A symbolic execution tool based on the elimination of infeasible paths

Proceedings - 5th International Conference on Software Engineering Advances, ICSEA 2010

Volumn , Issue , 2010, Pages 435-440

  Papadakis, Mike ^a   Malevris, Nicos ^a  

^a ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

Symbolic execution; Test data generation; Testing techniques

Indexed keywords

CONSTRAINT SOLVING; EFFICIENT PATH; INFEASIBLE PATHS; RANDOM TESTING; SOFTWARE DEVELOPMENT CYCLES; SYMBOLIC EXECUTION; TEST CASE; TEST DATA GENERATION; TESTING TECHNIQUES;

COMPUTER SOFTWARE SELECTION AND EVALUATION; DATA COMMUNICATION SYSTEMS; SOFTWARE DESIGN; SOFTWARE TESTING; TESTING;

PROBLEM SOLVING;

EID: 78649850444     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSEA.2010.74     Document Type: Conference Paper

References (23)

1. J.C. King, "Symbolic execution and program testing", Comm. ACM vol. 19, pp. 38-94, 1976.
2. D. F. Yates, N. Malevris, "Reducing the effects of infeasible paths in branch testing", Software Engineering Notes, vol. 14, pp. 48-54, 1989.
3. A. Gotlieb, "Euclide: A Constraint-Based Testing Framework for Critical C Programs". In ICST, 151-160, 2009.
4. N. Williams, B. Marre, P. Mouy and M. Roger, "PathCrawler: Automatic Generation of Path Tests by Combining Static and Dynamic Analysis", In EDCC, 281-292, 2005.
5. W. Visser, C. Pasareanu and S. Khurshid, "Test input generation with java PathFinder". In ISSTA, 97-107, 2004.
6. D. F. Yates and N. Malevris, "An objective comparison of the cost effectiveness of three testing methods", J. of Information & Software Technology, vol. 49, 2007, pp. 1045-1060.
7. A. Von Mayrhauser. "Software testing: opportunity and nightmare", IEEE Int. Test Conf., pp. 551-552, 1992.
8. C. Koutsikas and N. Malevris: A Unified Symbolic Execution System. In AICCSA, 466-469, 2001.
9. B. Korel, "Automated software test data generation", IEEE Transactions on Software Engineering, 16(8):870-879, 1990. (Pubitemid 20738724)
10. Nikolai Kosmatov, "All-Paths Test Generation for Programs with Internal Aliases", In ISSRE, 147-156, 2008.
11. H. N. Gabow, S. N. Maheshwari, and L. J. Osterweil, "On two problems in the generation of program test paths", IEEE Trans. on Softw. Eng., vol. SE-2, pp. 227-231, 1976.
12. D. F. Yates and M. A. Hennell, "An approach to branch testing" In: 11th Workshop on Graph Theoretic Techniques in Computer Science, Wurtzburg, West Germany, pp. 42-433, 1985.
13. lp-solve, http://lpsolve.sourceforge.net/, May 2010.
14. M. R. Woodward and M. A. Hennell, "On the relationship between two control-flow coverage criteria: all JJ-paths and MCDC", Information & Software Technology 48(7), 433-440, 2006.
15. T. Denmat, A. Gotlieb, and M. Ducasse. Improving constraint-based testing with dynamic linear relaxations. In ISSRE, 181-190, 2007.
16. M. Papadakis and N. Malevris, "Improving Evolutionary Test Data Generation with the Aid of Symbolic Execution", AISEW, 201-210, 2009.
17. J. Harrold and G. Rothermel. Siemens programs, HR variants. http://www.cc.gatech.edu/aristotle/Tools/subjects/, May 2010.
18. P.D. Coward and D. Ince, "The symbolic execution of software: The SYM-BOL system", 1995, London: Chapman & Hall.
19. S. Lapierre, E. Merlo, G. Savard, G. Antoniol, R. Fiutem and P. Tonella, "Automatic Unit Test Data Generation Using Mixed-Integer Linear Programming and Execution Trees", 189-198, ICSM 1999.
20. P. Godefroid, N. Klarlund and K. Sen, "DART: directed automated random testing". SIGPLAN Not. 40(6), pp. 213-223. 2005.
21. S. Bardin and P. Herrmann. "OSMOSE: Automatic Structural Testing of Executables". Software Testing, Verification and Reliability. To appear.
22. M. N. Ngo and H. B. K. Tan, "Heuristics-based infeasible path detection for dynamic test data generation", Information & Software Technology 50(7-8), pp. 641-655, 2008
23. M. Papadakis and N. Malevris, "An Effective Path Selection Strategy for Mutation Testing", Proc. APSEC, 2009.