An Efficient 2-Phase Strategy to Achieve High Branch Coverage

Simple item page
dc.contributor.authorPrabhu, Sarvesh P.en
dc.contributor.committeechairHsiao, Michael S.en
dc.contributor.committeememberShukla, Sandeep K.en
dc.contributor.committeememberYang, Yalingen
dc.contributor.departmentElectrical and Computer Engineeringen
dc.date.accessioned2014-03-14T21:28:35Zen
dc.date.adate2012-03-06en
dc.date.available2014-03-14T21:28:35Zen
dc.date.issued2012-02-03en
dc.date.rdate2012-03-06en
dc.date.sdate2012-02-06en
dc.description.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.en
dc.description.degreeMaster of Scienceen
dc.identifier.otheretd-02062012-230655en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-02062012-230655/en
dc.identifier.urihttp://hdl.handle.net/10919/40931en
dc.publisherVirginia Techen
dc.relation.haspartPrabhu_SP_T_2012.pdfen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectBranch Coverageen
dc.subjectConflict-driven Learningen
dc.subjectSymbolic Executionen
dc.subjectSoftware Testingen
dc.titleAn Efficient 2-Phase Strategy to Achieve High Branch Coverageen
dc.typeThesisen
thesis.degree.disciplineElectrical and Computer Engineeringen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.levelmastersen
thesis.degree.nameMaster of Scienceen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Prabhu_SP_T_2012.pdf
Size:
789.67 KB
Format:
Adobe Portable Document Format
Download

Collections

Masters Theses