A region analysis algorithm for the live variables problem (Q799117)
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: A region analysis algorithm for the live variables problem |
scientific article; zbMATH DE number 3872699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A region analysis algorithm for the live variables problem |
scientific article; zbMATH DE number 3872699 |
Statements
A region analysis algorithm for the live variables problem (English)
0 references
1984
0 references
An algorithm to solve the ''live variables'' problem on reducible flow graphs is presented. It is based on the concept of a region of a flow graph. The algorithm is compared for time complexity with the well-known round-robin version of the iterative algorithm on ''self-replicating'' families of reducible flow graphs. The results of comparison are inconclusive in that the region analysis algorithm requires fewer bit- vector operations on some graphs and more on others.
0 references
global program optimization
0 references
interval analysis
0 references
data flow analysis
0 references
live variables
0 references
reducible flow graphs
0 references
time complexity
0 references
region analysis algorithm
0 references
0.7590875029563904
0 references
0.7120572924613953
0 references
0.7077826857566833
0 references
