Symbolic PathFinder: symbolic execution of Java bytecode

@inproceedings{Pasareanu2010SymbolicPS,
  title={Symbolic PathFinder: symbolic execution of Java bytecode},
  author={C. Pasareanu and Neha Rungta},
  booktitle={ASE '10},
  year={2010}
}
Symbolic Pathfinder (SPF) combines symbolic execution with model checking and constraint solving for automated test case generation and error detection in Java programs with unspecified inputs. In this tool, programs are executed on symbolic inputs representing multiple concrete inputs. Values of variables are represented as constraints generated from the analysis of Java bytecode. The constraints are solved using off-the shelf solvers to generate test inputs guaranteed to achieve complex… Expand
Fast Loop Boundary Coverage Testing in Symbolic Execution
Targeted test input generation using symbolic-concrete backward execution
Improving symbolic execution for statechart formalisms
Dynamic symbolic execution of Java programs using JNI
  • Sergey Vartanov
  • Computer Science
  • 2017 Computer Science and Information Technologies (CSIT)
  • 2017
Test case generation for Java Bytecode programs annotated with BML specifications
  • Safaa Achour, M. Benattou
  • Computer Science
  • 2016 5th International Conference on Multimedia Computing and Systems (ICMCS)
  • 2016
Evaluation of String Constraint Solvers Using Dynamic Symbolic Execution
Symbolic execution with mixed concrete-symbolic solving
...
1
2
3
4
5
...