Displaying 5 results from an estimated 5 matches for "fahndrich".
2012 Apr 02
0
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
...into account?
No. The less-than lattice only reports if a variable is less than
another, assuming that your lattice is {-inf, ... -2, -1, 0, 1, 2, ...
+inf}. But I know of another lattice that takes overflows into
consideration. It is called the Pentagon domain, and it was published
by Logozzo and Fahndrich in the paper [1]:
[1] 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 (2010)
Pentagons combine the less-than lattice with the interval lattice to
have an analysis that is sound...
2012 Apr 03
0
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
...rs
across function calls in order to have a precise analysis, as
described in the paper [1].
I do not plan to couple my analysis with the interval domain, but,
if the LLVM community judge that it should be done, than I can
implement my algorithm after the pentagon domain, proposed by Logozzo
and Fahndrich in 2010 [2]. The pentagon domain is a different approach
to get an analysis that is overflow resilient. It combines the
interval domain {-inf, ..., -1, 0, 1, ... +inf} with the "less-than"
domain. If some variable is bound to an interval like [l, u], where l
-inf and u < +inf, then we...
2012 Apr 03
3
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
On Fri, Mar 30, 2012 at 11:49 AM, John Criswell <criswell at illinois.edu>wrote:
> On 3/30/12 1:08 PM, Raphael Ernani Rodrigues wrote:
>
> Dear LLVMers,
>
> My name is Raphael Ernani, and I am doing my MsC at the Federal
> University of Minas Gerais, Brazil. I have been using LLVM for a
> while, and I would like to participate in this year's Summer of Code.
>
2012 Apr 05
1
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
...n order to have a precise analysis, as
> described in the paper [1].
> I do not plan to couple my analysis with the interval domain, but,
> if the LLVM community judge that it should be done, than I can
> implement my algorithm after the pentagon domain, proposed by Logozzo
> and Fahndrich in 2010 [2]. The pentagon domain is a different approach
> to get an analysis that is overflow resilient. It combines the
> interval domain {-inf, ..., -1, 0, 1, ... +inf} with the "less-than"
> domain. If some variable is bound to an interval like [l, u], where l
> -inf and u...
2012 Mar 30
4
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
Dear LLVMers,
My name is Raphael Ernani, and I am doing my MsC at the Federal
University of Minas Gerais, Brazil. I have been using LLVM for a
while, and I would like to participate in this year's Summer of Code.
One particular idea, in your "open projects" page caught my eye, and I
decided to write a proposal about it. The line that I liked in the
page was "Create an LLVM