ProVeLines: a product line of verifiers for software product lines
Proceedings of the 17th International Software Product Line Conference co-located workshops
Proceedings of the 17th International Software Product Line Conference co-located workshops
Towards statistical prioritization for software product lines testing
Proceedings of the Eighth International Workshop on Variability Modelling of Software-Intensive Systems
Formal semantics, modular specification, and symbolic verification of product-line behaviour
Science of Computer Programming
| Hi-index | 0.00 |
The premise of variability-intensive systems, specifically in software product line engineering, is the ability to produce a large family of different systems efficiently. Many such systems are critical. Thorough quality assurance techniques are thus required. Unfortunately, most quality assurance techniques were not designed with variability in mind. They work for single systems, and are too costly to apply to the whole system family. In this paper, we propose an efficient automata-based approach to linear time logic (LTL) model checking of variability-intensive systems. We build on earlier work in which we proposed featured transitions systems (FTSs), a compact mathematical model for representing the behaviors of a variability-intensive system. The FTS model checking algorithms verify all products of a family at once and pinpoint those that are faulty. This paper complements our earlier work, covering important theoretical aspects such as expressiveness and parallel composition as well as more practical things like vacuity detection and our logic feature LTL. Furthermore, we provide an in-depth treatment of the FTS model checking algorithm. Finally, we present SNIP, a new model checker for variability-intensive systems. The benchmarks conducted with SNIP confirm the speedups reported previously.