Symbolic model checking of software product lines

We study the problem of model checking software product line (SPL) behaviours against temporal properties. This is more difficult than for single systems because an SPL with n features yields up to 2n individual systems to verify. As each individual verification suffers from state explosion, it is c...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2011 33rd International Conference on Software Engineering (ICSE) s. 321 - 330
Hlavní autoři: Classen, Andreas, Heymans, Patrick, Schobbens, Pierre-Yves, Legay, Axel
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 21.05.2011
IEEE
Edice:ACM Conferences
Témata:
Boolean functions
Computational modeling
Encoding
Explosions
features
Rain
Semantics
Software
Software and its engineering > Software creation and management > Software verification and validation > Formal software verification
Software and its engineering > Software organization and properties > Software functional properties > Formal methods
Software and its engineering > Software organization and properties > Software functional properties > Formal methods > Model checking
software product lines
specification
Theory of computation > Logic > Verification by model checking
software product lines
features
specification
ISBN:9781450304450, 1450304451
ISSN:0270-5257
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We study the problem of model checking software product line (SPL) behaviours against temporal properties. This is more difficult than for single systems because an SPL with n features yields up to 2n individual systems to verify. As each individual verification suffers from state explosion, it is crucial to propose efficient formalisms and heuristics. We recently proposed featured transition systems (FTS), a compact representation for SPL behaviour, and defined algorithms for model checking FTS against linear temporal properties. Although they showed to outperform individual system verifications, they still face a state explosion problem as they enumerate and visit system states one by one. In this paper, we tackle this latter problem by using symbolic representations of the state space. This lead us to consider computation tree logic (CTL) which is supported by the industry-strength symbolic model checker NuSMV. We first lay the foundations for symbolic SPL model checking by defining a feature-oriented version of CTL and its dedicated algorithms. We then describe an implementation that adapts the NuSMV language and tool infrastructure. Finally, we propose theoretical and empirical evaluations of our results. The benchmarks show that for certain properties, our algorithm is over a hundred times faster than model checking each system with the standard algorithm.
ISBN:9781450304450
1450304451
ISSN:0270-5257
DOI:10.1145/1985793.1985838