Interprocedural Analysis of Concurrent Programs Under a Context Bound

Simple item page
dc.contributor.authorLal, Akashen_US
dc.contributor.authorTouili, Tayssiren_US
dc.contributor.authorKidd, Nicholasen_US
dc.contributor.authorReps, Thomasen_US
dc.date.accessioned2012-03-15T17:21:51Z
dc.date.available2012-03-15T17:21:51Z
dc.date.created2007en_US
dc.date.issued2007en_US
dc.description.abstractAnalysis 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.mimetypeapplication/pdfen_US
dc.identifier.citationTR1598en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/60564
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleInterprocedural Analysis of Concurrent Programs Under a Context Bounden_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR1598.pdf
Size:
369.77 KB
Format:
Adobe Portable Document Format
Download

Collections

CS Technical Reports