A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
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 labelleddoi:10.1007/978-3-030-45234-6_12 fatcat:g2kc5ihzxrfp7lkri264pabzsq