similar to: [LLVMdev] GSoC - Range Analysis

On 3/29/12 3:59 PM, Victor Campos wrote: > Dear LLVMers, > > I have been working on Douglas's range analysis, and today, after > toiling with it for two years, we have a very mature and robust > implementation, which is publicly available at > http://code.google.com/p/range-analysis/. We can, at this point, > perform range analysis on very large benchmarks in a few

> What version of LLVM does your analysis use currently? We are working with LLVM 3.0 (stable release) > It sounds like your analysis is fast. Can you show results on how fast it > is on various programs? Do you have measurements on how much memory it > uses? How large is the largest program you've compiled with it? Yes, we have a very extensive report about it. Take a look

Hi Victor, > I have been working on Douglas's range analysis, and today, after > toiling with it for two years, we have a very mature and robust > implementation, which is publicly available at > http://code.google.com/p/range-analysis/. one of the big problems with Douglas's original range analysis was that it couldn't handle modulo arithmetic. For example, if an

Dear LLVM community, I would like to contribute to LLVM in the Google Summer of Code project. My proposal is listed below. Please let me know your comments. Adding Range Analysis to LLVM Abstract The objective of this work is patch our implementation of range analysis into LLVM. I have a running implementation of range analysis in LLVM, but it is not currently part of the main distribution. I

Dear Douglas, Comments below. On 3/23/11 8:06 AM, Douglas do Couto Teixeira wrote: > Dear LLVM community, > > I would like to contribute to LLVM in the Google Summer of Code > project. My proposal is listed below. Please let me know your comments. > > > Adding Range Analysis to LLVM > > > > Abstract > > The objective of this work is patch our

> from what I understand of the analysis, to come to its conclusions it assumes > that there is no overflow. That doesn't make it useless for removing integer > overflow checks: you can successively walk variables, and if you can prove that > there is no overflow of a variable X given your analysis of previously seen > variables, then X can safely be added to the set of

Dear LLVMers, My name is Raphael Ernani, and I am doing my MsC at the Federal University of Minas Gerais, Brazil. I have been using LLVM for a while, and I would like to participate in this year's Summer of Code. One particular idea, in your "open projects" page caught my eye, and I decided to write a proposal about it. The line that I liked in the page was "Create an LLVM

Hi, I'm interested in using the "Data Structure Analysis" that is apparently in the "poolalloc" module according to the documentation on alias analysis in LLVM. I have downloaded and built LLVM 2.6 on MinGW but the sources do not seem to include anything related to pool allocation. I don't think MinGW includes svn. Is there an download location where I can get the

On 3/30/12 2:32 PM, Victor Campos wrote: > > What version of LLVM does your analysis use currently? > > We are working with LLVM 3.0 (stable release) > > > It sounds like your analysis is fast. Can you show results on how > fast it > > is on various programs? Do you have measurements on how much memory it > > uses? How large is the largest program you've

Please create a similar branch for Klee; I've been working on porting that to 2.7 as well.<br /> <br /> Best, Erich Ocean<br /> <br /> On Fri, Mar 5, 2010 at 8:43 PM, John Criswell (criswell@uiuc.edu) wrote:<br /> > <br /> > Dear SAFECoders and LLVMers,<br /> > <br /> > There is some new work on moving DSA to the new LLVM 2.7 API.

Dear LLVMers, my name is Douglas, and I would like to participate in the Summer of Code this year. I am currently a Computer Science student at the Federal University of Minas Gerais, Brazil, and I work as a research assistant at the Programming Languages Lab, in that university. I work together with Andre Tavares and Andrei Rimsa, two summer of coders last year, and my advisor is Fernando

On Mar 6, 2010, at 7:26 AM, Patrick Sathyanathan wrote: > Hi, > > I'm interested in using the "Data Structure Analysis" that is apparently in the "poolalloc" module according to the documentation on alias analysis in LLVM. I have downloaded and built LLVM 2.6 on MinGW but the sources do not seem to include anything related to pool allocation. I don't think

Dear LLVMers and Clangers, We'll be doing some maintenance on the LLVM repository on Tuesday, Sept. 14 (tomorrow). There were some files committed to the repository that we believe need to be removed from both mainline, the branches, and the revision history. The SVN repository will go *off-line* at 7:00 am Central Daylight Savings time on Tuesday. Please do not make any commits after

Bob Wilson wrote: > On Mar 6, 2010, at 7:26 AM, Patrick Sathyanathan wrote: > > >> Hi, >> >> I'm interested in using the "Data Structure Analysis" that is apparently in the "poolalloc" module according to the documentation on alias analysis in LLVM. I have downloaded and built LLVM 2.6 on MinGW but the sources do not seem to include anything

Török Edwin wrote: > On 2009-11-14 00:57, John Criswell wrote: > >> Dear LLVMers, >> >> We are happy to announce an alpha release of the SAFECode compiler. It >> is now available for download from the LLVM public Subversion >> repository. SAFECode uses a set of analysis passes and program >> transformations to provide strong memory safety

On Fri, Mar 30, 2012 at 11:49 AM, John Criswell <criswell at illinois.edu>wrote: > On 3/30/12 1:08 PM, Raphael Ernani Rodrigues wrote: > > Dear LLVMers, > > My name is Raphael Ernani, and I am doing my MsC at the Federal > University of Minas Gerais, Brazil. I have been using LLVM for a > while, and I would like to participate in this year's Summer of Code. >

On 3/30/12 1:08 PM, Raphael Ernani Rodrigues wrote: > Dear LLVMers, > > My name is Raphael Ernani, and I am doing my MsC at the Federal > University of Minas Gerais, Brazil. I have been using LLVM for a > while, and I would like to participate in this year's Summer of Code. > One particular idea, in your "open projects" page caught my eye, and I > decided to

Hi: I have been working on Valgrind [porting it to non-supported architectures] and wanted to know what you guys think of Valgrind for LLVM. I haven't thought through fully myself - so wanted to get your inputs before becoming rigid in my own opinion. Original Valgrind works on object code - translating the asm to its own IR [intermediate representation]. But for LLVM, probably putting the

Dear LLVMers, I wrote a new proposal, to improve the static array bounds checking in SAFEcode, as follows: Improving static array bounds checking in SAFEcode ================================================== Objective --------- the main objective of this project is to improve the static array bounds checking engine used in SAFECode. It was written after the open project at

Hi, guys, thank you for all the feedback. I will try to answer your questions below. But, if you think that might not be a good GSoC project, do not hesitate to tell me. I can try to write a different proposal. Nevertheless, I would like to hear from you what you think is important to have in the range analysis. By reading your e-mails, I see that there are still a lot of things that we do