Global Data Flow Analysis and Iterative Algorithms
Journal of the ACM (JACM)
A Fast and Usually Linear Algorithm for Global Flow Analysis
Journal of the ACM (JACM)
Structured Programming with go to Statements
ACM Computing Surveys (CSUR)
Communications of the ACM
A case study of a new code generation technique for compilers
Communications of the ACM
Verifying properties of parallel programs: an axiomatic approach
Communications of the ACM
A genealogy of control structures
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
A new strategy for code generation: the general purpose optimizing compiler
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
The Design of an Optimizing Compiler
The Design of an Optimizing Compiler
A control statement for natural top-down structured programming
Programming Symposium, Proceedings Colloque sur la Programmation
A consistent and complete deductive system for the verification of parallel programs
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Program improvement by source to source transformation
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Axiomatic Proof Techniques for Parallel Programs
Axiomatic Proof Techniques for Parallel Programs
Can structured programs be efficient?
ACM SIGPLAN Notices
Structured programming
Constructing Call-by-Value Continuation Semantics
Journal of the ACM (JACM)
Program analysis with partial transfer functions
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Monoids for rapid data flow analysis
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A case study in specifying the semantics of a programming language
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A case study in specifying the semantics of a programming language
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Linear cost is sometimes quadratic
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Arcs in graphs are NOT pairs of nodes
ACM SIGACT News
| Hi-index | 0.00 |
Control flow relations in a high level language program can be represented by a hierarchy of small graphs that combines nesting relations among statements in an ALGOL-like syntax with relevant perturbations caused by goto or leave statements. Applications of the new style of representation include denotational semantics, data flow analysis, source level compiler diagnostics, and program proving.