Dynamic program slicing (Q1110308)

From MaRDI portal
Revision as of 13:20, 13 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Dynamic program slicing
scientific article

    Statements

    Dynamic program slicing (English)
    0 references
    0 references
    0 references
    1988
    0 references
    A dynamic program slice is an executable subset of the original program that produces the same computations on a subset of selected variables and inputs. It differs from the static slice [\textit{M. Weiser}, IEEE Trans. Software Eng. SE-10, 352-357 (1984; Zbl 0552.68004)] in that it is entirely defined on the basis of a computation. The two main advantages are the following: Arrays and dynamic data structures can be handled more precisely and the size of slice can be significantly reduced, leading to a finer localization of the fault. The approach is being investigated as a possible extension of the debugging capabilities of STAD, a system recently developed by the authors for testing and debugging.
    0 references
    slicing
    0 references
    dynamic slice
    0 references
    trajectory
    0 references
    data dependence
    0 references
    control dependence
    0 references
    debugging
    0 references

    Identifiers