A Generic Approach to the Static Analysis  of Concurrent Programs with Procedures

Bouajjani, Ahmed; Esparza, Javier; Touili, Tayssir

doi:10.1142/s0129054103001893

Cited by 75 publications

(126 citation statements)

References 0 publications

Supporting

Mentioning

126

Contrasting

Order By: Relevance

“…In the remainder of the paper, we restrict ourselves to systems that consist of two components. The technique can be extended in a straightforward manner to the general case (see [7] for more details); the implementation discussed in §6 supports an arbitrary number of components.…”

Section: Reachability Analysis Of Cpdssmentioning

confidence: 99%

“…To compute over-approximations of PDS path languages, our technique is based on the approach presented by Bouajjani et al [7], which is summarized below.…”

Section: Computing Over-approximations Of Path Languagesmentioning

confidence: 99%

“…Two different algorithms provide the basis of this theorem, one due to Bouajjani et al [6,7], the other to Reps et al [20,21]. The latter has been implemented in a tool called WPDS++ [22].…”

Section: Theorem 1 [7 20] Let P = (Q Act γ ∆) Be a Pds; Let CC mentioning

confidence: 99%

“…Bouajjani et al also reduced the reachability problem for CPDSs to computing overapproximations of CFLs; however, no CEGAR techniques were presented there [6,7]. More precisely, their work computes over-approximations A 1 and A 2 of two given CFLs L 1 and L 2 , and if A 1 ∩ A 2 = / 0, one concludes that L 1 ∩ L 2 = / 0.…”

Section: Related Workmentioning

confidence: 99%

“…They are able to represent the potentially infinite configurations of recursive programs in a symbolic manner using regular languages [4,5]. Recently, compositions of pushown systems, called communicating pushown systems, have been used to model concurrent recursive programs [6,7]. However, in these cases, all data were assumed to have a small finite domain.…”

Section: Introductionmentioning

confidence: 99%

See 4 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: Reachability Analysis Of Cpdssmentioning

confidence: 99%

“…To compute over-approximations of PDS path languages, our technique is based on the approach presented by Bouajjani et al [7], which is summarized below.…”

Section: Computing Over-approximations Of Path Languagesmentioning

confidence: 99%

Section: Theorem 1 [7 20] Let P = (Q Act γ ∆) Be a Pds; Let CC mentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 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

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

Reachability Analysis of Multithreaded Software with Asynchronous Communication

Bouajjani

Esparza

Schwoon

et al. 2005

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CPS (concurrent pushdown systems) [7] and DPN (dynamic pushdown networks) [5]. We show that ADPN exhibit several advantages as a program model. Since the reachability problem for ADPN is undecidable even in the case without dynamic creation of processes, we address the bounded reachability problem [7], which considers only those computation sequences where the (index of the) thread accessing the shared memory is changed at most a fixed given number of times. We provide efficient algorithms for both forward and backward reachability analysis. The algorithms are based on automata techniques for symbolic representation of sets of configurations.

show abstract

A Generic Approach to the Static Analysis of Concurrent Programs with Procedures

Cited by 75 publications

References 0 publications

Verifying Concurrent Message-Passing C Programs with Recursive Calls

Verifying Concurrent Message-Passing C Programs with Recursive Calls

Reasoning About Threads Communicating via Locks

Reachability Analysis of Multithreaded Software with Asynchronous Communication

Contact Info

Product

Resources

About