Pending Constraints in Symbolic Execution for Better Exploration and Seeding
Symbolic execution is a well established technique for software testing and analysis. However, scalability continues to be a challenge, both in terms of constraint solving cost and path explosion. In this work, we present a novel approach for symbolic execution, which can enhance its scalability by aggressively prioritizing execution paths that are already known to be feasible, and deferring all other paths. We evaluate our technique on nine applications, including SQLite3, make and tcpdump and show it can achieve higher coverage for both seeded and non-seeded exploration.
Tue 22 Sep Times are displayed in time zone: (UTC) Coordinated Universal Time change
|08:00 - 08:20|
Timotej KapusImperial College London, Frank BusseImperial College London, Cristian CadarImperial College LondonPre-print Media Attached
|08:20 - 08:40|
Broadening Horizons of Multilingual Static Analysis: Semantic Summary Extraction from C Code for JNI Program Analysis
|08:40 - 09:00|