Efficient comparison of program slices (Q758192)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient comparison of program slices |
scientific article; zbMATH DE number 4195150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient comparison of program slices |
scientific article; zbMATH DE number 4195150 |
Statements
Efficient comparison of program slices (English)
0 references
1991
0 references
The slice of a program with respect to a component c is a projection of the program that includes all components that might affect (either directly or transitively) the values of the variables used at c. Slices can be extracted particularly easily from a program representation called a program dependence graph, originally introduced as an intermediate program representation for performing optimizing, vectorizing, and parallelizing transformations. This paper presents a linear-time algorithm for determining whether two slices of a program dependence graph are isomorphic.
0 references
program slices
0 references
program dependence graph
0 references
intermediate program representation
0 references
0 references
0.87814707
0 references
0.8615792
0 references
0 references
0.8346598
0 references
