Variability Abstraction and Refinement for Game-Based Lifted Model Checking of Full CTL

Abstract

Variability models allow effective building of many custom model variants for various configurations. Lifted model checking for a variability model is capable of verifying all its variants simultaneously in a single run by exploiting the similarities between the variants. The computational cost of lifted model checking still greatly depends on the number of variants (the size of configuration space), which is often huge. One of the most promising approaches to fighting the configuration space explosion problem in lifted model checking are variability abstractions. In this work, we define a novel game-based approach for variability-specific abstraction and refinement for lifted model checking of the full CTL, interpreted over 3-valued semantics. We propose a direct algorithm for solving a 3-valued (abstract) lifted model checking game. In case the result of model checking an abstract variability model is indefinite, we suggest a new notion of refinement, which eliminates indefinite results. This provides an iterative incremental variability-specific abstraction and refinement framework, where refinement is applied only where indefinite results exist and definite results from previous iterations are reused.

Family-Based SPL Model Checking Using Parity Games with Variability

“…For one, the efficiency of our approach with respect to related approaches is not easily measured with the elevator case study. While properties ψ 2 and ψ 5 were verified also in [14,15,25,26,35,38], not much can be concluded from the reported running times. First, our model's mCRL2 code was developed from scratch, following the SMV code from [37], and not the fPROMELA code of [14,15,25,26,35,38].…”

“…In this paper, we present efficient family-based SPL model checking of modal μ-calculus formulae on FTSs based on parity games with variability. Years after its introduction [3,14], family-based model checking of SPLs or program families is still a popular topic [10,16,19,[23][24][25][26], including a few game-theoretic approaches based on solving (3-valued) model checking games on featured symbolic automata and on modal transition systems. A parity game is a 2-player turn-based graph game.…”

Efficient static analysis and verification of featured transition systems

“…Family-based model checking of behavioural SPL models provides a means to simultaneously verify multiple behavioural product models in a single run. Properties can be verified with dedicated SPL model-checking tools such as SNIP (Classen et al 2012, ProVe-Lines (Cordy et al 2013a), VMC (ter Beek et al 2012ter Beek and Mazzanti 2014), fNuSMV (Classen et al 2014;Dimovski et al 2019), ProFeat (Chrszon et al 2018) (for probabilistic model checking), or QFLan (ter Beek et al 2020a;Vandin et al 2018) (for statistical model checking), or-through suitable abstractions or encodings-with well-known classical model checkers like SPIN (Dimovski et al 2015, PRISM (Dubslaff et al 2015) (for probabilistic model checking), Maude (Lochau et al 2016), mCRL2 (ter Beek et al 2017, 2020b, or NuSMV (Dimovski 2020).…”

Static analysis and family-based model checking of featured transition systems with VMC

“…Family-based model checking of behavioural variability models provides a means to simultaneously verify multiple behavioural variant models in a single run. Properties can be verified with dedicated SPL model-checking tools like SNIP [24,26], ProVeLines [28], VMC [11,13,14], fNuSMV [25,40], ProFeat [20] (for probabilistic model checking), or QFLan [12,63] (for statistical model checking), or-through suitable abstractions or encodings-with wellknown classical model checkers like SPIN [38,39,41], PRISM [43] (for probabilistic model checking), Maude [55], mCRL2 [10,15], or NuSMV [37]. The aforementioned survey [61] also discusses software model checking, operating directly on source code in Java or C [2,60].…”