abstract: The existing implementation of DDT uses a depth-first search algorithm to drive the exploration of new paths for testing. This algorithm provides full coverage of the program under test, but is limited by the fact that the number of paths increases exponentially with the size of the program. By employing the control-flow graph information of the program under test, we can direct the testing process towards program paths that contain unvisited points and therefore obtain full branch coverage in a smaller number of tests than would be required by the original depth-first search algorithm. We will present two uses of control-flow graph information in DDT. The first use is a refinement of depth-first search where control-flow graph information is used to prune the search space to eliminate unnecessary tests. The second use is in the context of a prioritized work-queue that forms the basis for a variety of sophisticated search algorithms that exploit different heuristics.
bio: Rebekah Leslie is a PhD student at Portland State University working with Mark Jones on the Hasp project. Her primary research focus is the connection between operating systems and functional programming languages. Rebekah Leslie has also worked on information-flow security, which was a major focus of her early PhD studies. Prior to moving to Oregon, Rebekah received a BS in Computer Engineering from the University of Oklahoma where she worked with Rex Page.
Loading more stuff…
Hmm…it looks like things are taking a while to load. Try again?