SPAM Talk: Checking Atomicity in Concurrent Java Programs

Speaker: Scott Stoller, State University of New York at Stony Brook

When & Where: 12:30pm, Friday, September 9, 2005, Room 200 AKW


Atomicity is a common correctness requirement for concurrent programs. It requires that concurrent invocations of a set of methods be equivalent to performing the invocations serially in some order. This is like serializability in transaction processing. Analysis of atomicity in concurrent programs is challenging, because synchronization commands may be scattered differently throughout each program, instead of being handled by a fixed strategy, such as 2-phase locking.

We are developing techniques for checking atomicity in concurrent programs, using static analysis, dynamic analysis (run-time monitoring), and novel combinations of them. This talk surveys our research in this area, discusses trade-offs between different techniques, and describes our experience applying them to about 40 KLOC of Java programs.


Scott D. Stoller is an Associate Professor in the Computer Science Department at the State University of New York at Stony Brook. His research encompasses methods and tools for design and analysis of software, with special attention to concurrency, security, and fault-tolerance. His research also focuses on efficiency through incremental computation.

He received his Bachelor's degree in Physics, summa cum laude, from Princeton University (1990) and his Ph.D. degree in Computer Science from Cornell University (1997). He received a National Science Foundation CAREER Award (1999) and an Office of Naval Research Young Investigator Award (2002). He is the author or co-author of over 50 refereed research publications.