search for: pldi2013

...tifying all function passes that transforms have been applied to a function. This is known, and will be taken into account as best as possible. :) If you have any questions, suggestions, comments, etc. about this, then feel free to ping me, George [1] - http://www.cse.cuhk.edu.hk/lyu/_media/paper/pldi2013.pdf?id=home&cache=cache [2] - https://docs.google.com/a/google.com/document/d/1lgKGuVoMVXBnqqT6fGNtgvx4P0I8fJbMPqeuGL9GoNU/pub <https://docs.google.com/a/google.com/document/d/1lgKGuVoMVXBnqqT6fGNtgvx4P0I8fJbMPqeuGL9GoNU/pub> -------------- next part -------------- An HTML attachment was...

I notice you guys formulate your CFL reachability problem as a balanced parentheses problem. What algorithm do you use to solve it? Are you aware of recent work that comes up with linear time and n log n time algorithms to solve this class of problems: http://www.cse.cuhk.edu.hk/lyu/_media/paper/pldi2013.pdf In particular, the time bound from the paper: "However, if we need the precise pointer information for all variables, CFL-based pointer analysis is generally 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." sho...

...your CFL reachability problem as a > balanced parentheses problem. > What algorithm do you use to solve it? > > Are you aware of recent work that comes up with linear time and n log > n time algorithms to solve this class of problems: > http://www.cse.cuhk.edu.hk/lyu/_media/paper/pldi2013.pdf > > In particular, the time bound from the paper: > > "However, if we need the precise pointer information for all > variables, CFL-based > pointer analysis is generally more expensive as it has O(L^3 N^3) > complexity [29], where L is the size of the grammar and N is...

...Martin and Steve Zdancewic Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) 2013 link to ACM DL: http://dl.acm.org/citation.cfm?id=2462164&CFID=338189688&CFTOKEN=97651820 Local pdf link: http://www.cs.rutgers.edu/~santosh.nagarakatte/pldi2013.pdf Thanks, Santosh -- Santosh Nagarakatte, Assistant Professor of Computer Science, Rutgers University, New Brunswick http://www.cs.rutgers.edu/~santosh.nagarakatte -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/atta...

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

...as a > > balanced parentheses problem. > > What algorithm do you use to solve it? > > > > Are you aware of recent work that comes up with linear time and n log > > n time algorithms to solve this class of problems: > > http://www.cse.cuhk.edu.hk/lyu/_media/paper/pldi2013.pdf > > > > In particular, the time bound from the paper: > > > > "However, if we need the precise pointer information for all > > variables, CFL-based > > pointer analysis is generally more expensive as it has O(L^3 N^3) > > complexity [29], where L i...

I need help. I can't get it to work. I'm crying here, really, I'm balling my eyes out. Is there any way for a beginner to get support with using LLVM? All my queries are just ignored or disregarded on this mailing list. Why isn't there an llvm mailing list for novices? This is the only thing that can get my programming language, to be operation in a reasonable amount of time,