Computer Science – Logic in Computer Science
Scientific paper
2011-11-03
LMCS 7 (4:4) 2011
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-7(4:4)2011
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis explores all behaviors of a concurrent program up to some fixed number of context switches between threads. This definition is inadequate for programs that create threads dynamically because bounding the number of context switches in a computation also bounds the number of threads involved in the computation. In this paper, we propose a more general definition of context-bounded analysis useful for programs with dynamic thread creation. The idea is to bound the number of context switches for each thread instead of bounding the number of switches of all threads. We consider several variants based on this new definition, and we establish decidability and complexity results for the analysis induced by them.
Atig Mohamed Faouzi
Bouajjani Ahmed
Qadeer Shaz
No associations
LandOfFree
Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-100282