Program Slicing (Q3345745)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3880072
Language Label Description Also known as
default for all languages
No label defined
    English
    Program Slicing
    scientific article; zbMATH DE number 3880072

      Statements

      Program Slicing (English)
      0 references
      0 references
      1984
      0 references
      data flow analysis
      0 references
      debugging
      0 references
      parallel processing
      0 references
      Program slicing
      0 references
      control flow
      0 references
      Program slicing is a method for automatically decomposing programs by analyzing their data flow and control flow. Starting from a subset of a program's behavior, slicing reduces that program to a minimal form which still produces that behavior. The reduced program, called a ''slice'', is an independent program guaranteed to represent faithfully the original program within the domain of the specified subset of behavior. Some properties of slices are presented. In particular, finding statement-minimal slices is in general unsolvable, but using data flow analysis is sufficient to find approximate slices. Potential applications include automatic slicing tools for debugging and parallel processing of slices.
      0 references

      Identifiers