search for: slicer

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

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. >> >> The whole code is available in this repository: >> https://github.com/jirislaby/LLVMSlicer >> >> The question I would like to ask is, would...

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: > https://github.com/jirislaby/LLVMSlicer > > The question I would like to ask is, would you accept this libra...

I'm trying to run some Windows programs that rely on using the serial port with a data slicer interface and a .SYS or .VXD file that under Windows is necessary to transfer the information from the serial port to the application... At least I think this is how it works. In Wine these apps are complaining that they can't find the .SYS/.VXD files. In Windows these .SYS and .VXD files are...

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

...or indirectly act the value of a variable occurrence [5]. Program slicing has been used in many applications, e.g., program verification, testing, maintenance, automatic parallelization of program execution, automatic integration of program versions. While it's straightforward to implement the slicer in the back-end of compiler using SSA form, the source code of the original program instead of intermediate representation is preferred in most cases. Moreover, we can further narrow the notion of slice, which contains statements that influence the value of a variable occurrence for specic program...

...oC. > > > If you want to work on points-to analysis, then you need to have some > feature which will benefit from using that points-to analysis.  Example > applications of points-to analysis would be optimization and static > backwards slicing. > I think implementing a program slicer would be doable. We have a prototype implemented; extending it and porting it to the newer version of LLVM shouldn't be hard. As for the optimizations, is there any optimization (maybe a client of pointer information, maybe not) that you would like to see implemented in LLVM that is not implem...

...sion of LLVM and probably needs some > TLC. It also only backtracks until it hits a load; additional code must > be written to backtrack further to find potentially reaching stores. > > The second option is to use some code written by Jiri Slaby at > https://github.com/jirislaby/LLVMSlicer. I believe his implementation > is a complete static backwards slicer, but I haven't used it myself, so > I don't know it's quality or what version of LLVM it uses. > > I think someone at UW-Madison may have an implementation as well; I'll > contact that person and s...

...or indirectly act the value of a variable occurrence [5]. Program slicing has been used in many applications, e.g., program verification, testing, maintenance, automatic parallelization of program execution, automatic integration of program versions. While it's straightforward to implement the slicer in the back-end of compiler using SSA form, the source code of the original program instead of intermediate representation is preferred in most cases. Moreover, we can further narrow the notion of slice, which contains statements that influence the value of a variable occurrence for speci c program...

...n a dataset containing ca. 500 specimens of 17 different species. The data is three text columns, followed by ca 70 columns of binary data. I'm trying to write a function that will allow me to interactively exclude species using the inofrmation in the third text column. My function, matrix.slicer, appears to work as I intend. However, when I pass the resulting matrix to my homemade principal coordinates function, pcoa, the results include all of the data, with nothing excluded. I've read the help for factors, levels, subset, [, and some threads here relating to subsetting and drop=...

...s, loops and functions to avoid deleting lines unexpectedly. I thought employing clang was a better idea. I don't know whether you think the source code genration is a good idea or not. I can release our simple script and improve it later. So I have more time/energy to contribute to the dynamic slicer. I think the slicing pass can be loaded by the opt. There is no need to change the front-end or other passes. I'm not sure whether the link time optimization can be exploited. We borrowed the LLVMSlicer code previously without LTO. Lastly, I'd like to introduce myself briefly. I'm a t...

...uns with an older version of LLVM and probably needs some TLC. It also only backtracks until it hits a load; additional code must be written to backtrack further to find potentially reaching stores. The second option is to use some code written by Jiri Slaby at https://github.com/jirislaby/LLVMSlicer. I believe his implementation is a complete static backwards slicer, but I haven't used it myself, so I don't know it's quality or what version of LLVM it uses. I think someone at UW-Madison may have an implementation as well; I'll contact that person and see. -- John T. >...

...o > avoid deleting lines unexpectedly. I thought employing clang was a > better idea. I don't know whether you think the source code genration > is a good idea or not. I can release our simple script and improve it > later. So I have more time/energy to contribute to the dynamic slicer. > > I think the slicing pass can be loaded by the opt. There is no need to > change the front-end or other passes. I'm not sure whether the link > time optimization can be exploited. We borrowed the LLVMSlicer code > previously without LTO. The problem with loading passes in...

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

From: Thorvald Natvig <slicer at users.sourceforge.net> --- celt.pc.in | 2 +- configure.ac | 2 ++ libcelt/Makefile.am | 12 ++++++------ tests/Makefile.am | 2 +- tools/Makefile.am | 4 ++-- 5 files changed, 12 insertions(+), 10 deletions(-) diff --git a/celt.pc.in b/celt.pc.in index 98...

...meet the requirements of both > subsets of the community. > > The runtime bloat tool also looks interesting, and your approach (at least > to me) is interesting. One question in my mind, though, is whether dynamic > slicing is going to work well. Swarup Sahoo and I built a dynamic slicer > for LLVM named Giri, and we found the tracing required for dynamic slicing > to be slow. For our purposes, the overhead was okay as we only needed to > record execution until a crash (which happened quickly). In your bloat > tool, the program will probably run for awhile, creating a...

From: Thorvald Natvig <slicer at users.sourceforge.net> Some optimizing compilers miscompile the current SSE optimizations when full optimizations are enabled. By using output value pointer instead of a return value, we can bypass this misbehaviour. --- libspeex/resample.c | 8 ++++---- libspeex/resample_sse.h | 2...

Hi all, As a Ph.D. student majored in Software Reliability, I have used LLVM in many of my projects, such as the Anticipating Invariant ( http://james0zan.github.io/AI.html) and some other undergoing ones. Thus, it would be a great pleasure for me if I could take this opportunity to contribute to this awesome project. After reading the idea list (http://llvm.org/OpenProjects.html), I was most

...h >> subsets of the community. >> >> The runtime bloat tool also looks interesting, and your approach (at >> least to me) is interesting. One question in my mind, though, is whether >> dynamic slicing is going to work well. Swarup Sahoo and I built a dynamic >> slicer for LLVM named Giri, and we found the tracing required for dynamic >> slicing to be slow. For our purposes, the overhead was okay as we only >> needed to record execution until a crash (which happened quickly). In your >> bloat tool, the program will probably run for awhile, cre...

...gt;> The runtime bloat tool also looks interesting, and your >> approach (at least to me) is interesting. One question >> in my mind, though, is whether dynamic slicing is going >> to work well. Swarup Sahoo and I built a dynamic slicer >> for LLVM named Giri, and we found the tracing required >> for dynamic slicing to be slow. For our purposes, the >> overhead was okay as we only needed to record execution >> until a crash (which happened quickly). In your...