Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
TL;DR: This paper proposes a more general definition of context-bounded analysis useful for programs with dynamic thread creation, and considers several variants based on this new definition that establish decidability and complexity results for the analysis induced by them.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Analysis of recursively parallel programs
Ahmed Bouajjani,Michael Emmi +1 more
- 25 Jan 2012
TL;DR: A general formal model of isolated hierarchical parallel computations is proposed, and several fragments are identified to match the concurrency constructs present in real-world programming languages such as Cilk and X10.
93
Getting rid of store-buffers in TSO analysis
Mohamed Faouzi Atig,Ahmed Bouajjani,Gennaro Parlato +2 more
- 14 Jul 2011
TL;DR: It is shown that it is possible to use only O(k) additional copies of the shared variables of P as local variables to simulate the store buffers, even if they are unbounded, and that bugs due to TSO can be detected with small bounds, using off-the-shelf SC analysis tools.
•Posted Content
A Theory of Formal Synthesis via Inductive Learning
Susmit Jha,Sanjit A. Seshia +1 more
TL;DR: In this article, the authors present a theoretical framework for formal inductive synthesis, which is the process of generating a program satisfying a high-level formal specification, which differs from traditional machine learning.
63
On sequentializing concurrent programs
Ahmed Bouajjani,Michael Emmi,Gennaro Parlato +2 more
- 14 Sep 2011
TL;DR: A general framework for compositional under-approximate concurrent program analyses by reduction to sequential program analyses is proposed, and a most general instance which considers more executions is identified, by composing the rounds of different tasks in any order.
Complexity of pattern-based verification for multithreaded programs
Javier Esparza,Pierre Ganty +1 more
- 26 Jan 2011
TL;DR: It is shown that no algorithm for pattern-based verification can be polynomial in the number of threads, procedures per thread, or the size of the pattern (unless P=NP), and a multiparameter analysis is conducted, using recent results about Parikh images of regular languages and semilinear sets.
40
References
•Book
Introduction to Automata Theory, Languages, and Computation
John E. Hopcroft,Rajeev Motwani,Rotwani,Jeffrey D. Ullman +3 more
- 01 Jan 1979
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
14.5K
The covering and boundedness problems for vector addition systems
TL;DR: These procedures nearly achieve recently established lower bounds on the amount of space inherently required to solve the covering and boundedness problems for vector addition systems, and so are much more efficient than previously known non-primitive-recursive decision procedures.
482
Context-Bounded model checking of concurrent software
Shaz Qadeer,Jakob Rehof +1 more
- 04 Apr 2005
TL;DR: In this paper, the authors show that the problem of verifying a concurrent boolean program is decidable, even in the presence of unbounded parallelism, if the analysis is restricted to executions in which the number of context switches is bounded by an arbitrary constant.
•Journal Article
On the complexity of equational horn clauses
TL;DR: It is shown that modulo the theory ACU of an associative-commutative symbol with unit, as well as its variants like the theory XOR and the theory AG of Abelian groups, unsatisfiability is NP-complete.
131
On the complexity of equational horn clauses
Kumar Neeraj Verma,Helmut Seidl,Thomas Schwentick +2 more
- 22 Jul 2005
TL;DR: In this paper, it was shown that unsatisfiability is NP-complete for the theory ACU of an associative-commutative symbol with unit, as well as its variants like the theory XOR and the theory AG of Abelian groups.
Related Papers (5)
Ahmed Bouajjani,Michael Emmi,Gennaro Parlato +2 more
- 14 Sep 2011
Jan A. Bergstra,Cornelis A. Middelburg +1 more
- 01 Jan 2005