Type of Document Master's Thesis Author Prabhu, Sarvesh P Author's Email Address firstname.lastname@example.org URN etd-02062012-230655 Title An Efficient 2-Phase Strategy to Achieve High Branch Coverage Degree Master of Science Department Electrical and Computer Engineering Advisory Committee
Advisor Name Title Hsiao, Michael S. Committee Chair Shukla, Sandeep K. Committee Member Yang, Yaling Committee Member Keywords
- Branch Coverage
- Conflict-driven Learning
- Symbolic Execution
- Software Testing
Date of Defense 2012-02-03 Availability restricted AbstractSymbolic execution-based test generation is gaining popularity for software test generation.
The increasing complexity of the software program is posing new challenges in software
execution-based test generation because of the path explosion problem. We present a new
2-phase symbolic execution driven strategy that achieves high branch coverage in software quickly. Phase 1 follows a greedy approach that quickly covers as many branches as possible
by exploring each branch through its corresponding shortest path prefix. Phase 2 covers the remaining branches that are left uncovered if the shortest path to the branch was infeasible. In Phase 1, a basic conflict driven learning is used to skip all the paths that may have any of the earlier encountered conflicting conditions, while in Phase 2, a more intelligent
conflict driven learning is used to skip regions that do not have a feasible path to any unexplored branch. This results in considerable reduction in unnecessary SMT solver calls.
Experimental results show that significant speedup can be achieved, effectively reducing the
time to detect a bug and providing higher branch coverage for a fixed time out period than previous techniques.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access Prabhu_SP_T_2012.pdf 808.62 Kb 00:03:44 00:01:55 00:01:41 00:00:50 00:00:04indicates that a file or directory is accessible from the Virginia Tech campus network only.
If you have questions or technical problems, please Contact DLA.