home · mobile · calendar · colloquia · 1999-2000 · 

Colloquium - Diwan

Experiments with Program Slicing
Department of Computer Science, University of Colorado
10/7/1999
3:30pm-4:45pm

The concept of slicing is relevant to many software engineering activities including program construction, optimization, maintenance, testing and debugging. While there has been a lot of research on slicing, there has been relatively little research on evaluating slicing and slicing algorithms.

This talk evaluates six slicing algorithms based on the quality of the slices they compute and on their running time. Three of these algorithms compute similar results to algorithms proposed in literature. The other three algorithms are new hybrid algorithms that incorporate simple run-time information into static slicing. We find that the first three algorithms are impractical: either they run too slowly or their results are too imprecise to be useful. The hybrid algorithms are fast and many of the slices they compute are small and thus usable. However, many slices are still large and unusable. We evaluated these unusable slices and found that their imprecision is due to the imprecision of our underlying pointer analysis.

Refreshments will be served in ECOT 831 immediately following the talk.
Hosted by Clarence (Skip) Ellis.

Department of Computer Science
University of Colorado Boulder
Boulder, CO 80309-0430 USA
webmaster@cs.colorado.edu
www.cs.colorado.edu
May 5, 2012 (14:13)
XHTML 1.0/CSS2
©2012