About This Item

Ask the MINDS@UW Librarian

Interprocedural Analysis of Concurrent Programs Under a Context Bound

Show full item record

File(s):

Author(s)
Lal, Akash; Touili, Tayssir; Kidd, Nicholas; Reps, Thomas
Publisher
University of Wisconsin-Madison Department of Computer Sciences
Citation
TR1598
Date
2007
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.
Permanent link
http://digital.library.wisc.edu/1793/60564 
Export
Export to RefWorks 
‚Äč

Part of

Show full item record

Search and browse




About MINDS@UW

Deposit materials

  1. Register to deposit in MINDS@UW
  2. Need deposit privileges? Contact us.
  3. Already registered? Have deposit privileges? Deposit materials.