Abstract
Dataflow analyses track the definitions and uses of variable values and are useful for optimizing and parallelizing compilers. Such analyses compute, for every (array cell) value read in a right-hand-side expression, the very operation which produced it. These analyses, however, require quite stringent hypotheses on the input programs: the control flow should be known at compile-time (i.e., static), and array subscripts must be affine functions of surrounding counters and possibly of symbolic constants. In contrast, the analysis presented in this paper handles generalifs andwhileloops and general nonaffine array subscripts.
Sign-in/Register to access full text options 
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.
