Incremental model checking of delta-oriented software product lines

Lochau, Malte; Mennicke, Stephan; Baller, Hauke; Ribbeck, Lars

doi:10.1016/j.jlamp.2015.09.004

Cited by 27 publications

(23 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There are different formalisms for representing variability models [20,2]. Classen et al [4] present Featured Transition Systems (FTSs), which are today widely accepted as the model essentially sufficient for most purposes of lifted model checking.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

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

Dimovski

Legay

Wąsowski

2019

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

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.

show abstract

Section: Related Work and Conclusionmentioning

confidence: 99%

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

Dimovski

Legay

Wąsowski

2019

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…There is a growing body of research on customizing model-checking techniques for SPLs. Like our FTS-based proposals [19,20], the CCS-based proposals PL-CCS [2,10] and DeltaCCS [12] are grounded in the μ-calculus. In [26], PL-CCS was proven to be less expressive (in terms of the sets of definable products) than FTSs, while DeltaCCS allows only limited familybased model checking (viz.…”

Section: Contributionsmentioning

confidence: 99%

“…To make SPL models amenable to family-based reasoning, feature-based variability was introduced in many behavioral models, e.g. based on process calculi [2,[10][11][12] and labeled transition systems (LTSs) [3,[13][14][15]. Arguably the most widely used behavioral SPL models are featured transition systems (FTSs) [13].…”

Section: Introductionmentioning

confidence: 99%

“…Thus, an FTS incorporates the behavior of all eligible products, while individual behavior can be extracted as LTSs. Properties of such models can be verified with dedicated SPL model checkers [16][17][18] or, to a certain degree, with single system model checkers [7,12,14].…”

Section: Introductionmentioning

confidence: 99%

“…However, there have been earlier proposals for using the μ-calculus to analyze SPLs (cf., e.g., [2,10,12,19,20]). In [19], for instance, mCRL2 and its toolset [21,22] were used for product-based model checking.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Family-Based Model Checking with mCRL2

Beek

Vink

Willemse

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Family-Based SPL Model Checking Using Parity Games with Variability

Beek

Loo

Vink

et al. 2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Family-based SPL model checking concerns the simultaneous verification of multiple product models, aiming to improve on enumerative product-based verification, by capitalising on the common features and behaviour of products in a software product line (SPL), typically modelled as a featured transition system (FTS). We propose efficient family-based SPL model checking of modal μ-calculus formulae on FTSs based on variability parity games, which extend parity games with conditional edges labelled with feature configurations, by reducing the SPL model checking problem for the modal μ-calculus on FTSs to the variability parity game solving problem, based on an encoding of FTSs as variability parity games. We validate our contribution by experiments on SPL benchmark models, which demonstrate that a novel family-based algorithm to collectively solve variability parity games, using symbolic representations of the configuration sets, outperforms the product-based method of solving the standard parity games obtained by projection with classical algorithms.

show abstract

Incremental model checking of delta-oriented software product lines

Cited by 27 publications

References 33 publications

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

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

Family-Based Model Checking with mCRL2

Family-Based SPL Model Checking Using Parity Games with Variability

Contact Info

Product

Resources

About