similar to: [LLVMdev] Type-Based Alias Analysis

I'm designing a language that supports array slicing. Does LLVM allows conversions between array pointers? For example, can I cast a pointer-to-array-of-5-ints to a pointer-to-array-of-3-ints? Can I get the address of the third element of an array-of-5-ints and convert it to a pointer-to-array-of-3-ints? Then again, I suppose a pointer-to-int would work just as well since LLVM

Hi all, This is a GSoC 2013 proposal for LLVM project. Please see the formatted version at here: http://pacman.cs.tsinghua.edu.cn/~liuml07/files/gsoc2013-proposal-program-slicing.pdf Program slicing has been used in many applications, the criteria of which is a pair of statement and variables. I would like to write an inter-procedural program slicing pass in LLVM, which is able to calculate C

Dear Tarun, Swarup Sahoo and I wrote some LLVM passes for dynamic slicing for LLVM 2.6. I believe we had planned to make the code publicly available as part of the Giri project (http://llvm.org/viewvc/llvm-project/giri/trunk), but due to other commitments, we have not moved the code into that SVN repository yet. Let me check with Vikram and Swarup to see about getting a copy of the code to you.

On 10/9/11 12:12 AM, Jinwook Shin wrote: > Thanks John. I appreciate your help and I look forward to obtaining the code. > > A proper LLVM sub-project: No rush on this and please take your time. Thanks. Okay, I've created a new LLVM sub-project called Giri(*). It currently contains only the static backwards slicing pass. I'll add the dynamic slicing code to the project later.

Sir, We are interested in implementing Type Based Alias Analysis(TBAA) in LLVM. This is prescribed as one of the projects in the Open Projects list of the LLVM website. One of the links in your page is not working. I am giving the link below http://www.ice.gelato.org/oct07/pres_pdf/gelato_ICE07oct_aliasing_isaev_intel.pdf Kindly send me any additional resources and suggestions you have on this

Thanks John for the super quick checkin. I was a little surprised here. Yesterday/today I spent some time trying to build poolalloc on my mac dev machine. Unfortunately, it failed to build [1]. Looks like the compiler can't find the header files under /usr/include/c++. I also tried to build on my linux box and saw the same problem. giri built successfully. Are you sure poolalloc builds on

Hi all, I've been trying to work out how to slice an array of arbitrary dimension. I found a message showing how to stick two arrays together, but so far have been unable to transform that into what I need. Assume that I have a four dimensional array for example: array4d , , 1, 1 [,1] [,2] [1,] 3 6 [2,] 1 1 , , 2, 1 [,1] [,2] [1,] 4 7 [2,] 8 7 , , 1, 2

Hi, I want to find the dynamic slice of a given code. Is this already implemented in LLVM?. If not which functions are there in the LLVM to do dynamic analysis.

On 10/11/11 5:05 PM, Jinwook Shin wrote: > Thanks John for the super quick checkin. I was a little surprised here. Creating a new project was easy, and it seemed the easiest way to send the code to you. :) > > Yesterday/today I spent some time trying to build poolalloc on my mac dev > machine. Unfortunately, it failed to build [1]. Can you do a make VERBOSE=1 and send me the

On 4/3/13 8:21 AM, Marcelo Sousa wrote: > I am interested in type-based verification of LLVM IR in the areas of > certified compilation and software Can you explain what you mean by type-based verification? Do you mean that you want to use a set of typing rules to perform verification, or do you mean something else? > verification. It seems to me that the LLVM IR type system is

I am interested in type-based verification of LLVM IR in the areas of certified compilation and software verification. It seems to me that the LLVM IR type system is rather informal in the sense that there is no paper with a proper formalization of the type rules, and for example, a proof of soundness for well-formedness of the code. I would like to know if you are aware of any work in this

Thanks John. I appreciate your help and I look forward to obtaining the code. A proper LLVM sub-project: No rush on this and please take your time. Thanks. - Jin -----Original Message----- From: Criswell, John T [mailto:criswell at illinois.edu] Sent: Saturday, October 08, 2011 11:58 AM To: Jinwook Shin; llvmdev at cs.uiuc.edu Subject: RE: interprocedural static backwards slicing Dear Jin,

Hi all, I had a second thought of the dynamic slicing, as well as the source code generating. Firstly, the dynamic slicing is very useful to software community (I'll illustrate more in the refined proposal later), but it's already implemented by Swarup and John Criswell from UIUC. The static slicing code has been released as Giri project in LLVM, and they would kindly release the dynamic

Hi John, thanks for your feedback. I'll try to answer your comments bellow. On Mon, Apr 2, 2012 at 10:59 AM, John Criswell <criswell at illinois.edu> wrote: > On 3/30/12 7:07 PM, Douglas do Couto Teixeira wrote: >> >> Hi guys, >> >> I'm an undergraduate computer science student and I've been working >> with pointer analysis this semester under

Hi all, I'm doing the program slicing [1] in LLVM. Now I implemented the Weiser's algorithm [2] in a simple way by writing a plugin to analyze the IR. My final goal is to slice the source code, thus I recorded all the lines of source code to be sliced. The last step is to delete the lines which are not in the program slice. However, I met a problem when deleting the source code directly:

On 11/4/2011 3:29 AM, Nick Lewycky wrote: > I suspect that GCC is doing option 2, or something else I haven't > thought of (TBAA? if so, why doesn't our TBAA do as well?). Nick, The problem is that LLVM's implementation of TBAA does not distinguish between these two types: i32*** @AAA and i32** %arrayidx. We believe that type based alias analysis should, in general, be able

> Yes.  The current TBAA implementation is conservative, with the idea that it > can become more aggressive (and with TBAA, this fundamentally means > "more dangerous") with incremental steps. Dan, Could you disclose more details about how to implement the "incremental steps" to handle more complicated alias cases? For example, differentiate different pointers that

Hi, I am an out-of-tree user of llvm. I am running into an regression issue against llvm 5.0. The issue was introduced by "[BasicAA] Use MayAlias instead of PartialAlias for fallback."( https://reviews.llvm.org/D34318) I have attached a very simple program to reproduce the issue. The symptom is alias analysis report NoAlias to GVN which cause GVN do wrong optimization. The BasicAA

----- Original Message ----- > From: "Alex Bradbury" <asb at asbradbury.org> > To: llvm-dev at lists.llvm.org > Cc: "Hal Finkel" <hfinkel at anl.gov> > Sent: Sunday, November 8, 2015 10:30:09 AM > Subject: Re: noalias parameter attribute not currently exploited by alias analysis? > > On 2 November 2015 at 20:20, Alex Bradbury <asb at

Dear John, Now, I want to do dynamic analysis by dynamic slicing based on LLVM. I just see that you have implemented dynamic slicing for LLVM. I also check the Giri project, and I don't find the code. I hope I can learn something from your code. I am very appreciated if you can tell me how to get the code or send me one copy. Thank you very much! Pengfei -- View this message in context: