OPTIMIX is a tool for generating algorithms which construct and
transform directed relational graphs.
In particular, it facilitates many tasks in program compilation and
optimization. OPTIMIX's input language allows to specify graph queries
which localize analysis information as well as graph rewrite systems
which describem transformations.
The generator type-checks the rewrite systems with a graph data model
and tests whether they fulfil a termination criterion.
This report explains the advantages of the OPTIMIX specification
language for compiler writers and demonstrates that OPTIMIX can be
applied to three major problem classes of program rewriting: graph
reachability problems, context-sensitive pattern match problems, and