Download now Free registration required
In this paper, the authors 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. This paper considers the analysis of concurrent programs with shared-memory and interleaving semantics. Such an analysis for recursive programs is, in general, undecidable, even with a finite-state abstraction of data (e.g., Boolean Programs). As a consequence, to deal with concurrency soundly (i.e., Capture all concurrent behaviors), some analyses give up precise handling of procedure call/return semantics.
- Format: PDF
- Size: 220.42 KB