search for: hardekopf

...ng > standard dataflow solvers, and that's an implementation strategy, but > it will be really slow. > > Part of the tradeoff is how fast something runs, and approaches that > are orders of magnitude faster often change the calculus of what > people do. For example, before hardekopf's work, andersens was > considered too slow to be practical in a real compiler. > > Now, GCC does it by default. > > So i would call that approach a superior approach :) > > So saying that CFL-AA offers nothing superior in terms of approach, > IMHO, misunderstands the...

...soon.) As far as I know, none of the built-in analysis (basicAA, globals-modref, andersAA, etc.) is intended to be flow-sensitive. So I searched and came across these two 1. https://github.com/unsw-corg/SVF by Yulei Sui (for LLVM 3.8) 2. http://www.cs.ucsb.edu/~benh/research/downloads.html by Ben Hardekopf (for LLVM 2.5) Are there other implementations which use the AA-Interface? Giving a little context, I need some functionality in LLVM that answers the following question. For a given argument of a call instruction in the cfg: Where does the value of the argument come from at the call site? So I...

> It is merely a demand-driven way of implementing existing > analyses, by extending those algorithms to track additional > "pointed-to-by" information. Laziness may help with the running > time of the cfl analysis when only partial points-to info is > needed, but if the client wants to do a whole-program analysis and > require whole-program

...t methods so far. Originally, I attempted to use the Makefiles of the projects with llvm-gcc as the compiler (make CC="llvm-gcc -emit-llvm"), then manually link all the resulting bitcode files into a single one. This works on a few examples, but not all of them. Next, I was pointed to Ben Hardekopf's work on pointer analysis; it turns out he has a nifty perl script for doing exactly the sort of thing I'm trying to do. Unfortunately, that script doesn't seem to work on all programs either. It worked quite well on some of my examples, but not at all on others. So basically, I'm...

...ion (of sorts) and the last is a C++ library for doing symbolic computation which is quite easy to use with an RTTI build of LLVM. If you can give us an example of what symbolic equation you might be trying to "solve", I'm sure we can narrow it down or suggest something new. Also, Ben Hardekopf & Calvin Lin have an article in CGO'11 about a flow-sensitive pointer analysis. You might take a look and see if they used something that might help you out. H. On Mon, Nov 18, 2013 at 11:31 AM, Peter Chang <blankboy2011 at gmail.com>wrote: > Hello, > > I want to do poin...

...nderstand is that these context sensitive BDD algorithms work okay on java, but fall down pretty badly on C/C++, because it is a much bigger problem. Whaley's is just brute force, and Zhu's is pretty darn complex. Both are amenable to the same style of offline variable optimizations that Hardekopf, et al (Ben and a friend have been helping out with implementation of andersen's in LLVM), and that may actually make them usable for real world programs. > 3. Do existing optimisations and DFAs that depend on aliasing > information interface with the alias analysis in a context sensit...

...ion, so I'd prefer input from others. That said, I believe the Polly framework and LLVM's memory dependence analysis pass may be useful. As parallelizing C programs will need points-to analysis, the DSA project (found within the poolalloc source code) or the work of Calvin Lin and Ben Hardekopf (http://www.cs.ucsb.edu/~benh/downloads.html) may be useful, too. -- John T. > > Thanks in advance > > Andreas > > > _______________________________________________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu > http://list...

Hello, I want to do points-to anlysis in llvm IR. I want it to be path sensitive, which means that when I print out the result, I need append the condition for the "May" Points-to. I plan to using symbolic execution to achieve this goal. Are there any tools in llvm, or stand-alone tools to solve the symbolic equation. Thank you! ----Peter Chang -------------- next part

FWIW, Ben Hardekopf asked me to post this for him on the subject Regarding Whaley and Lam's BDD-based approach to context-sensitive analysis, there is a paper by the same research group (Avots et al in ICSE'05) that adapts their technique for C. The results are not very encouraging -- their system doesn't...

...ization, so I'd prefer input from others. That said, I believe the Polly framework and LLVM's memory dependence analysis pass may be useful. As parallelizing C programs will need points-to analysis, the DSA project (found within the poolalloc source code) or the work of Calvin Lin and Ben Hardekopf (http://www.cs.ucsb.edu/~benh/downloads.html) may be useful, too. > Thank you, I will look through your recommendations. Andreas > -- John T. > >> >> Thanks in advance >> >> Andreas >> >> _______________________________________________ >> LL...

Hello, I found some code within the pool allocation project to identify parallelizable function calls. Unfortunately the functionality isn't part of the current release of poolalloc (in release 14 it was). My intention is to estimate the parallelization-potential of sequential applications concerning coarse-grained parallelism. Can you tell me... 1. Why are classes of pollalloc, like

On Wed, Mar 5, 2008 at 3:44 AM, Xi Wang <xi.wang at gmail.com> wrote: > On Mon, Mar 3, 2008 at 6:55 PM, Richard Warburton > > <richard.warburton at gmail.com> wrote: > > > > No > > > I've got a BDD based version of andersen's around already (uncommitted). > > > It's slower in time (by a factor of 8 or so), but very slightly (1-2

...sensitive (someone else labeled it "bottom-up context sensitive" in a later paper), which makes up for unification in some cases. As you probably know, the two are not comparable: inclusion style analyses will do better in some cases but context-sensitivity will do better in others. Ben Hardekopf and Calvin Lin have a good inclusion-based analysis for LLVM that is open source. They actually have two separate algorithms: flow-insensitive and flow-sensitive. I believe the former has been released publicly but Ben may be able to give you the latter as well. Neither of them is context-sensit...

...rom >> others. That said, I believe the Polly framework and LLVM's memory >> dependence analysis pass may be useful. As parallelizing C programs >> will need points-to analysis, the DSA project (found within the >> poolalloc source code) or the work of Calvin Lin and Ben Hardekopf >> (http://www.cs.ucsb.edu/~benh/downloads.html) may be useful, too. Hi Andreas, sorry for replying slowly. In respect of parallelizing function calls Polly may or may not help you. In case you want some interprocedural analysis or you want to detect if functions are 'pure' or ...

...y's is just brute force, > and Zhu's is pretty darn complex. I was interested to see whether Whaley's algorithm really works particularly, given its simplicity and the claims made in the papers. > Both are amenable to the same style of offline variable optimizations > that Hardekopf, et al (Ben and a friend have been helping out with > implementation of andersen's in LLVM), and that may actually make them > usable for real world programs. Are you referring to both the PLDI and the SAS papers? > > 4. Is anyone willing to mentor this project? > I would....

...in analysis (basicAA, >> globals-modref, andersAA, etc.) is intended to be flow-sensitive. So I >> searched and came across these two >> >> 1. https://github.com/unsw-corg/SVF by Yulei Sui (for LLVM 3.8) >> 2. http://www.cs.ucsb.edu/~benh/research/downloads.html by Ben Hardekopf >> (for LLVM 2.5) >> >> Are there other implementations which use the AA-Interface? >> >> Giving a little context, I need some functionality in LLVM that answers >> the following question. >> For a given argument of a call instruction in the cfg: Where does...

This email is written on the premise that LLVM will be involved in GSOC again this year. I noted that the wiki's open projects page [0] has several possible projects, that seem suitable for a summer of code project. I am writing this email to this list with the hope of getting some feedback on specifics for a GSOC application, and also wondering if any potential mentors are interested in

Hi, I was wondering, is there any code available on LLVM for flow sensitive context sensitive (fscs) pointer analysis? Thanks, Ray -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20111102/01246f86/attachment.html>

Hi, Is there a way to use LLVM to build the visual representation of program dependence graph (PDG) of a routine/program? >From looking at https://llvm.org/svn/llvm-project/poolalloc/branches/release_14/lib/DSA/PgmDependenceGraph.cpp, it looks like there is an incomplete implementation of PDG in LLVM. However, when I search within LLVM3.0 package, I don't find the .cpp/h code. So, I also

Hi all, I was trying to find the equivalent analysis of Andersens on LLVM. I found it only on LLVM 2.6 on 'Analysis/IPA' folder. Is it removed/renamed on later versions? I'm mostly interested in 3.4 version or later. Thank you in advance, -- Irini -------------- next part -------------- An HTML attachment was scrubbed... URL: