Abstract

Constant propagation is a well-known data flow analysis time calculations and deletion of unreachable code. In this paper, constant propagation is generalized to allow propagation of a wider class of assertions. Along this class includes controlling expressions of assignments. The problem of propagating these assertions monotone data flow analysis frameworks. Propagation of the assertions enables additional deletion of assignments and redirection of control flow.

Full Text
Paper version not known

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 call

Disclaimer: 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.