DiVinE: Parallel Distributed Model Checker

Barnat, Jǐŕı; Brim, Luboš; Češka, Milan; Ročkai, Petr

doi:10.1109/pdmc-hibi.2010.9

Cited by 63 publications

(47 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The added parallelism puts extra stress on the scalability of our algorithms and therefore also forces a repeat of some of our previous reachability experiments [15]. We investigated the cause for the performance difference between various algorithms: NMCNDFS [14], CNDFS (this paper), OWCTY+MAP [5] (the best representant of parallel BFS-based algorithms [13]) and reachability from [15]. Work duplication due to overlapping stacks can cause slowdowns for all multi-core NDFS variants, as can long await cycles in CNDFS.…”

Section: Experimental Evaluationmentioning

confidence: 99%

“…LTSMIN 1.9 2 was compiled with GCC 4.4.2 (with optimisation -O2) and ran with: dve22lts-mc --threads=N -s28 --state=table --strategy=name, where name can be cndfs or endfs,lndfs, representing the different algorithms [14]. We used DiVinE 2.5.2 [5] as OWCTY+MAP implementation, compiled and run with equivalent parameters. Since LTSMIN reuses its next-state function, both tools are comparable [15].…”

Section: Experimental Evaluationmentioning

confidence: 99%

See 1 more Smart Citation

Improved Multi-Core Nested Depth-First Search

Évangelista

Laarman

Petrucci

et al. 2012

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Abstract. This paper presents CNDFS, a tight integration of two earlier multicore nested depth-first search (NDFS) algorithms for LTL model checking. CNDFS combines the different strengths and avoids some weaknesses of its predecessors. We compare CNDFS to an earlier ad-hoc combination of those two algorithms and show several benefits: It has shorter and simpler code and a simpler correctness proof. It exhibits more robust performance with similar scalability, while at the same time reducing memory requirements. The algorithm has been implemented in the multi-core backend of the LTSMIN model checker, which is now benchmarked for the first time on a 48 core machine (previously 16). The experiments demonstrate better scalability than other parallel LTL model checking algorithms, but we also investigate apparent bottlenecks. Finally, we noticed that the multi-core NDFS algorithms produce shorter counterexamples, surprisingly often shorter than their BFS-based counterparts.

show abstract

Section: Experimental Evaluationmentioning

confidence: 99%

Section: Experimental Evaluationmentioning

confidence: 99%

Improved Multi-Core Nested Depth-First Search

Évangelista

Laarman

Petrucci

et al. 2012

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

show abstract

“…the one of [17]) into ABCD. To optimise the performance, using a specific library as Divine [18] will also be considered. Finally, in the security domain, we will consider more complex protocols with branching and looping structures, as well as complex data types manipulations.…”

Section: Discussionmentioning

confidence: 99%

A BSP Algorithm for On-the-Fly Checking CTL* Formulas on Security Protocols

Gava¹,

Guedj²,

Pommereau

2012

2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies

View full text Add to dashboard Cite

show abstract

“…For our verification purpose, we opt for two model-checkers: DiVinE [22] and ITS-tools [23]. We choose these model-checkers for their ability to deal with large models and formulae, by using parallel computation for the first one or a symbolic approach for the second one.…”

Section: Model-checking Backgroundmentioning

confidence: 99%

Formal verification of mobile robot protocols

et al. 2016

View full text Add to dashboard Cite

Mobile robot networks emerged in the past few years as a promising distributed computing model. Existing work in the literature typically ensures the correctness of mobile robot protocols via ad hoc handwritten proofs, which, in the case of asynchronous execution models, are both cumbersome and error-prone.In this paper, we propose the first formal model and general verification (by model-checking) methodology for mobile robot protocols operating in a discrete space (that is, the set of possible robot positions is finite). Our contribution is threefold. First, we formally model using synchronized automata a network of mobile robots operating under various synchrony (or asynchrony) assumptions. Then, we use this formal model as input model for the DiVinE model-checker and prove the equivalence of the two models. Third, we verify using DiVinE two known protocols for variants of the ring exploration in an asynchronous setting (exploration with stop and perpetual exclusive exploration).The exploration with stop we verify was manually proved correct only when the number of robots is k > 17, and n (the ring size) and k are co-prime. As the necessity of this bound was not proved in the original paper, our methodology demonstrates that for several instances of k and n not covered in the original paper, the algorithm remains correct. In the case of the perpetual exclusive exploration protocol, our methodology exhibits a counter-example in the completely asynchronous setting where safety is violated, which is used to correct the original protocol.

show abstract

DiVinE: Parallel Distributed Model Checker

Cited by 63 publications

References 8 publications

Improved Multi-Core Nested Depth-First Search

Improved Multi-Core Nested Depth-First Search

A BSP Algorithm for On-the-Fly Checking CTL* Formulas on Security Protocols

Formal verification of mobile robot protocols

Contact Info

Product

Resources

About