[e-lang] [Fwd: [groovy-dev] [Fwd: SEMINAR: Thursday 8-24-06 THESIS DEFENSE: Pointer Analysis for Java Programs]]

[Mark Miller]

Seems potentially relevant for enhancing the kind of reasoning that Fred et. 
al. are trying to do with SCOLL, or that Adrian and David are seeking to apply 
to Joe-E.

-------- Original Message --------
Subject: [groovy-dev] [Fwd: SEMINAR: Thursday 8-24-06 THESIS DEFENSE: Pointer 
Analysis for Java Programs]
Date: Fri, 18 Aug 2006 12:34:03 -0400
From: Martin C. Martin <martin at martincmartin.com>
Reply-To: dev at groovy.codehaus.org
To: Groovy Developers <dev at groovy.codehaus.org>

Subject:
TALK:Thursday 8-24-06 THESIS DEFENSE: Pointer Analysis for Java Programs
From:
CSAIL Event Calendar <eventcalendar at csail.mit.edu>
Date:
Fri, 18 Aug 2006 08:52:40 -0400
To:
seminars at csail.mit.edu

THESIS DEFENSE: Pointer Analysis for Java Programs: Novel Techniques and
Applications
Speaker: Alexandru Salcianu
Speaker Affiliation: CSAIL
Host: Professor Martin Rinard
Host Affiliation: CSAIL

Date: 8-24-2006
Time: 3:00 PM - 4:00 PM
Refreshments: 2:45 PM
Location: 32-D463 Star

Abstract:

This thesis presents a pointer analysis for Java programs, together
with several practical analysis applications.

For each program point, the analysis is able to construct a points-to
graph that describes how local variables and object fields point to
objects.  Each points-to graph also contains escape information that
identifies the objects that are reachable from outside the analysis
scope.

Our pointer analysis can extract correct information by analyzing only
parts of a whole program.  First, our analysis analyzes a method
without requiring information about its calling context.  Instead, our
analysis computes parameterized results that are later instantiated
for each relevant call site.  Second, our analysis correctly handles
calls to unanalyzable methods (e.g., native methods).  Hence, our
analysis can trade precision for speed without sacrificing
correctness: if the analysis of a call to a specific callee requires
too much time, the analysis can treat that callee as unanalyzable.

The results of our analysis enable standard program optimizations like
the stack allocation of local objects.  More interestingly, this
thesis explains how to extend the analysis to detect pure methods.
Our analysis supports a flexible definition of method purity: a method
is pure if it does not mutate any object that exists in the program
state before the start of the method.  Therefore, our analysis allows
pure methods to allocate and mutate temporary objects (e.g.,
iterators) and/or construct complex object structures and return them
as a result.

Thesis committee:
Prof. Arvind
Prof. Michael Ernst
Pref. Martin Rinard (thesis advisor)

Relevant URL(S):
For more information please contact: Mary McDavitt, 617-253-9620,
mmcdavit at csail.mit.edu

_______________________________________________
Seminars mailing list
Seminars at lists.csail.mit.edu
https://lists.csail.mit.edu/mailman/listinfo/seminars





---------------------------------------------------------------------
To unsubscribe from this list please visit:

    http://xircles.codehaus.org/manage_email



-- 
Text by me above is hereby placed in the public domain

     Cheers,
     --MarkM