Chatin's graph coloring algorithm as a method for assigning positions to Diana attributes
Arol Ambler, Robert Trawick · ACM SIGPLAN Notices · 1983
Diana, the widely used abstraction for Ada compilers' intermediate representation of Ada programs, consists of graphs of attributed nodes. A graph-coloring algorithm allocates positions for attributes within nodes of the graph, making a space and time-efficient implementation.