Output details
11 - Computer Science and Informatics
Goldsmiths' College
Return to search
Output 0 of 0 in the submission
Article title
Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas
Type
D - Journal article
Title of journal
Journal of Logic and Algebraic Programming
Article number
-
Volume number
80
Issue number
8
First page of article
481
ISSN of journal
15678326
Year of publication
2011
Number of additional authors
2
Additional information
<10> This paper came out of an EPSRC project in which Danicic was the principal investigator. One algorithm is considered 'better than' another if it constructs a smaller slice. This paper gives the first proof that Weiser's algorithm (on which most slicing algorithms are based) gives predicate-minimal slices for classes of programs satisfying the given conditions. That is to say for this class of programs, and at this level of abstraction, Weiser's Algorithm is the best possible.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-