Using graph coloring in an algebraic compiler

DOI10.1007/S002360050079zbMATH Open0865.68028OpenAlexW2008487560WikidataQ121875131 ScholiaQ121875131MaRDI QIDQ1920231FDOQ1920231

Authors: Teodor Rus, Sriram Pemmaraju 

Publication date: 25 September 1996

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050079

Recommendations

• Programming Languages and Systems
• On a graph-theoretical model for cyclic register allocation
• Publication:4886067
• scientific article; zbMATH DE number 1956454
• Approximate triclique coloring for register allocation

zbMATH Keywords

graph coloringalgebraic compilerclique-composable graphsoptimally colored subgraphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Theory of compilers and interpreters (68N20)

Cited In (3)

• Algebraic processing of programming languages
• Programming Languages and Systems
• Coloring terms to control equational reasoning

This page was built for publication: Using graph coloring in an algebraic compiler

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920231)