Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 193-210 |
| Number of pages | 18 |
| Journal | Computing |
| Volume | 33 |
| Issue number | 3-4 |
| DOIs | |
| Publication status | Published - Sept 1984 |
Keywords
- AMS Subject Classifications: 68C25, 68B10, 68E10
- Global program optimization
- data flow analysis
- flow graph
- interval analysis
- live variables
- reducibility
- time complexity
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Numerical Analysis
- Computer Science Applications
- Computational Theory and Mathematics
- Computational Mathematics
Fingerprint
Dive into the research topics of 'A region analysis algorithm for the live variables problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver