Abstract

Variational systems allow effective building of many custom variants by using features (configuration options) to mark the variable functionality. In many of the applications, their quality assurance and formal verification are of paramount importance. Family-based model checking allows simultaneous verification of all variants of a variational system in a single run by exploiting the commonalities between the variants. Yet, its computational cost still greatly depends on the number of variants (often huge).

Highlights

  • Variational systems appear in many application areas and for many reasons

  • We show how to achieve efficient family-based model checking of Computation Tree Logic (CTL) temporal properties using variability abstractions and off-the-shelf tools

  • We show that the abstraction of an featured transition systems (FTSs) is sound with respect to CTL

Read more

Summary

Introduction

Variational systems appear in many application areas and for many reasons. Efficient methods to achieve customization, such as Software Product Line Engineering (SPLE) [8], use features (configuration options) to control presence and absence of the variable functionality [1]. A simple “brute-force” application of a single-system model checker to each variant is infeasible for realistic variational systems, due to the sheer number of variants This is very ineffective because the same execution behavior is checked multiple times, whenever it is shared by some variants. More efficient, verification technique [5,6] is based on using compact representations for modelling variational systems, which incorporate the commonality within the family. We will call these representations variability models (or featured transition systems). These algorithms model check all variants simultaneously in a single run and pinpoint the variants that violate properties Their performance still heavily depends on the size and complexity of the configuration space of the analyzed variational system. Compared to the family-based model checking, experiments show that the proposed technique achieves performance gains

Background
Abstraction of FTSs
Implementation
Evaluation
Related Work and Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.