A research environment for incremental data flow analysis

Authors:
Zhiqiang Tan;Karen A. Lemone
Affiliations:
Computer Science Department, Worcester Polytechnic Institute, Worcester, MA;Computer Science Department, Worcester Polytechnic Institute, Worcester, MA and Massachusetts Computer Associates, Wakefield, MA
Venue:
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
Year:
1985

Citing 8
Cited 4

A Deterministic Attribute Grammar Evaluator Based on Dynamic Scheduling

ACM Transactions on Programming Languages and Systems (TOPLAS)
High-level data flow analysis

Communications of the ACM
Applications of a graph grammar for program control flow analysis

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Flow Analysis of Computer Programs

Flow Analysis of Computer Programs
Incremental data flow analysis

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Compiler Design Theory

Compiler Design Theory
Automatic generation of efficient evaluators for attribute grammars

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)

Principles of Compiler Design (Addison-Wesley series in computer science and information processing)

A method to improve testing and debugging in robotic programs using attribute grammars

CSC '87 Proceedings of the 15th annual conference on Computer Science
A framework for incremental extensible compiler construction

ICS '03 Proceedings of the 17th annual international conference on Supercomputing
A framework for incremental extensible compiler construction

International Journal of Parallel Programming - Special issue II: The 17th annual international conference on supercomputing (ICS'03)
Using Verified Data-Flow Analysis-based Optimizations in Attribute Grammars

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This articles describes an environment intended for the study of incremental data flow analysis and the discovery of the types of programs for which this technique is effective. High-level data flow analysis using attribute grammars allows calculation of both data flow information and measurement information as computations on attribute sets. Our results show that in the worst case our method of incremental data flow analysis uses a large amount of CPU time (and memory), but for programs with the same structure as a “typical program”, performance is quite good.