similar to: Implementing Data Flow Integrity

Hi Xin, Thank you for your reply! I have tried the 3 alias analyses you have mentioned on LLVM 3.5: 1) $ opt -globalsmodref-aa -aa-eval < xxx.bc > /dev/null (May-alias response 100%) 2) $ opt -tbaa -aa-eval < xxx.bc > /dev/null (May-alias response 100%) 3) $ opt -cfl-aa -aa-eval < xxx.bc> /dev/null (Unknown command line argument '-cfl-aa') It seems that they are not

Hi, Who can recommand me some books about static analysis including systems verification, shape analysis and logic, termination analysis, security and safety, abstract interpretation and algorithms, abstract domain and data structures, pointer analysis, shape analysis, and data flow analysis. I want to read some basic books about the topic, Thank you! With Best Regards to you！ --------------

Hi Daniel, On 03/21/2016 11:05 AM, Daniel Berlin wrote: > > > On Tue, Mar 15, 2016 at 1:37 PM, Jia Chen via llvm-dev > <llvm-dev at lists.llvm.org <mailto:llvm-dev at lists.llvm.org>> wrote: > > Dear llvm devs, > > tl;dr: What prevents llvm from switching to a fancier pointer > analysis? > > > Nothing. > > > Currently,

Hi, Ben, As Will suggested, try the TD pass, not EQTD, and see if that works better for you. Having said that, DSA currently doesn't do well with vtables. It is not a fundamental limitation of the algorithm itself and we think we know how to improve it, so if those are important to you, let me know. DSA is indeed a unification-style analysis, not inclusion based. It is partially context

On Mar 21, 2016, at 10:00 AM, Jia Chen via llvm-dev <llvm-dev at lists.llvm.org> wrote: >> >> So my question here is: what kind(s) of precision really justify the cost and what kinds do not? >> >> Depends entirely on your applications. >> >> Has anybody done any study in the past to evaluate what kinds of features in pointer analyses will benefit what

Hi all, I'm a 3rd year CSE B.Tech student and have been studying LLVM since the past year. I have written a pass for doing register allocation as part of my course project and have also been studying LLVM code sections related to SSA construction, dominance frontiers,etc. I also made some contributions to the Polly project. Currently I am interested in improving the existing alias analysis

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>

Thanks for the fast response John. On Thu, Oct 1, 2015, at 04:51 PM, John Criswell wrote: > Dear Ed, > > First, someone has updated the DSA code in the poolalloc project to LLVM > 3.7, and a Master's student worked for me over the summer to update a > large chunk of SAFECode to LLVM 3.7. However, the update to LLVM 3.7 > isn't finished (we need to finish integrating

On Fri, Oct 18, 2013 at 7:27 AM, lian li <lianli at gmail.com> wrote: > Hi Daniel, > > I want to clarify that our analysis is not based on CFL-reachability. > We apply CFL-reachability to matching context information where the > exist from a function to a call-site must match > the entry from the corresponding call-site. Yes, sorry, I pulled the wrong quote, it was late.

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:

Hi Daniel, I want to clarify that our analysis is not based on CFL-reachability. We apply CFL-reachability to matching context information where the exist from a function to a call-site must match the entry from the corresponding call-site. The problem is a simple balanced parentheses problem in CFL-reachability, and it can be computed efficiently. The paper you mentioned is a very nice paper

Thanks John. I guess I will use a ModulePass, so when I am implementing the “runOnModule” function, do I have to loop through all the functions, for each functions all the BasicBlocks and for each BasicBlock all the instructions or given the Module I have to call the CallGraph directly? Is there an example out there? I can’t find anything. Thanks. Simone > On Feb 24, 2015, at 13:29, John

In an earlier message (http://lists.cs.uiuc.edu/pipermail/llvmdev/2011-August/042298.html), Andrew Lenharth suggested that EQTDDataStructures (from the poolalloc project) may only try to resolve indirect function calls. However, I am now finding that the generated DSCallGraph over-approximates the callees in a very simple indirect call. Some over-approximation is unavoidable, but this case

Hi LLVM dev team: I am now doing an experiment to comparing Steensgaard-style and Andersen-style pointer analysis on LLVM. Since steensgaard pointer analysis is in module "poolalloc", so I installed poolalloc release 2.6 on my machine(intel X86_64 RedHatEnterpriseLinux 5.1, gcc-4.2.4), two directories "include" and "lib" were created after installation but no

Hi, I'm looking for interprocedural AAs and have, of course, found https://llvm.org/docs/AliasAnalysis.html. However, the AAs that come bundled with LLVM do not work interprocedurally in a way that I need it (on/with stack variables). The two interesting looking AAs come with the optional `poolalloc' module that hasn't been updated in years (I guess

Oops thanks for the reminder. I did use another email address and am terribly sorry for it. Let me just post the link: https://docs.google.com/document/d/1Kvepb-v5Ta8ug_lLK1kZeexPNlpvj62K5iIF0fMuLyM/edit?usp=sharing On 03/25/2016 11:44 AM, John Criswell wrote: > Dear Jia, > > I don't see your proposal in the system. What is the title of your > proposal, and under what email

Hi, LLVM dev team: Thanks for your suggestion, I have done the experiment to compare the two pointer analysis(Andersen and Steensgaard) methods in LLVM, but the result was unexpected. In each test, I compare these two methods using same optimization; There are several tests, each with a different optimization. The benchmark is all the 11 C programs in CINT2000 of SPEC. In all the tests, I found

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

Hi, I met an alias analysis problem in the LICM phase. I am using the following piece of code to present this problem. 1 int size; 2 int ** AAA; 3 void * xalloc(int); 4 5 void foo(void) 6 { 7 int i; 8 AAA = (int**) xalloc(size * sizeof(int*)); 9 10 for (i=0; i<size; i++) 11 AAA[i] = 0; 12 } This code tries to

Hello John, I've finished the first version of my proposal on enhancing alias analysis. The proposal can be downloaded at http://james0zan.github.io/resource/GSoC15-Proposal-AA.pdf. I hope I've successfully justified the necessity and benefits of this project. If possible, please find some time to review it and give me some more feedbacks. Thank you very much! P.S. I'm working on