Laarman, A.W. and Pater, E. and van de Pol, J.C. and Weber, Michael
Guard-based Partial-Order Reduction.
In: Proceedings of the 20th International SPIN Symposium on Model Checking of Software, SPIN 2013, 8-9 July 2013, Stony Brook, NY, USA.
Lecture Notes in Computer Science .
Full text available as:
Official URL: http://dx.doi.org/10.1007/978-3-642-39176-7_15
This paper aims at making partial-order reduction independent of the modeling language. Our starting point is the stubborn set algorithm of Valmari (see also Godefroid's thesis), which relies on necessary enabling sets. We generalise it to a guard-based algorithm, which can be implemented on top of an abstract model checking interface.
We extend the generalised algorithm by introducing necessary disabling sets and adding a heuristics to improve state space reduction. The effect of the changes to the algorithm are measured using an implementation in the LTSmin model checking toolset. We experiment with partial-order reduction on a number of Promela models, some with LTL properties, and on benchmarks from the BEEM database in the DVE language.
We compare our results to the SPIN model checker. While the reductions take longer, they are consistently better than SPIN's ample set and even often surpass the ideal upper bound for the ample set, as established empirically by Geldenhuys, Hansen~and~Valmari on BEEM models.
|Item Type:||Conference or Workshop Paper (Full Paper, Talk)|
|Research Group:||EWI-FMT: Formal Methods and Tools|
|Research Program:||CTIT-DSN: Dependable Systems and Networks|
|Research Project:||CEDICT: 3TU Center of Excellence for ICT|
|Uncontrolled Keywords:||model checking, partial order reduction, proviso, stubborn set, ample set, optimal reductions, necessary enabling sets, necessary disabling sets, heuristics, SPIN, LTSmin, Promela, DVE, LTL|
|Deposited On:||23 May 2013|
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item