We present a bit-vector algorithm for the optimal and economical placement of computations within flow graphs, which is as efficient as standard uni-directional analyses. The point of our algorithm is the decomposition of the bi-directional structure of the known placement algorithms into a sequence...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!