Abstract
Bidirectional data flow problems, useful in a wide range of optimizing transformations, are conventionally solved using the iterative approach. This paper shows that use of the edge placement technique makes bidirectional data flow problems amenable to efficient solution. An elimination algorithm for bidirectional data flow problems using edge placement is presented, and its complexity is shown to be identical to the complexity of elimination algorithms for unidirectional data flows
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 callMore From: ACM Transactions on Programming Languages and Systems
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.
