|Implementation of range analyses email@example.com (Douglas do Couto Teixeira) (2011-06-27)|
|Re: Implementation of range analyses firstname.lastname@example.org (Diego Novillo) (2011-06-29)|
|Re: Implementation of range analyses email@example.com (Nikolaos Kavvadias) (2011-07-01)|
|From:||Nikolaos Kavvadias <firstname.lastname@example.org>|
|Date:||Fri, 1 Jul 2011 15:11:48 -0700 (PDT)|
|Posted-Date:||01 Jul 2011 20:32:04 EDT|
bitwidth analysis (BA) is a related problem. It has been treated e.g.
in Stephenson's contemporary classic: "Bitwidth Analysis with
Application to Silicon Compilation"
This is a highly-referenced, yet accessible work. The "bitwise"
implementation (the name of the project), however was never open-
The FLEX/Harpoon compiler infrastructure (by C. Scott Ananian, written
in Java) provides an implementation of BA.
The code is out there, available both at http://cscott.net and
somewhere at github.
Interval arithmetic (IA) and affine arithmetic (AA) provide
mathematical foundations for propagating ranges (and handling
precision in the latter case) of values. There exist open-source
implementations of libraries for both.
I have seen your work on Google Code. Looks like a nice addition to
LLVM (if i recall correctly).
Return to the
Search the comp.compilers archives again.