Re: Implementation of range analyses

Nikolaos Kavvadias <nikolaos.kavvadias@gmail.com>
Fri, 1 Jul 2011 15:11:48 -0700 (PDT)

          From comp.compilers
Related articles
Implementation of range analyses douglasdocouto@gmail.com (Douglas do Couto Teixeira) (2011-06-27)
Re: Implementation of range analyses dnovillo@acm.org (Diego Novillo) (2011-06-29)
Re: Implementation of range analyses nikolaos.kavvadias@gmail.com (Nikolaos Kavvadias) (2011-07-01)
| List of all articles for this month |
From: Nikolaos Kavvadias <nikolaos.kavvadias@gmail.com>
Newsgroups: comp.compilers
Date: Fri, 1 Jul 2011 15:11:48 -0700 (PDT)
Organization: Compilers Central
References: 11-06-049
Keywords: analysis
Posted-Date: 01 Jul 2011 20:32:04 EDT

Hi Douglas


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"
http://groups.csail.mit.edu/cag/bitwise/bitwise-pldi2k.pdf


This is a highly-referenced, yet accessible work. The "bitwise"
implementation (the name of the project), however was never open-
sourced.


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).


Best regards
Nikolaos Kavvadias

Post a followup to this message

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