# Towards a Feature mu-Calculus Targeting SPL Verification

@inproceedings{Beek2016TowardsAF,
title={Towards a Feature mu-Calculus Targeting SPL Verification},
author={Maurice H. ter Beek and Erik P. de Vink and Tim A. C. Willemse},
booktitle={FMSPLE},
year={2016}
}
• Published in FMSPLE 28 March 2016
• Computer Science
The modal μ-calculus μL is a well-known fixpoint logic to express and model check properties interpreted over labeled transition systems. In this paper, we propose two variants of the μ-calculus, μLf and μL?f, for feature transition systems. For this, we explicitly incorporate feature expressions into the logics, allowing operators to select transitions and behavior restricted to specific products and subfamilies. We provide semantics for μLf and μL?f and relate the two new μ-calculi and μL to…
Family-Based Model Checking of SPL based on mCRL2
• Computer Science
SPLC
• 2017
We discuss how the general-purpose model checker mCRL2 can be used for family-based verification of behavioral properties of software product lines. This is achieved by exploiting a feature-oriented
Family-Based Model Checking of SPL based on mCRL 2 Extended Abstract
We discuss how the general-purpose model checker mCRL2 can be used for family-based verification of behavioral properties of software product lines. This is achieved by exploiting a featureoriented
Family-Based Model Checking with mCRL2
• Computer Science
FASE
• 2017
The feasibility of the approach based on the feature $$\mu$$-calculus with data, which combines modalities with feature expressions, on an SPL benchmark model is illustrated and the runtime improvement that family-based model checking with mCRL2 offers with respect to model checking the benchmark product-by-product is shown.
Scalability of Deductive Verification Depends on Method Call Treatment
• Computer Science
ISoLA
• 2018
Analysis of the program verifier KeY with large programs varying in the number of method calls of each method and the maximum depth of the stack trace shows that specifying 10% additional methods in a program can reduce the verification costs by up to 50%, and an effective combination of contracting and method inlining is indispensable for the scalability of deductive verification.
A Framework for Quantitative Modeling and Analysis of Highly (Re)configurable Systems
• Computer Science
IEEE Transactions on Software Engineering
• 2020
This paper presents the approach to the quantitative modeling and analysis of highly (re)configurable systems, such as software product lines, using a formal modeling language that allows to model systems with probabilistic behavior, possibly subject to quantitative feature constraints, and able to dynamically install, remove or replace features.
The mCRL2 Toolset for Analysing Concurrent Systems - Improvements in Expressivity and Usability
• Computer Science
TACAS
• 2019
The mCRL2 language has been extended to support the modelling of probabilistic behaviour and the usability has been improved with the addition of refinement checking, counterexample generation and a user-friendly GUI.
Modelling and analysis with featured modal contract automata
SPLC
• 2018
This experience report shows how to model a Hotel service product line with FMCA and how to analyse it with FMCAT, the open-source prototypical toolkit that supports the specification and orchestration of FMCA.
Family-Based SPL Model Checking Using Parity Games with Variability
• Computer Science
FASE
• 2020
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.
Supervisory Controller Synthesis for Product Lines Using CIF 3
ISoLA
• 2016
The procedure as presented focusses on synthesis, but leaves ample opportunity to handle e.g. uncontrollable behaviour, dynamic reconfiguration, and product- and family-based analysis.

## References

SHOWING 1-10 OF 47 REFERENCES
Family-Based Model Checking with mCRL2
• Computer Science
FASE
• 2017
The feasibility of the approach based on the feature $$\mu$$-calculus with data, which combines modalities with feature expressions, on an SPL benchmark model is illustrated and the runtime improvement that family-based model checking with mCRL2 offers with respect to model checking the benchmark product-by-product is shown.
Incremental model checking of delta-oriented software product lines
• Computer Science
J. Log. Algebraic Methods Program.
• 2016
DeltaCCS: A Core Calculus for Behavioral Change
• Computer Science
ISoLA
• 2014
This work proposes a delta-oriented extension to Milner's process calculus CCS, called DeltaCCS, that allows for modular reasoning about behavioral variability, and defines variability-aware CCS congruences for a modular reasoning on the preservation of behavioral properties defined by the Modal μ-Calculus after changing CCS specifications.
Model-checking processes with data
• Computer Science, Mathematics
Sci. Comput. Program.
• 2005
Using FMC for family-based analysis of software product lines
• Computer Science
SPLC
• 2015
The FMC model checker can be used to model and analyze behavioural variability in Software Product Lines and is presented as a proof-of-concept that shows the application of FMC to an illustrative Featured Transition System from the literature.
Coherent branching feature bisimulation
• Computer Science
FMSPLE
• 2015
It is proved that branching feature bisimulation for an FTS of a family of products coincides with branching bisimulations for the LTS projection of each the individual products.
Featured Transition Systems: Foundations for Verifying Variability-Intensive Systems and Their Application to LTL Model Checking
• Computer Science
IEEE Transactions on Software Engineering
• 2013
This paper proposes an efficient automata-based approach to linear time logic (LTL) model checking of variability-intensive systems, and provides an in-depth treatment of the FTS model checking algorithm.
Symbolic model checking of software product lines
• Computer Science
2011 33rd International Conference on Software Engineering (ICSE)
• 2011
This paper lays the foundations for symbolic SPL model checking by defining a feature-oriented version of CTL and its dedicated algorithms, and describes an implementation that adapts the NuSMV language and tool infrastructure.
Combining declarative and procedural views in the specification and analysis of product families
• Computer Science
SPLC '13 Workshops
• 2013
We introduce the feature-oriented language FLan as a proof of concept for specifying both declarative aspects of product families, namely constraints on their features, and procedural aspects, namely