Efficiently computing static single assignment form and the control dependence graph

Zadeck, F. Kenneth; Wegman, Mark N.; Rosen, Barry K.; Ferrante, Jeanne; Cytron, Ron

doi:10.1145/115372.115320

Record: found
Abstract: not found
Article: not found

Efficiently computing static single assignment form and the control dependence graph

Author(s): Ron Cytron , Jeanne Ferrante , Barry K. Rosen , Mark N. Wegman , F. Kenneth Zadeck

Publication date (Print): October 1991

Journal: ACM Transactions on Programming Languages and Systems

Publisher: Association for Computing Machinery (ACM)

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Journal

Title: ACM Transactions on Programming Languages and Systems

Abbreviated Title: ACM Trans. Program. Lang. Syst.

Publisher: Association for Computing Machinery (ACM)

ISSN (Print): 01640925

Publication date (Print): October 1991

Volume: 13

Issue: 4

Pages: 451-490

Article

DOI: 10.1145/115372.115320

SO-VID: 15fbdcca-b1f8-4b4f-af5d-707893a409a4

History

Data availability:

Efficiently computing static single assignment form and the control dependence graph

Read this article at

Related collections

Exponential Random Graph Models

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 1,477

Cited by 113