Answers are grounded in this paper and cite their sources.
Symbolic reasoning about large programs is bound to be imprecise. How to deal with this imprecision is a fundamental problem in program analysis. Imprecision forces approximation. Traditional static program verification builds "may" over-approximations of the program behaviors to check universal "for-all-paths" properties, while automatic test generation requires "must" under-approximations to check existential "for-some-path" properties.
No takes yet. Share an insight, caveat, or question.
Patrice Godefroid (2011) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: