similar to: Slicing an array

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

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.

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

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

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,

I'm using lattice to draw a multi-panel figure: 5 rows, 4 columns. The y-axis for each panel is determined by yaxs <- list(draw=T , labels=c(0, '.5', '1', '1.5') , at=c(0, .5, 1, 1.5) , tck=c(.4, 0) , cex=.7 , alternating=2

Dear R-users, I am looking for a way to assign to slices of arrays where dimensionality of the array is not a-priory known. Specifically, I would like to be able to generalize the following example of dimensionality 2 to an arbitrary diminsionality: In this example we create an array x, a smaller array y and then assign y to a slice of x. > dimnmx <- list(c('a','b'),

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

Suppose I have an n-diml array A and I want to extract the first "row" -- ie all elements A[1, ...] Interactively if I know 'n' I can write A[1,,,,,] with (n-1) commas. How do I do the same more generally, eg in a script? (I can think of doing this by converting A to a vector then extracting the approp elements then reshaping it to an array, but I wonder if there isn't a

What should findInterval(x,vec,all.inside=TRUE) return when length(vec)<=1, so there are no inside intervals? R-3.3.0 gives a decreasing map of x->output when length(vec)==1 and -1's when length(vec)==0. Would '0' in all those cases be better? > findInterval(x=c(10, 11, 12), vec=11, all.inside=TRUE, rightmost.closed=FALSE, left.open=FALSE) [1] 1 0 0 >

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, 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:

Hello, If I want to apply some f(x) to such chunks of the the array dim(A)==c(d1,d2,d3,..,dk,...,dn) which are defined by A[...,ik,...] (ik belongs to {1,..,dk}), for now I use iteration via 'for (i in dim(A)[k]) f(A[...,k,...])' . Is there any more elegant approach, e.g like in 'apply' function which you can use on margin of the array. Just in my case I want the entire slice

A list contains several matrices. Over all matrices (list elements) I'd like to access one matrix cell: m <- matrix(1:9, nrow=3, dimnames=list(LETTERS[1:3], letters[1:3])) l <- list(m1=m, m2=m*2, m3=m*3) l[[3]] # works l[[3]][1:2, ] # works l[[1:3]][1, 1] # does not work How can I slice all C-c combinations in the list? S?ren -- S?ren Vogel, Dipl.-Psych. (Univ.), PhD-Student, Eawag,

In normal tree rotation left process, we will never touch the tree branch above subtree_index and ocfs2_extend_rotate_transaction doesn't reserve the credits for them either. But when we want to delete the rightmost extent block, we have to update the rightmost records for all the rightmost branch(See ocfs2_update_edge_lengths), so we have to allocate extra credits for them. What's more,

Dear Jin, I've talked with Vikram, and we agree that having this code (and a dynamic backwards slicing pass that Swarup and I wrote) in a publicly available SVN repository is a good thing. I'll try to get you a copy of the static slicing code some time next week (I should be able to work on it Monday morning) so that you can start working with it right away. I can work on making a

Hi, maybe you can have a look at the CReduce project: http://embed.cs.utah.edu/creduce/ This project implements many source-to-source transformations of C programs, e.g. removing functions, changing variable names, deleting branches in if-statements, etc. Some of these are purely based on the source code, other use the Clang frontend. Hope this helps, Jonas On Sun, Mar 17, 2013 at 7:25 PM,

On 5/1/13 11:36 PM, Mingliang LIU wrote: > 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 >

Hello John et al - I have been struggling to implement static backwards slicing with LLVM. After digging llvmdev postings for some time, I see that other people were having similar difficulties and John's got almost complete code that may be shared. May I get a copy of it, too? Better yet, it would be helpful for many other people if the code were checked in to an example directory or

Hi All, Are there any known implementations of static inter-procedural slicing for LLVM (especially forward slicing)? I did find a few references to it in the archives dating back to 2008, but am not sure what the current status is. Any pointers would be highly appreciated. Thanks Rohit Grad Student Middleware Security and Testing Group http://cs.wisc.edu/mist University of Wisconsin-Madison