Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems

Bouajjani, Ahmed; Müller-Olm, Markus; Touili, Tayssir

doi:10.1007/11539452_36

Cited by 93 publications

(146 citation statements)

References 9 publications

Supporting

Mentioning

146

Contrasting

Order By: Relevance

“…the number of threads, and the reachability problem is PSPACE-hard. Moreover, if threads are modeled as pushdown systems, which corresponds to allowing unbounded depth (recursive) In [BMOT05], a model based on networks of pushdown systems called CDPN was proposed. While this model allows dynamic creation of processes, it allows only a restricted form of synchronization where a process has the right to read only the control states of its immediate children (i.e., the processes it has created).…”

Section: Introductionmentioning

confidence: 99%

Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads

Atig

Bouajjani

Qadeer

2009

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Abstract. Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, contextbounded 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.

show abstract

Section: Introductionmentioning

confidence: 99%

Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads

Atig

Bouajjani

Qadeer

2009

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…These consider the problem by computing overapproximations of the execution paths of the program, whereas here we compute underapproximations of the reachable configurations. Analysis under restricted communication policies (in contrast to shared memory) has also been considered [6,14]. The basic technique of Qadeer and Rehof has been generalized to handle more abstractions in [5,3], however, these also require enumeration of states at a context switch, and cannot handle infinite-state abstractions like affine-relation analysis.…”

Section: Related Workmentioning

confidence: 99%

Interprocedural Analysis of Concurrent Programs Under a Context Bound

Lal

Touili

Kidd

et al.

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Abstract. Analysis of recursive programs in the presence of concurrency and shared memory is undecidable. In previous work, Qadeer and Rehof [23] showed that context-bounded analysis is decidable for recursive programs under a finite-state abstraction of program data. In this paper, we show that context-bounded analysis is decidable for certain families of infinite-state abstractions, and also provide a new symbolic algorithm for the finite-state case.

show abstract

“…Since the number of parallel processes can be arbitrarily large, we need unbounded width trees to accurately represent such configurations. Then, actions of the program such as procedure calls, launching of new threads, synchronisation statements, etc, can also be represented by relations on unranked trees [15,16]. -Many parametrized protocols are defined on tree topologies with unbounded width.…”

Section: Introductionmentioning

confidence: 99%

“…More recently, hedge automata have been used to compute reachability sets of some classes of transformations, namely Process Rewrite Systems (PRS) [15] and Dynamic Pushdown Networks (DPN) [16]. Compared to our work, these algorithms compute the sets of the reachable states of the systems, whereas we consider the more general problem of computing the transitive closure of the system's transducer.…”

Section: Introductionmentioning

confidence: 99%

“…Compared to our work, these algorithms compute the sets of the reachable states of the systems, whereas we consider the more general problem of computing the transitive closure of the system's transducer. Moreover, our technique is general and can be uniformly applied to all the classes of relabeling transformations, whereas the algorithms of [15,16] can only be applied to the specific class of PRS or DPN.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Regular Hedge Model Checking

d'Orso

Touili

Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006

Self Cite

View full text Add to dashboard Cite

Abstract. We extend the regular model checking framework so that it can handle systems with arbitrary width tree-like structures. Configurations of a system are represented by trees of arbitrary arities, sets of configurations are represented by regular hedge automata, and the dynamics of a system is modeled by a regular hedge transducer. We consider the problem of computing the transitive closure T + of a regular hedge transducer T . This construction is not possible in general. Therefore, we present a general acceleration technique for computing T + . Our method consists of enhancing the termination of the iterative computation of the different compositions T i by merging the states of the hedge transducers according to an appropriate equivalence relation that preserves the traces of the transducers. We provide a methodology for effectively deriving equivalence relations that are appropriate. We have successfully applied our technique to compute transitive closures for some mutual exclusion protocols defined on arbitrary width tree topologies, as well as for an XML application.

show abstract

Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems

Cited by 93 publications

References 9 publications

Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads

Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads

Interprocedural Analysis of Concurrent Programs Under a Context Bound

Regular Hedge Model Checking

Contact Info

Product

Resources

About