Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
| Autor: | Ahmed Bouajjani, Shaz Qadeer, Mohamed Faouzi Atig |
|---|---|
| Rok vydání: | 2009 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science Theoretical computer science General Computer Science Computer science Reachability problem Selection rule Computation D.2.4 D.3.1 F.4.3 I.2.2 Thread (computing) Theoretical Computer Science Logic in Computer Science (cs.LO) Decidability Bounding overwatch Green threads Bounded function Computer Science::Programming Languages Computer Science::Operating Systems Context switch |
| Zdroj: | Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783642007675 TACAS |
| DOI: | 10.1007/978-3-642-00768-2_11 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|