Making software reliable is one of the most important challenges facing
computer science today. This talk presents a new type system that
addresses this problem by statically preventing several important classes
of programming errors. If a program type checks, our system guarantees at
compile time that the program does not contain any of those errors.
Specifically, our type system prevents data races and deadlocks in
multithreaded programs, prevents representation exposure in abstract data
types, enables safe lazy software upgrades in programs that use persistent
objects, and prevents memory errors in programs that use region-based
memory management. We have implemented several Java programs in our
system. We found that our type system is sufficiently expressive to
support common programming patterns, and requires little programming
overhead. Our type system thus offers a promising approach for improving
software reliablity.
Dr. Boyapati is a faculty candidate.
Monday, April 14, 2003 at 3:00 p.m. in Duncan Hall 1070
Reception preceding the talk - 2:30 in Duncan Hall 1049
Biographical Sketch
Chandra Boyapati is a Ph.D. candidate at the Massachusetts Institute of
Technology working with Prof. Martin Rinard. Chandra received his master's
degree from MIT in September 1998, and his bachelor's degree from Indian
Institute of Technology Madras in July 1996.