On sparse evaluation representations

DOI10.1016/S0304-3975(00)00315-7zbMath0996.68131MaRDI QIDQ1605227

G. Ramalingam

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph transformationsdataflow analysisequivalent flow graphspartially equivalent flow graphsquick propagation graphssparse evaluation graphsstatic single assignment forms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

A sparse evaluation technique for detailed semantic analyses

Cites Work

• Unnamed Item
• Unnamed Item
• Languages and compilers for parallel computing. Proceedings of the 6th international Workshop, Portland, OR, USA, August 12-14, 1993.
• Fast algorithms for the elimination of common subexpressions
• A Fast and Usually Linear Algorithm for Global Flow Analysis

This page was built for publication: On sparse evaluation representations