Context-Bounded Model Checking of Concurrent Software

Qadeer, Shaz; Rehof, Jakob

doi:10.1007/978-3-540-31980-1_7

Cited by 320 publications

(371 citation statements)

References 29 publications

Supporting

Mentioning

370

Contrasting

Unclassified

Order By: Relevance

“…BT 1 was the version for which KISS had previously found a bug [24], and our tool identified the same bug. In contrast to KISS (as well as the work reported in [25]), our approach can also verify correctness by determining that all error configurations are unreachable. The authors of [24] sent us BT 2 to see if correctness could be verified.…”

Section: Application To Concurrent Recursive Programsmentioning

confidence: 99%

“…Finally, the techniques presented in [28,25] also use multiple PDSs to model concurrent recursive programs. However, [28] is restricted to programs that communicate via a finite number of locks, and assumes a certain nesting condition on the locks.…”

Section: Related Workmentioning

confidence: 99%

“…However, [28] is restricted to programs that communicate via a finite number of locks, and assumes a certain nesting condition on the locks. As for [25], it uses shared-variables for communication between threads, whereas we use synchronizing actions (these two models can simulate each other). The technique presented in [25] sidesteps the undecidability of the reachability problem for multiple PDSs by putting a bound k on the number of interleavings between different threads, whereas we sidestep undecidability by computing abstractions of CFLs (without bounding the number of interleavings).…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Verifying Concurrent Message-Passing C Programs with Recursive Calls

Chaki

Clarke

Kidd

et al. 2006

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. We consider the model-checking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We model such programs using communicating pushdown systems, and reduce the reachability problem for this model to deciding the emptiness of the intersection of two context-free languages L 1 and L 2 . We tackle this undecidable problem using a CounterExample Guided Abstraction Refinement (CEGAR) scheme. We implemented our technique in the model checker MAGIC and found a previously unknown bug in a version of a Windows NT Bluetooth driver.

show abstract

Section: Application To Concurrent Recursive Programsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Verifying Concurrent Message-Passing C Programs with Recursive Calls

Chaki

Clarke

Kidd

et al. 2006

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

show abstract

“…Context-bounding has been proposed in [QR05] as a suitable technique for the analysis of multi-stack automata. The idea is to consider only runs of the automaton that can be divided into a given number of contexts, where in each context pop and push transitions are exclusive to one stack.…”

Section: Introductionmentioning

confidence: 99%

“…Therefore, our first task is to find a finite symbolic representation of the possibly infinite state-space of an ordered multi-pushdown automaton. For that, we consider the class of recognizable sets of configurations defined using finite state automata [QR05,ABT08,Set10].…”

Section: Introductionmentioning

confidence: 99%

Model-Checking of Ordered Multi-Pushdown Automata

Atig¹

2012

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. We address the verification problem of ordered multi-pushdown automata: A multi-stack extension of pushdown automata that comes with a constraint on stack transitions such that a pop can only be performed on the first non-empty stack. First, we show that the emptiness problem for ordered multi-pushdown automata is in 2ETIME. Then, we prove that, for an ordered multi-pushdown automata, the set of all predecessors of a regular set of configurations is an effectively constructible regular set. We exploit this result to solve the global model-checking which consists in computing the set of all configurations of an ordered multi-pushdown automaton that satisfy a given w-regular property (expressible in linear-time temporal logics or the linear-time µ-calculus). As an immediate consequence, we obtain an 2ETIME upper bound for the model-checking problem of w-regular properties for ordered multi-pushdown automata (matching its lowerbound).

show abstract

Reasoning About Threads Communicating via Locks

Kahlon

Ivančić

Gupta

2005

Computer Aided Verification

100

View full text Add to dashboard Cite

Abstract. We propose a new technique for the static analysis of concurrent programs comprised of multiple threads. In general, the problem is known to be undecidable even for programs with only two threads but where the threads communicate using CCS-style pairwise rendezvous [10]. However, in practice, a large fraction of concurrent programs can either be directly modeled as threads communicating solely using locks or can be reduced to such systems either by applying standard abstract interpretation techniques or by exploiting separation of control from data. For such a framework, we show that for the commonly occurring case of threads with nested access to locks, the problem is efficiently decidable. Our technique involves reducing the analysis of a concurrent program with multiple threads to individually analyzing augmented versions of the given threads. Thus not only yields decidability but also avoids construction of the state space of the concurrent program at hand and thus bypasses the state explosion problem making our technique scalable. We go on to show that for programs with threads that have non-nested access to locks, the static analysis problem for programs with even two threads becomes undecidable even for reachability, thus sharpening the result of [10]. As a case study, we consider the Daisy file system [1] which is a benchmark for analyzing the efficacy of different methodologies for debugging concurrent programs and show the existence of several bugs.

show abstract

Context-Bounded Model Checking of Concurrent Software

Cited by 320 publications

References 29 publications

Verifying Concurrent Message-Passing C Programs with Recursive Calls

Verifying Concurrent Message-Passing C Programs with Recursive Calls

Model-Checking of Ordered Multi-Pushdown Automata

Reasoning About Threads Communicating via Locks

Contact Info

Product

Resources

About