Heuristics-based infeasible path detection for dynamic test data generation
Information and Software Technology
Test generation for graphical user interfaces based on symbolic execution
Proceedings of the 3rd international workshop on Automation of software test
Constraint Solving and Symbolic Execution
Verified Software: Theories, Tools, Experiments
Event Listener Analysis and Symbolic Execution for Testing GUI Applications
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Information and Software Technology
Symbolic execution of Reo circuits using constraint automata
Science of Computer Programming
Hi-index | 0.00 |
Automatic test data generation is a challenging task in software engineering research. This paper studies a path-oriented approach to the problem, which is based on the combination of symbolic execution and constraint solving. Methods for representing expressions and path conditions are discussed. An implemented toolkit is described with some examples. The toolkit transforms an input program (possibly embedded with assertions) to an extended finite state machine and then performs depth-first or breadth-first search on it. The goal is to find values for input variables such that a terminal state can be reached. If successful, input test data are found (which might reveal a bug in the program).