similar to: [LLVMdev] GSoC Proposal: Inter-Procedure Program Slicing in 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

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

John, Thanks for your quick reply. Firstly, I'd like to employ a slicer for our benchmarking work (in one word, reducing the long-time irrelevant computing). I find the giri project and the LLVMSlicer[1]. However, the giri doesn't seem a complete implementation to me. I admit that I have not finished reading document/discussion, e.g. the previous threads in this mailing list. While the

Hi, 1. How can I report a bug or commit a patch to the giri progject? I doubt this central commit list is the right place. 2. Are you still maintaining the giri project any more? Thank you. L On Thu, Jun 28, 2012 at 12:49 AM, John Criswell <criswell at illinois.edu>wrote: > On 6/26/12 5:07 PM, amruth.rd wrote: > > Hello, > > > > I am curious to know if

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 >

On 6/26/12 5:07 PM, amruth.rd wrote: > Hello, > > I am curious to know if LLVM offers any passes to do interprocedural slicing, I need to eliminate most of the computations(possibly all, if they don't influence the control flow), but the control flow of the program should be maintained at all cost. I did see an optimization pass to print the CFG of a function without its body to a

Hi Pengfei, Glad you tried the program and it works fine to you for the first place. Dr. Swarup and John from UIUC wrote most of the code, and released the original code to public. Dynamic slicing tool is really very useful. Giri is now far from perfect. For example, there are know bugs for multi-thread programs and I'm fixing it these weeks. I will take charge of this project for a while

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,

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, I am curious to know if LLVM offers any passes to do interprocedural slicing, I need to eliminate most of the computations(possibly all, if they don't influence the control flow), but the control flow of the program should be maintained at all cost. I did see an optimization pass to print the CFG of a function without its body to a dot file, but I am interested in generating the

Hi all, I need to know the line number range of a function. The start of the function line number can be found by the definition point, which is stored at the subprogram metadata: DISubprogram::getLineNumber(). However, there is no API (or the metadata in the first place) to know the end of the function. I have to visit all the instructions of the function and maintain the *max*line number of

Thank you very much for all your advices! I'll revise the proposal according to them. To George, As mentioned in the former emails of this thread, I intend to prepare two proposals for the AA project listed in the idea list and the bloat detection project proposed by myself respectively and at most one of them will be accepted by GSoC. Personally, I do prefer the second project since I'm

Hello John, Thank you for your advices and congratulations~ I'll read the code of cfl-aa and Giri first and make the decision of which project to pursue. The choice will be reported to this thread once I made the determination (hopefully within this week). Thanks! On 3 March 2015 at 23:12, John Criswell <jtcriswel at gmail.com> wrote: > Dear Mingxing, > > I think both

Hello, we, at the Masaryk University, have developed an interprocedural static slicer with other useful stuff. This includes Andersen's points-to analysis, accurate call-graph, modifies relations. The whole code is available in this repository: https://github.com/jirislaby/LLVMSlicer The question I would like to ask is, would you accept this library into the core LLVM if we send patches or

I've added the missing magic to Makefile.llvm.rules in r168685. On Tue, Nov 27, 2012 at 12:05 AM, Mingliang LIU <liuml07 at gmail.com> wrote: > Hi, > > I use the following line to configure, which can enable the c++11 in the > project building. However, I don't think it's an elegant way to do the > trick. > $ CXX="clang++ -std=c++11" ../configure

Hi, I use the following line to configure, which can enable the c++11 in the project building. However, I don't think it's an elegant way to do the trick. $ CXX="clang++ -std=c++11" ../configure I don't know why "-enable-cxx11" doesn't work as expected when I configure the project. Regards. On Mon, Nov 26, 2012 at 7:34 PM, Mingliang LIU <liuml07 at

On 02/14/2012 07:26 AM, Evan Cheng wrote: > Hi js, > > On Feb 13, 2012, at 8:49 AM, Jiri Slaby <jirislaby at gmail.com> wrote: > >> Hello, >> >> we, at the Masaryk University, have developed an interprocedural static >> slicer with other useful stuff. This includes Andersen's points-to >> analysis, accurate call-graph, modifies relations.

Hi js, On Feb 13, 2012, at 8:49 AM, Jiri Slaby <jirislaby at gmail.com> wrote: > Hello, > > we, at the Masaryk University, have developed an interprocedural static > slicer with other useful stuff. This includes Andersen's points-to > analysis, accurate call-graph, modifies relations. > > The whole code is available in this repository: >

Hi Arnold, Thank you. I googled but missed the release notes. Regards. On Thu, Dec 6, 2012 at 12:13 AM, Arnold Schwaighofer < arnold.schwaighofer at gmail.com> wrote: > The C Backend was remove in 3.1 > (http://llvm.org/releases/3.1/docs/ReleaseNotes.html): > > "Major Changes and Removed Features > ... > The C backend has been removed. It had numerous problems,

On 3/8/15 8:56 AM, Mingxing Zhang wrote: > Hello John, > > According to the FAQ, I can submit two proposals although at most one > of them can be accepted. > Thus I will prepare a proposal for each of the two projects. Correct. Only one proposal will be accepted. > And, after reading the code of cfl-aa and several related papers, I've > listed four milestones for the