search for: henzinger

Displaying 5 results from an estimated 5 matches for "henzinger".

2012 Apr 03
0
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
...sis/source/browse/#svn%2Ftrunk%2Fsrc%2FRAInstrumentation). Finally, in the lab where I work there are six other people who work everyday with LLVM; thus, in addition to getting help in the forum, I 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] Francesco Logozzo, Manuel Fähndrich: Pentagons: A weakly relational abstract domain for the efficient validation of array accesses. Sci. Comput. Program. 75(9): 796-807...
2012 Apr 03
3
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
...strumentation > ). > Finally, in the lab where I work there are six other people > who work everyday with LLVM; thus, in addition to getting help in the > forum, I 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 > > > _...
2012 Mar 30
4
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
...sis/source/browse/#svn%2Ftrunk%2Fsrc%2FRAInstrumentation ). Finally, in the lab where I work there are six other people who work everyday with LLVM; thus, in addition to getting help in the forum, I 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 --------------...
2012 Mar 30
0
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
...strumentation). > > Finally, in the lab where I work there are six other people > who work everyday with LLVM; thus, in addition to getting help in the > forum, I 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 > > > _...
2012 Apr 05
1
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
...ting help in the > forum, I can easily talk about my project to my colleagues. I would drop the last sentence. Having smart colleagues is great, but it's a weak argument when trying to convince someone to hire you. > > 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] Francesco Logozzo, Manuel Fähndrich: Pentagons: A weakly > relational abstract domain for the efficient validation of array > accesses. Sci. Com...