ANNOUNCE: Optimix 2.5, the optimizer generator

Uwe Assmann <>
15 Nov 1998 13:31:51 -0500

          From comp.compilers

Related articles
ANNOUNCE: Optimix 2.5, the optimizer generator (Uwe Assmann) (1998-11-15)
| List of all articles for this month |

From: Uwe Assmann <>
Newsgroups: comp.compilers
Date: 15 Nov 1998 13:31:51 -0500
Organization: University Karlsruhe, IPD
Keywords: tools, optimize, available


There is a new version of Optimix, the optimizer generator based on graph
rewriting. Optimix 2.5 is ready and can be downloaded from Its home
page is

Optimix is an optimizer generator. It can be used to generate program
analyses and transformations. Its input language is based on Datalog/Prolog
and graph rewriting. Especially two new classes of graph rewrite systems are
used: edge addition rewrite systems (EARS) and exhaustive graph rewrite
systems (XGRS).

Optimix produces C procedures or Java methods which can be integrated into
an optimizer. Optimix can be used with the Cocktail toolbox, in a
standalone C mode, in the context of the CoSy compiler framework, or in Java
embedded mode. There are out-of-the-box executables for Linux and SunOS
4.1.3, but sources are also shipped. A test suite of examples is provided.

New in version 2.5:

- Optimix can eat and produce Java (still rudimentary, beta-test). The graph
rewrite systems are embedded in Java classes as methods. Java Vectors and
Arrays are recognized. Java set functors can be defined.
- Path expressions can abbreviate Datalog chain rules. Set-based
IN-expressions facilitate predicate specification (in the style of graph and
path expression databases).
- If-then syntax for rules.

Happy optimixing!


@InProceedings{ assmann.95-ears,
    author = {A{\ss}mann, Uwe},
    title = "{On Edge Addition Rewrite Systems and Their Relevance to
Program Analysis}",
    editor = "Cuny, J. and Ehrig, H. and Engels, G. and
Rozenberg, G.",
    booktitle = "5th Int. Workshop on Graph Grammars and Their Application
To Computer Science, Williamsburg",
    series = "Lecture Notes in Computer Science" ,
    publisher = "Springer" ,
    address = "Heidelberg" ,
    pages = "321--335",
    volume = 1073,
    year = "1994",
    month = nov,

@InProceedings{ assmann.95d,
    author = "A{\ss}mann, Uwe",
    title = "{Parallel EARS}",
    year = 1995,
    booktitle = {Massively Parallel Programming Models (MPPM)},
    editor = {Giloi, W. K. and J{\"a}hnichen, S. and Shriver, B. D.},
    publisher = {IEEE Press},
    month = oct,
    pages = "198--204",
    address = "Los Alamitos",

@InProceedings{ assmann.96a,
    author = "A{\ss}mann, Uwe",
    title = "{How To Uniformly Specify Program Analysis and
    publisher = "Springer" ,
    year = 1996,
    booktitle = {Compiler Construction (CC)},
    pages = "121--135",
    series = "Lecture Notes in Computer Science" ,
    volume = 1060,
    editor = {Fritzson, P. A.},
    address = "Heidelberg" ,
@TechReport{ assmann.96b,
    author = "A{\ss}mann, Uwe",
    title = "{Graph Rewrite Systems For Program Optimization}",
    year = 1996,
    institution = "INRIA Rocquencourt",
    number = "RR-2955",
@InBook{ assmann.99-gragra,
    author = "A{\ss}mann, Uwe",
    title = "{OPTIMIX, A Tool for Rewriting and Optimizing Programs}",
    year = 1999,
    booktitle = "{Graph Grammar Handbook}"
    year = "1999",
    publisher = "Chapman-Hall",
    note = "to appear 99",

Dr. Uwe Assmann Universit=E4t Karlsruhe, Institut f=FCr Programmstrukturen,
Am Zirkel 2, Postfach 69 80, 76128 Karlsruhe, Germany

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.