Theorem Proving for Product Line Model Verification

Product line models of requirements can be used to drive the selection of requirements of new systems in the product line. Validating any selected single system is difficult because product line models are large and complex. However by modelling variability and dependency between requirements using propositional connectives a logical expression can be developed for the model and then selection validation can be achieved by satisfying the logical expression. This approach can be used to validate the model as a whole. A case study with nearly 800 requirements is presented and the computational aspects of the approach are discussed.

[1]  Hermann Kaindl,et al.  Representing Requirements on Generic Software in an Application Family Model , 2000, ICSR.

[2]  Hermann Kaindl,et al.  Reusing single system requirements from application family requirements , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[3]  Mike Mannion.  Using First-Order Logic for Product Line Model Validation , 2002, SPLC.

[4]  Dirk Muthig,et al.  PuLSE-I: Deriving instances from a product line infrastructure , 2000, Proceedings Seventh IEEE International Conference and Workshop on the Engineering of Computer-Based Systems (ECBS 2000).

[5]  Juha Savolainen,et al.  An Integrated Model for Requirements Structuring and Architecture Design , 2002 .

[6]  Ivar Jacobson,et al.  Software Reuse: Architecture, Process And Organization For Business Success , 1998, Proceedings. Technology of Object-Oriented Languages. TOOLS 26 (Cat. No.98EX176).