Static program slicing algorithms are minimal for free liberal program schemas (2006)
Cached
Download Links
- [comjnl.oxfordjournals.org]
- [www.dcs.kcl.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | The Computer Journal |
| Citations: | 1 - 1 self |
BibTeX
@ARTICLE{Danicic06staticprogram,
author = {Sebastian Danicic and Chris Fox and Mark Harman and Rob Hierons and John Howroyd and Michael R. Laurence},
title = {Static program slicing algorithms are minimal for free liberal program schemas},
journal = {The Computer Journal},
year = {2006},
volume = {48},
pages = {737--748}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Program slicing is an automated source code extraction technique that has been applied to a number of problems including testing, debugging, maintenance, reverse engineering, program comprehension, reuse and program integration. In all these applications the size of the slice is crucial; the smaller the better. It is known that statement minimal slices are not computable, but the question of dataflow minimal slicing has remained open since Weiser posed it in 1979. This paper proves that static slicing algorithms produce dataflow minimal end slices for programs which can be represented as schemas which are free and liberal. 1.
