Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
