Module: ppl/ppl Branch: master Commit: debbd4bf3e4b44a951b547a647d9d52cbe0c19e4 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=debbd4bf3e4b4...
Author: Roberto Bagnara roberto.bagnara@bugseng.com Date: Sun Dec 29 17:26:25 2013 +0100
Several corrections to the abstract of Fu13th.
---
doc/ppl_citations.bib | 12 ++++++------ 1 files changed, 6 insertions(+), 6 deletions(-)
diff --git a/doc/ppl_citations.bib b/doc/ppl_citations.bib index deaa40f..5797b6f 100644 --- a/doc/ppl_citations.bib +++ b/doc/ppl_citations.bib @@ -2245,7 +2245,7 @@ Summarizing: Year = 2013, Abstract = "The fast and furious pace of change in computing technology has become an article of faith for many. The - reliability of computer-based systems cru- cially + reliability of computer-based systems crucially depends on the correctness of its computing. Can man, who created the computer, be capable of preventing machine-made misfortune? The theory of static analysis @@ -2253,24 +2253,24 @@ Summarizing: numerical properties of programs has been an essential research topic for static analysis. These kinds of properties are commonly modeled and handled by the - concept of numerical abstract domains. Unfor- tunately, + concept of numerical abstract domains. Unfortunately, lifting these domains to heap-manipulating programs is not obvious. On the other hand, points-to analyses have - been intensively studied to an- alyze pointer behaviors + been intensively studied to analyze pointer behaviors and some scale to very large programs but without inferring any numerical properties. We propose a framework based on the theory of abstract interpretation that is able to combine existing numerical domains and points-to analyses in a modular way. The static - numerical anal- ysis is prototyped using the SOOT + numerical analysis is prototyped using the SOOT framework for pointer analyses and the PPL library for numerical domains. The implementation is able to analyze large Java program within several minutes. The second part of this thesis consists of a theoretical study of - the com- bination of the points-to analysis with another + the combination of the points-to analysis with another pointer analysis providing information called must-alias. Two pointer variables must alias at some - pro- gram control point if they hold equal reference + program control point if they hold equal reference whenever the control point is reached. We have developed an algorithm of quadruple complexity that sharpens points-to analysis using must-alias information. The