The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages-Reference-Cited by-同舟云学术

The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages

Published:1990-06 Issue:6 Volume:25 Page:257-271
ISSN:0362-1340
Container-title:ACM SIGPLAN Notices
language:en
Short-container-title:SIGPLAN Not.

Author:

Ottenstein Karl J.¹,Ballance Robert A.²,MacCabe Arthur B.²

Affiliation:

1. LOS Alamos National Laboratory, C-3 MS/B265, Los Alamos, NM

2. Department of Computer Science, University of New Mexico, Albuquerque, NM

Abstract

The Program Dependence Web (PDW) is a program representation that can be directly interpreted using control-, data-, or demand-driven models of execution. A PDW combines a single-assignment version of the program with explicit operators that manage the flow of data values. The PDW can be viewed as an augmented Program Dependence Graph . Translation to the PDW representation provides the basis for projects to compile Fortran onto dynamic dataflow architectures and simulators. A second application of the PDW is the construction of various compositional semantics for program dependence graphs.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Graphics and Computer-Aided Design,Software

Link

https://dl.acm.org/doi/pdf/10.1145/93548.93578

Reference21 articles.

1. A Flow Analysis Procedure for the Translation of High-Level Languages to a Data Flow Language

2. Detecting equality of variables in programs

3. Executing a program on the MIT tagged-token dataflow architecture

Cited by 58 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Falcon: A Fused Approach to Path-Sensitive Sparse Data Dependence Analysis;Proceedings of the ACM on Programming Languages;2024-06-20

2. Representing Data Collections in an SSA Form;2024 IEEE/ACM International Symposium on Code Generation and Optimization (CGO);2024-03-02

3. Lazy Evaluation for the Lazy: Automatically Transforming Call-by-Value into Call-by-Need;Proceedings of the 32nd ACM SIGPLAN International Conference on Compiler Construction;2023-02-17

4. Mechanised Semantics for Gated Static Single Assignment;Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11

5. Unleashing Parallelism in Elastic Circuits with Faster Token Delivery;2022 32nd International Conference on Field-Programmable Logic and Applications (FPL);2022-08