Abstract

We provide a parametric framework for verifying safety properties of concurrent Java programs. The framework combines thread-scheduling information with information about the shape of the heap. This leads to error-detection algorithms that are more precise than existing techniques. The framework also provides the most precise shape-analysis algorithm for concurrent programs. In contrast to existing verification techniques, we do not put a bound on the number of allocated objects. The framework even produces interesting results when analyzing Java programs with an unbounded number of threads. The framework is applied to successfully verify the following properties of a concurrent program:

Citations

2026	Model Checking - Clarke, Grumberg, et al. - 2000
792	Symbolic boolean manipulation with ordered binary decision diagrams - Bryant - 1992
725	Mobile ambients - Gordon, Cardelli - 1998
575	Model Checking and Abstraction - Clarke, Grumberg, et al. - 1994
360	Analysis of pointers and structures - Chase, Wegman, et al. - 1990
62	Static analyses for eliminating unnecessary synchronization from Java programs - Aldrich, Chambers, et al. - 1999
21	Verifying parameterized networks - Clarke, Grumberg, et al. - 1997