search for: bodik's

...isabled. Improving the old code or writing a new pass would be extremely beneficial." I plan to build a new array bounds checking algorithm from scratch. How it will be done ------------------- I will build an array bounds checking algorithm based on the ABCD algorithm that was described by Bodik in the paper [3]. The key insight in the ABCD was to use a lattice that some researchers, e.g., [2], call the "less-than" lattice. Instead of determining precise ranges for the variables using for instance, the interval lattice, Bodik's less-than lattice finds, for each variable v, th...

...anks a lot for your reply! 2009/2/27 Evan Cheng <evan.cheng at apple.com>: > > On Feb 27, 2009, at 7:20 AM, Roman Levenstein wrote: > >> Hi, >> >> I'm working on the implementation of Extended Linear Scan register >> allocator as described by Sarkar & Bodik. >> One of the interesting features of their algorithm is the possibility >> to allocate different physical registers  to different live-ranges of >> the same LiveInterval. Of course, it may require some glue code to be >> inserted in cases, where different physical regs wer...

Hi, I'm working on the implementation of Extended Linear Scan register allocator as described by Sarkar & Bodik. One of the interesting features of their algorithm is the possibility to allocate different physical registers to different live-ranges of the same LiveInterval. Of course, it may require some glue code to be inserted in cases, where different physical regs were assigned to live-ranges (of the sa...

On Feb 27, 2009, at 7:20 AM, Roman Levenstein wrote: > Hi, > > I'm working on the implementation of Extended Linear Scan register > allocator as described by Sarkar & Bodik. > One of the interesting features of their algorithm is the possibility > to allocate different physical registers to different live-ranges of > the same LiveInterval. Of course, it may require some glue code to be > inserted in cases, where different physical regs were assigned to &g...

...leagues. > > References > ---------- > > [1] Dirk Beyer, Thomas A. Henzinger, Ranjit Jhala and Rupak Majumdar. > Checking Memory Safety with Blast. FASE 2005, LNCS 3442, pages 2-18, > Springer-Verlag, 2005 > > [2] ABCD: eliminating array bounds checks on demand. Rastislav Bodik > and Rajiv Gupta and Vivek Sarkar. PLDI 2000, ACM, pages 321-333 > > > _______________________________________________ > LLVM Developers mailing listLLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.eduhttp://lists.cs.uiuc.edu/mailman/listinfo/llvmdev > > > > __________...

...As far as organization goes, think you should provide the background section first and then describe how you will solve the problem. > How it will be done > ------------------- > > I will build an array bounds checking algorithm based on the ABCD > algorithm that was described by Bodik in the paper [3]. The key > insight in the ABCD was to use a lattice that some researchers, e.g., > [2], call the "less-than" lattice. Instead of determining precise > ranges for the variables using for instance, the interval lattice, > Bodik's less-than lattice finds, for...

...ork using the predication/value inference algorithms in the paper newgvn is based on, but it's not even implemented there. Short answer, without special casing this in magic ways, i wouldn't expect this to get fixed anytime soon. If we fixed assume in one of the ways i thought about, like bodik's extended ssa: http://homepages.dcc.ufmg.br/~fernando/classes/dcc888/ementa/slides/RangeAnalysis.pdf You would at least see that the load result is used by an assume, and could go look at that assume and so something with it. Currently, it's a few steps away. In the current scheme, assu...

...in the paper newgvn is based on, but it's not even implemented >> there. >> >> Short answer, without special casing this in magic ways, i wouldn't >> expect this to get fixed anytime soon. >> >> If we fixed assume in one of the ways i thought about, like bodik's >> extended ssa: >> >> http://homepages.dcc.ufmg.br/~fernando/classes/dcc888/ementa/slides/RangeAnalysis.pdf >> >> You would at least see that the load result is used by an assume, and >> could go look at that assume and so something with it. Currently, it...

...AGRAWAL. Dynamic Program Slicing. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI),1990. 2] L.O. Andersen. Program analysis and specialization for the C programming language. PhD thesis, University of Cophenhagen, Germany, 1994. [3] M. Sridharan, S.J. Fink, and R. Bodik. Thin slicing. In PLDI'07, 2007. [4] F. Tip. A survey of program slicing techniques.Journal of Programming Languages, 1995. [5] M. Weiser. Program slicing. In Proceedings of the 5th International Conference on Software Engineering, ICSE, pages 439{449. IEEE, 1981. -- Mingliang LIU ( in Chinese...

...AGRAWAL. Dynamic Program Slicing. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI),1990. 2] L.O. Andersen. Program analysis and specialization for the C programming language. PhD thesis, University of Cophenhagen, Germany, 1994. [3] M. Sridharan, S.J. Fink, and R. Bodik. Thin slicing. In PLDI'07, 2007. [4] F. Tip. A survey of program slicing techniques.Journal of Programming Languages, 1995. [5] M. Weiser. Program slicing. In Proceedings of the 5th International Conference on Software Engineering, ICSE, pages 439{449. IEEE, 1981. -- Mingliang LIU (刘明亮 in Chin...

As of llvm 3.8, the early CSE pass seems to remove llvm.assume intrinsics. Is this the expected behavior? I've attached as small-ish example of this happening in my production code. $ opt -early-cse before-early-cse.ll -S > after-early-cse.ll Note the use of the assume intrinsic indicating that the loaded value %channels equals 3. In a later pass I replace the load instruction with

...ming Languages and Systems (TOPLAS), 181-210, 1991. 6. Efficient SSI Conversion. André Luiz C. Tavares, Fernando Magno Quintão Pereira, Mariza A. S. Bigonha and Roberto S. Bigonha. Simpósio Brasileiro de Linguagens de Programação. 2010. 7. ABCD: eliminating array bounds checks on demand, Rajkslav Bodik, Rajiv Gupta and Vivek Sarkar, In Proceedings of the SIGPLAN conference on Programming Language Design and Implementation, 2000. Contact Info Name: Douglas do Couto Teixeira e-mail 1: douglas at dcc dot ufmg dot br e-mail 2: douglasdocouto at gmail dot com -- Douglas do Couto Teixeira --------...

...can easily talk about my project to my colleagues. References ---------- [1] Dirk Beyer, Thomas A. Henzinger, Ranjit Jhala and Rupak Majumdar. Checking Memory Safety with Blast. FASE 2005, LNCS 3442, pages 2-18, Springer-Verlag, 2005 [2] ABCD: eliminating array bounds checks on demand. Rastislav Bodik and Rajiv Gupta and Vivek Sarkar. PLDI 2000, ACM, pages 321-333 -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20120330/f1bc10b9/attachment.html>

...leagues. > > References > ---------- > > [1] Dirk Beyer, Thomas A. Henzinger, Ranjit Jhala and Rupak Majumdar. > Checking Memory Safety with Blast. FASE 2005, LNCS 3442, pages 2-18, > Springer-Verlag, 2005 > > [2] ABCD: eliminating array bounds checks on demand. Rastislav Bodik > and Rajiv Gupta and Vivek Sarkar. PLDI 2000, ACM, pages 321-333 > > > _______________________________________________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev -------------- ne...

...OPLAS), 181-210, 1991. > > 6. Efficient SSI Conversion.André Luiz C. Tavares, Fernando Magno > Quintão Pereira, Mariza A. S. Bigonha and Roberto S. Bigonha. Simpósio > Brasileiro de Linguagens de Programação. 2010. > > 7. ABCD: eliminating array bounds checks on demand, Rajkslav Bodik, > Rajiv Gupta and Vivek Sarkar, In Proceedings of the SIGPLAN conference > on Programming Language Design and Implementation, 2000. > > Contact Info > > Name:Douglas do Couto Teixeira > e-mail 1:douglas at dcc dot ufmg dot br > e-mail 2: douglasdocouto at gmail dot com &g...

On Wed, Mar 23, 2011 at 6:24 PM, John Criswell <criswell at illinois.edu> wrote: > > > On 3/23/11 8:06 AM, Douglas do Couto Teixeira wrote: > > > > the execution of a program. Thus, for each integer variable, a range > > analysis determines its lower and upper limits. A very simple range analysis > > > would, for instance, map each variable to the limits

...gram Slicing. In ACM SIGPLAN Conference on > Programming Language Design and Implementation (PLDI),1990. > 2] L.O. Andersen. Program analysis and specialization for the C > programming language. PhD thesis, University of Cophenhagen, Germany, 1994. > [3] M. Sridharan, S.J. Fink, and R. Bodik. Thin slicing. In PLDI'07, 2007. > [4] F. Tip. A survey of program slicing techniques.Journal of Programming > Languages, 1995. > [5] M. Weiser. Program slicing. In Proceedings of the 5th International > Conference on Software Engineering, ICSE, pages 439{449. IEEE, 1981. > >...

Hi, I need to do some screen scraping and I''ve spent a couple hour getting htmltools and rexml do the right thing. Here''s the code: parser = HTMLTree::Parser.new(false, false) parser.feed(res.body) tree = parser.tree.html_node.as_rexml_document I works for one page, but for another I get "undefined method `add'' for #<HTMLTree::Element:0x37f9cc8>" in