Abstracting Path Conditions
Jan Strej\v{c}ek, Marek Trt\'ik
TL;DR
This paper introduces a symbolic execution algorithm that generates necessary input conditions to reach specific program locations, enhancing bug detection and test generation tools.
Contribution
It presents a novel symbolic-execution-based method for deriving necessary path conditions, improving the efficiency of bug-finding and test-generation tools.
Findings
Significant performance improvements in bug-finding tools
Effective generation of nontrivial necessary conditions
Demonstrated applicability on real-world programs
Abstract
We present a symbolic-execution-based algorithm that for a given program and a given program location produces a nontrivial necessary condition on input values to drive the program execution to the given location. We also propose an application of necessary conditions in contemporary bug-finding and test-generation tools. Experimental results show that the presented technique can significantly improve performance of the tools.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware Testing and Debugging Techniques · Software Reliability and Analysis Research · Software Engineering Research