Interprocedural analysis of concurrent programs under a context bound (2007)
by
Akash Lal
,
Tayssir Touili
,
Nicholas Kidd
,
Thomas Reps
| Venue: | In TACAS |
| Citations: | 21 - 5 self |
BibTeX
@TECHREPORT{Lal07interproceduralanalysis,
author = {Akash Lal and Tayssir Touili and Nicholas Kidd and Thomas Reps},
title = {Interprocedural analysis of concurrent programs under a context bound},
institution = {In TACAS},
year = {2007}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Analysis of recursive programs in the presence of concurrency and shared memory is undecidable. In previous work, Qadeer and Rehof [23] showed that context-bounded analysis is decidable for recursive programs under a finite-state abstraction of program data. In this paper, we show that context-bounded analysis is decidable for certain families of infinite-state abstractions, and also provide a new symbolic algorithm for the finite-state case. 1
