Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Data flow analysis for `intractable' system software
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Interprocedural constant propagation
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Constant propagation with conditional branches
ACM Transactions on Programming Languages and Systems (TOPLAS)
Interprocedural constant propagation: a study of jump function implementation
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Constant propagation with conditional branches
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A unified approach to global program optimization
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Flow Analysis of Computer Programs
Flow Analysis of Computer Programs
Run-time check elimination for Ada 9X
TRI-Ada '94 Proceedings of the conference on TRI-Ada '94
| Hi-index | 0.00 |
Constant propagation is a well-known data flow analysis problem. Constant propagation enables compiletime calculations and deletion of unreachable code. In this paper, constant propagation is generalized to allow propagation of a wider class of assertions. Along with equalities between variables and constants, this class includes controlling expressions of conditional branches and equalities originating from program assignments. The problem of propagating these assertions is solved by application of the mechanism of monotone data flow analysis frameworks. Propagation of the assertions enables additional optimizations: deletion of assignments and redirection of control flow.