Subject: BU Colloquium this Monday: Radu Rugina
From: Torben Amtoft (tamtoft@cs.bu.edu)
Date: Fri Mar 30 2001 - 16:29:25 EST
B O S T O N U N I V E R S I T Y
Computer Science Department
C O L L O Q U I U M
Program Analysis Techniques for Pointers and Accessed Memory Regions
Radu Rugina
Department of Computer Science
University of California at Santa Barbara
Monday, April 2
11:00 am
(Coffee served at 10:45PM)
Seminar Room / MCS 135
Virtually all program transformations and safety checks require
information about the memory locations accessed by the statements and
procedures in the program. But many constructs in modern programming
languages (for example, pointers, object references, recursion, and
multiple threads) make it difficult to obtain this kind of
information.
This talk presents two new static analysis techniques, a pointer
analysis and a symbolic bounds analysis, that precisely characterize
how the program accesses memory. Pointer analysis computes where
pointer variables may point during the execution of the program. The
symbolic bounds analysis characterizes how the program accesses
regions within dynamically allocated blocks of memory. Both techniques
can successfully analyze recursive and multithreaded programs that heavily
use pointers.
Experimental results from our implemented program analysis system show
that these techniques enable a wide range of further analyses,
transformations, and safety checks, including race detection,
detection of bounds violations for dynamically allocated regions of
memory, elimination of array bounds checks, and automatic
parallelization.
Host: John Byers
-------------------------------------------------------------------------------
For colloquium info, including directions, see http://cs-www.bu.edu/colloquium
This archive was generated by hypermail 2b28 : Sun Apr 01 2001 - 09:42:38 EDT