Formal semantics, modular specification, and symbolic verification of product-line behaviour

  • Authors:

  • Andreas Classen;Maxime Cordy;Patrick Heymans;Axel Legay;Pierre-Yves Schobbens

  • Affiliations:

  • PReCISE Research Center, University of Namur, Belgium;PReCISE Research Center, University of Namur, Belgium;PReCISE Research Center, University of Namur, Belgium and INRIA Lille-Nord Europe, Université Lille 1 - LIFL - CNRS, France;INRIA Rennes, France;PReCISE Research Center, University of Namur, Belgium

  • Venue:
  • Science of Computer Programming
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

Formal techniques for specifying and verifying Software Product Lines (SPL) are actively studied. While the foundations of this domain recently made significant progress with the introduction of Featured Transition Systems (FTSs) and associated algorithms, SPL model checking still faces the well-known state explosion problem. Moreover, there is a need for high-level specification languages usable in industry. We address the state explosion problem by applying the principles of symbolic model checking to FTS-based verification of SPLs. In order to specify properties on specific products only, we extend the temporal logic CTL with feature quantifiers. Next, we show how SPL behaviour can be specified with fSMV, a variant of SMV, the specification language of the industry-strength model checker NuSMV. fSMV is a feature-oriented extension of SMV originally introduced by Plath and Ryan. We prove that fSMV and FTSs are expressively equivalent. Finally, we connect these results to a NuSMV extension we developed for verifying SPLs against CTL properties.