Interprocedural Analysis of Concurrent Programs Under a Context Bound
Lists
Only you see this
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.
BibTeX
@inproceedings{lal2008interprocedural,
author = {Akash Lal and Tayssir Touili and Nicholas Kidd and Thomas W. Reps},
title = {{Interprocedural Analysis of Concurrent Programs Under a Context Bound}},
booktitle = {TACAS},
year = {2008},
doi = {10.1007/978-3-540-78800-3\_20},
}Loading related content...