Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/2483

 Title: Model Mining and Efficient Verification of Software Product Lines Authors: Soleimanifard, SiavashGurov, DilianSchaefer, InaØstvold, BjarteMarkov, Minko Keywords: Product FamiliesCompositional VerificationModel MiningVariability ModelsModel CheckingMaximal Models Issue Date: 2015 Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences Citation: Serdica Journal of Computing, Vol. 9, No 1, (2015), 35p-82p Abstract: Software product line modeling aims at capturing a set of software products in an economic yet meaningful way. We introduce a class of variability models that capture the sharing between the software artifacts forming the products of a software product line (SPL) in a hierarchical fashion, in terms of commonalities and orthogonalities. Such models are useful when analyzing and verifying all products of an SPL, since they provide a scheme for divide-and-conquer-style decomposition of the analysis or verification problem at hand. We define an abstract class of SPLs for which variability models can be constructed that are optimal w.r.t. the chosen representation of sharing. We show how the constructed models can be fed into a previously developed algorithmic technique for compositional verification of control-flow temporal safety properties, so that the properties to be verified are iteratively decomposed into simpler ones over orthogonal parts of the SPL, and are not re-verified over the shared parts. We provide tool support for our technique, and evaluate our tool on a small but realistic SPL of cash desks. URI: http://hdl.handle.net/10525/2483 ISSN: 1312-6555 Appears in Collections: Volume 9 Number 1

Files in This Item:

File Description SizeFormat