Lexer and Parser
BANE, the Berkeley ANalysis Engine, is a toolkit for
constructing program analyses such as dataflow and type inference systems.
BANE is constraint-based, meaning that analyses are formulated
as systems of constraints generated from the
program text. Constraint resolution (i.e., solving the constraints)
computes the desired information.
An optimizer based on the intermediate language Firm.
constant folding, expression normalization,
scalar copy propagation, scalar redundant store elimination,
global code motion (subsumes global CSE, loop invariant hoisting,
and partial redundancies), inlining and dead code elimination.
Uses SSA to represent data flow.
Frameworks and algorithms for the analysis and transformation
of scientific programs
OPTIMIX is an optimizer generator.
It can be used to generate program analyses and transformations.
Its input language is based on DATALOG and graph rewriting.
The PAG program analyzer generator supports the implementation of static
program analyzers. PAG generates efficient data flow analyzers from concise
COPYRIGHT © 1996-2006
GERMAN NATIONAL RESEARCH CENTER FOR INFORMATION TECHNOLOGY
FRAUNHOFER INSTITUTE FOR COMPUTER ARCHITECTURE AND SOFTWARE TECHNOLOGY