Graph based unit testing

Simple item page
dc.contributor.advisorKhurshid, Sarfrazen
dc.contributor.committeeMemberKrasner, Herben
dc.creatorBushmais, Abraham H.en
dc.date.accessioned2011-11-07T21:08:47Zen
dc.date.accessioned2017-05-11T22:23:42Z
dc.date.available2011-11-07T21:08:47Zen
dc.date.available2017-05-11T22:23:42Z
dc.date.issued2011-08en
dc.date.submittedAugust 2011en
dc.date.updated2011-11-07T21:08:57Zen
dc.descriptiontexten
dc.description.abstractAutomating test design can increase test suit accuracy and produce more reliable software. In this report we present a prototype tool that can aid developers in unit testing Java code. It automates test path construction based on two existing graph-based criteria. It uses basis path coverage and prime path coverage to produce test paths. Our main contribution in this report is to design and implement a tool that goes beyond the commonly used coverage tools today. Common graph based coverage tools support statement coverage and sometimes branch coverage. Our tool support prime path coverage which subsumes a number of other graph based coverage criteria, including statement and branch coverage. Our tool is a Java based Eclipse plug-in that operates at the class level. It processes each method in a given class to produce a CFG, cyclomatic complexity, a set of basis paths, a set of prime paths, and a set of test paths based on prime path coverage.en
dc.description.departmentElectrical and Computer Engineeringen
dc.format.mimetypeapplication/pdfen
dc.identifier.slug2152/ETD-UT-2011-08-4335en
dc.identifier.urihttp://hdl.handle.net/2152/ETD-UT-2011-08-4335en
dc.language.isoengen
dc.subjectGraph-base coverage toolsen
dc.subjectUnit testingen
dc.subjectJava codeen
dc.titleGraph based unit testingen
dc.type.genrethesisen

Files

Collections

University of Texas at Austin