A region analysis algorithm for the live variables problem

Z. Czech

doi:10.1007/BF02242267

A region analysis algorithm for the live variables problem

Z. Czech

Katedra Algorytmiki i Oprogramowania (RAU/RAU5)

Wyniki badań: Wkład do czasopisma › Artykuł › recenzja

Abstrakt

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.

Język oryginału	angielski
Strony (od–do)	193-210
Liczba stron	18
Czasopismo	Computing
Tom	33
Numer wydania	3-4
Identyfikatory DOI	https://doi.org/10.1007/BF02242267
Status publikacji	Opublikowano - wrz 1984

Obszary tematyczne ASJC Scopus

Oprogramowanie
Informatyka teoretyczna
Analiza numeryczna
Zastosowania informatyki
Teoria i matematyka obliczeń
Matematyka obliczeniowa

Uzyskaj dostęp do dokumentu

10.1007/BF02242267

Inne pliki i linki

Link do publikacji w Scopus

Cytuj to

@article{1fc3f5cc61974a7a87cdaa4e2b38eee4,

title = "A region analysis algorithm for the live variables problem",

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.",

keywords = "AMS Subject Classifications: 68C25, 68B10, 68E10, Global program optimization, data flow analysis, flow graph, interval analysis, live variables, reducibility, time complexity",

author = "Z. Czech",

year = "1984",

month = sep,

doi = "10.1007/BF02242267",

language = "English",

volume = "33",

pages = "193--210",

journal = "Computing",

issn = "0010-485X",

publisher = "Springer",

number = "3-4",

}

TY - JOUR

T1 - A region analysis algorithm for the live variables problem

AU - Czech, Z.

PY - 1984/9

Y1 - 1984/9

N2 - 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.

AB - 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.

KW - AMS Subject Classifications: 68C25, 68B10, 68E10

KW - Global program optimization

KW - data flow analysis

KW - flow graph

KW - interval analysis

KW - live variables

KW - reducibility

KW - time complexity

UR - https://www.scopus.com/pages/publications/0021606748

U2 - 10.1007/BF02242267

DO - 10.1007/BF02242267

M3 - Article

AN - SCOPUS:0021606748

SN - 0010-485X

VL - 33

SP - 193

EP - 210

JO - Computing

JF - Computing

IS - 3-4

ER -

A region analysis algorithm for the live variables problem

Abstrakt

Obszary tematyczne ASJC Scopus

Uzyskaj dostęp do dokumentu

Inne pliki i linki

Fingerprint

Cytuj to