Towards a Feature mu-Calculus Targeting SPL Verification

Maurice H. ter Beek
(ISTI-CNR, Pisa, Italy)
Erik P. de Vink
(TU/e, Eindhoven, The Netherlands)
Tim A. C. Willemse
(TU/e, Eindhoven, The Netherlands)

The modal mu-calculus mu-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 mu-calculus, mu-Lf and mu-Lf', 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 mu-Lf and mu-Lf' and relate the two new mu-calculi and mu-L to each other. Next, we focus on the analysis of SPL behavior and show how our formalism can be applied for product-based verification with mu-Lf as well as family-based verification with mu-Lf'. We illustrate by means of a toy example how properties can be model checked, exploiting an embedding of mu-Lf' into the mu-calculus with data.

In Julia Rubin and Thomas Thüm: Proceedings 7th International Workshop on Formal Methods and Analysis in Software Product Line Engineering (FMSPLE 2016), Eindhoven, The Netherlands, April 3, 2016, Electronic Proceedings in Theoretical Computer Science 206, pp. 61–75.
Published: 28th March 2016.

ArXived at: http://dx.doi.org/10.4204/EPTCS.206.6 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org