Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS

Geeraerts, Gilles; Raskin, Jean-François; Begin, Laurent Van

doi:10.1007/978-3-540-30538-5_24

Cited by 40 publications

(82 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In case the counterexample is spurious, we increase the parameter k and continue. This abstraction-refinement process is guaranteed to terminate, by either finding a genuine path that covers a given marking, or by proving that the target marking is not coverable for some parameter k in the abstraction [10]. We have found that k = 1 is usually sufficient to soundly abstract the state space and to prove a provenance property; this is consistent with other uses of counter abstractions in verification [23,17].…”

Section: Expand-enlarge-check and Partial Order Reductionsupporting

confidence: 73%

“…Our second observation is that message passing programs have a lot of scope for partial-order reduction, by allowing a process to continue executing until it hits a blocking receive action. To take advantage of these features, we implemented a coverability checker that combines expand-enlarge-check (EEC) [10] with partial order reduction [11].…”

Section: Expspace Upper Boundsmentioning

confidence: 99%

“…The EEC procedure [10] performs counter abstraction over a Petri net. We observe that only the places representing shared channels can have more than one token in our Petri nets.…”

Section: Expand-enlarge-check and Partial Order Reductionmentioning

confidence: 99%

“…Our implementation uses the expand-enlarge-check (EEC) pradigm [10]. The EEC algorithm explores a sequence of finite-state approximations of the message passing program.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Static Provenance Verification for Message Passing Programs

2013

View full text Add to dashboard Cite

Abstract. Provenance information records the source and ownership history of an object. We study the problem of provenance tracking in concurrent programs, in which several principals execute concurrent processes and exchange messages over unbounded but unordered channels. The provenance of a message, roughly, is a function of the sequence of principals that have transmitted the message in the past. The provenance verification problem is to statically decide, given a message passing program and a set of allowed provenances, whether the provenance of all messages in all possible program executions, belongs to the allowed set. We formalize the provenance verification problem abstractly in terms of well-structured provenance domains, and show a general decidability result for it. In particular, we show that if the provenance of a message is a sequence of principals who have sent the message, and a provenance query asks if the provenance lies in a regular set, the problem is decidable and EXPSPACE-complete. While the theoretical complexity is high, we show an implementation of our technique that performs efficiently on a set of Javascript examples tracking provenances in Firefox extensions. Our experiments show that many browser extensions store and transmit user information although the user sets the browser to the private mode.

show abstract

Section: Expand-enlarge-check and Partial Order Reductionsupporting

confidence: 73%

Section: Expspace Upper Boundsmentioning

confidence: 99%

“…The EEC procedure [10] performs counter abstraction over a Petri net. We observe that only the places representing shared channels can have more than one token in our Petri nets.…”

Section: Expand-enlarge-check and Partial Order Reductionmentioning

confidence: 99%

“…Our implementation uses the expand-enlarge-check (EEC) pradigm [10]. The EEC algorithm explores a sequence of finite-state approximations of the message passing program.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Static Provenance Verification for Message Passing Programs

2013

View full text Add to dashboard Cite

show abstract

“…This means that, in theory, the complexity of this problem is high, but in practice, there are quite efficient techniques (based on iterative computation of under/upper approximations) developed recently for solving this problem which have been implemented and used successfully in [GRB06b,GRB06a]. Moreover, we have proposed a notion of stratified context-bounding for which the verification is in NP, i.e., as hard as in the case without dynamic thread creation.…”

Section: Resultsmentioning

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

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

Expand, Enlarge and Check... Made Efficient

Geeraerts

Raskin

Begin

2005

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symbolic backward reachability. In a recent paper, we have introduced the theory underlying a new algorithmic solution, called 'Expand, Enlarge and Check', which can be implemented in a forward manner. In this paper, we provide additional concepts and algorithms to turn this theory into efficient forward algorithms for monotonic extensions of Petri nets and Lossy Channels Systems. We have implemented a prototype and applied it on a large set of examples. This prototype outperforms a previous fine tuned prototype based on backward symbolic exploration and shows the practical interest of our new algorithmic solution. The data used in the experiments and more relevant information about 'Expand, Enlarge and Check' can be found at: http://www.ulb.ac.be/di/ssd/ggeeraer/eec/

show abstract

Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS

Cited by 40 publications

References 14 publications

Static Provenance Verification for Message Passing Programs

Static Provenance Verification for Message Passing Programs

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

Expand, Enlarge and Check... Made Efficient

Contact Info

Product

Resources

About