Interprocedural Analysis of Concurrent Programs Under a Context Bound
dc.contributor.author | Lal, Akash | en_US |
dc.contributor.author | Touili, Tayssir | en_US |
dc.contributor.author | Kidd, Nicholas | en_US |
dc.contributor.author | Reps, Thomas | en_US |
dc.date.accessioned | 2012-03-15T17:21:51Z | |
dc.date.available | 2012-03-15T17:21:51Z | |
dc.date.created | 2007 | en_US |
dc.date.issued | 2007 | en_US |
dc.identifier.citation | TR1598 | en_US |
dc.identifier.uri | http://digital.library.wisc.edu/1793/60564 | |
dc.description.abstract | Analysis of recursive programs in the presence of concurrency and shared memory is undecidable. A common approach is to remove the recursive nature of the program while dealing with concurrency. A different approach is to bound the number of context switches, which has been shown to be very useful for program analysis. In previous work, Qadeer and Rehof [36] showed that context-bounded analysis is decidable for recursive programs under a finite-state abstraction of program data. In this paper, we generalize their result to infinite-state abstractions, and also provide a new symbolic algorithm for the finite case. | en_US |
dc.format.mimetype | application/pdf | en_US |
dc.publisher | University of Wisconsin-Madison Department of Computer Sciences | en_US |
dc.title | Interprocedural Analysis of Concurrent Programs Under a Context Bound | en_US |
dc.type | Technical Report | en_US |
Files in this item
This item appears in the following Collection(s)
-
CS Technical Reports
Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison