search for: lianli

...e are interested in contributing it to LLVM itself. Our manager agrees to commit resources for maintenance needs if it is accepted by the community. Regards, Lian On Fri, Oct 18, 2013 at 3:43 PM, Chris Lattner <clattner at apple.com> wrote: > > On Oct 17, 2013, at 5:20 PM, lian li <lianli at gmail.com> wrote: > > Hi All, > > This is Lian Li from Oracle Labs in Brisbane Australia. > > We have developed a precise and highly efficient pointer analysis > framework on top of LLVM, The approach is flow, context, and field > sensitive, details are described in...

On Oct 17, 2013, at 10:51 PM, lian li <lianli at gmail.com> wrote: > Thanks, Chris. > > We are interested in contributing it to LLVM itself. Our manager > agrees to commit resources for maintenance needs if it is accepted by > the community. This is great. Please make sure Oracle legal sign off on explicitly granting LLVM...

..., the compilation time overhead will be larger if we link all individual compilation units together and run the analysis over the whole application. Regards, Lian On Sat, Oct 19, 2013 at 7:56 AM, Evan Cheng <evan.cheng at apple.com> wrote: > > On Oct 17, 2013, at 10:51 PM, lian li <lianli at gmail.com> wrote: > >> Thanks, Chris. >> >> We are interested in contributing it to LLVM itself. Our manager >> agrees to commit resources for maintenance needs if it is accepted by >> the community. > > This is great. Please make sure Oracle legal sign...

...tests would be interesting too. > > Thanks again, > Hal > > > > > Regards, > > Lian > > > > On Sat, Oct 19, 2013 at 7:56 AM, Evan Cheng <evan.cheng at apple.com> > > wrote: > > > > > > On Oct 17, 2013, at 10:51 PM, lian li <lianli at gmail.com> wrote: > > > > > >> Thanks, Chris. > > >> > > >> We are interested in contributing it to LLVM itself. Our manager > > >> agrees to commit resources for maintenance needs if it is accepted > > >> by > > >&...

...t; complexity [29], where L is the size of the grammar and N is the > size of the graph." > > should now been reduced to O(n + m log m) time, assuming you are > using a standard balanced parentheses formulation. > > > > > On Thu, Oct 17, 2013 at 9:51 PM, lian li <lianli at gmail.com> wrote: >> Hi Hal, >> >> Thanks for your interest. >> >> We tested with the following existing compiler optimizations in LLVM >> with SPECINT2006 benchmarks: >> -dse (dead store elimination), >> -gvn (global value numbering), >>...

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

...the > analysis over the whole application. Yes, LTO tests would be interesting too. Thanks again, Hal > > Regards, > Lian > > On Sat, Oct 19, 2013 at 7:56 AM, Evan Cheng <evan.cheng at apple.com> > wrote: > > > > On Oct 17, 2013, at 10:51 PM, lian li <lianli at gmail.com> wrote: > > > >> Thanks, Chris. > >> > >> We are interested in contributing it to LLVM itself. Our manager > >> agrees to commit resources for maintenance needs if it is accepted > >> by > >> the community. > > > &...

Hi All, This is Lian Li from Oracle Labs in Brisbane Australia. We have developed a precise and highly efficient pointer analysis framework on top of LLVM, The approach is flow, context, and field sensitive, details are described in the two papers below: "Boosting the performance of flow-sensitive points-to analysis using value flow" (in ESEC-FSE 2011), and "Precise and

Hi Hal, Thanks for your interest. We tested with the following existing compiler optimizations in LLVM with SPECINT2006 benchmarks: -dse (dead store elimination), -gvn (global value numbering), -licm (loop invariant code motion), -bb-vectorize (basic block vectorization), -memcpyopt (memcpy optimization), -sink (code sinking), -loop-idom (recognize loop idioms), -argpromotion (argument

...erally more expensive as it has O(L^3 N^3) complexity [29], where L is the size of the grammar and N is the size of the graph." should now been reduced to O(n + m log m) time, assuming you are using a standard balanced parentheses formulation. On Thu, Oct 17, 2013 at 9:51 PM, lian li <lianli at gmail.com> wrote: > Hi Hal, > > Thanks for your interest. > > We tested with the following existing compiler optimizations in LLVM > with SPECINT2006 benchmarks: > -dse (dead store elimination), > -gvn (global value numbering), > -licm (loop invariant code motion),...

...t; Thanks again, >> Hal >> >> > >> > Regards, >> > Lian >> > >> > On Sat, Oct 19, 2013 at 7:56 AM, Evan Cheng <evan.cheng at apple.com> >> > wrote: >> > > >> > > On Oct 17, 2013, at 10:51 PM, lian li <lianli at gmail.com> wrote: >> > > >> > >> Thanks, Chris. >> > >> >> > >> We are interested in contributing it to LLVM itself. Our manager >> > >> agrees to commit resources for maintenance needs if it is accepted >> > &gt...

...rt -------------- > An HTML attachment was scrubbed... > URL: <http://lists.cs.uiuc.edu/pipermail/llvmdev/attachments/20131022/58d8b6ee/attachment-0001.html> > > ------------------------------ > > Message: 2 > Date: Tue, 22 Oct 2013 23:35:08 +1000 > From: lian li <lianli at gmail.com> > To: Evan Cheng <evan.cheng at apple.com> > Cc: LLVM Developers Mailing List <llvmdev at cs.uiuc.edu> > Subject: Re: [LLVMdev] Contribute a new precise pointer analysis to > LLVM > Message-ID: > <CAAwsJt_u4t9XgwRK7Bm-iJ-PNtG3FX4y6iqfm8W4XXyYM95Up...

On Oct 17, 2013, at 5:20 PM, lian li <lianli at gmail.com> wrote: > Hi All, > > This is Lian Li from Oracle Labs in Brisbane Australia. > > We have developed a precise and highly efficient pointer analysis > framework on top of LLVM, The approach is flow, context, and field > sensitive, details are described in th...

Hi Lian, I am certainly interested in seeing this; do you have performance numbers (compile time)? Also, can you share more information about the promising optimization results you mentioned? Thanks, Hal ----- Original Message ----- > Hi All, > > This is Lian Li from Oracle Labs in Brisbane Australia. > > We have developed a precise and highly efficient pointer analysis >

Hi, was just wondering if there''s a way to create a local forge repositories to host our local modules? Has anyone done that? I found this post, http://projects.puppetlabs.com/issues/5033. that was one year ago. Wondering if there''s a way to do it now? Thanks. -- You received this message because you are subscribed to the Google Groups "Puppet Users" group. To

Hi Christian, Thank you so much for the reply! Please see my comments inline. On 03/21/2016 09:32 AM, Christian Convey wrote: > Hi Jia, > > If one looks at existing research literatures, there are even more > algorithm to consider for doing pointer analysis. > > > For at least some published AA algorithms, there may be some > uncertainty about software patents

Hi all! I'm new to this forum so please excuse me if I don't conform perfectly to the protocols on this board! I'm trying to get an estimate of true prevalence based upon results from an imperfect test. I have various estimates of se/sp which could inform my priors (at least upper and lower limits even if with a uniform distribution) and found the following code on this website..

Compilation error output is attached. Seems that G++ 3.4.5 fails to pick the right specialization version of getExprLocImpl() function in lib/AST/Expr.cpp. -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: error URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110211/4a248936/attachment.ksh>

On Feb 11, 2011, at 3:48 AM, Lian Cheng wrote: > Compilation error output is attached. > > Seems that G++ 3.4.5 fails to pick the right specialization version of getExprLocImpl() function in lib/AST/Expr.cpp. http://llvm.org/docs/GettingStarted.html#brokengcc -eric -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hi all I want to use function of is.list and is.data.frame in if-else statement, but I get a trouble. To replicate this trouble, I run codes like that: > set.seed(123) > x <- rnorm(100) > x <- data.frame(matrix(x, 10, 10)) > class(x) [1] "data.frame" > is.list(x) [1] TRUE > is.data.frame(x) [1] TRUE > version _ platform i386-pc-mingw32