Exact and approximate probabilistic symbolic execution for nondeterministic programs.
Kasper Søe LuckowCorina S. PasareanuMatthew B. DwyerAntonio FilieriWillem VisserPublished in: ASE (2014)
Keyphrases
- symbolic execution
- exact and approximate
- static analysis
- test data generation
- test generation
- specification language
- source code
- lower bound
- string matching
- query evaluation
- data flow
- dynamic programming
- branch and bound
- data sets
- test cases
- lower and upper bounds
- evolutionary computation
- optimization problems
- evolutionary algorithm
- objective function
- high level