Proceedings of the 17th International Software Product Line Conference co-located workshops
| Hi-index | 0.00 |
Some domains, specially those of critical systems,require dependable software. Ensuring dependability is not atrivial problem. Model checking can be used to estimate thereliability of a software through models that represent thebehavior of the system. Through these models it is possible toestimate and measure quantitatively properties such as reliability.In the context of Software Product Lines (SPL), we need tocheck an entire family of systems. It is not feasible to builda model for each configuration of a SPL as the number ofmodels required can be very large. Some contributions directlyaddress this issue proposing techniques specifically tailored forSPL. Particularly, the technique of parametric model-checkingallows the use of a single model to obtain properties values fromdifferent configurations through an arithmetic formula. However,even an arithmetic formula may not be easy to evaluate. If thenumber of operands is large enough the cost of evaluation ofthis formula could also be large. Current techniques may imposelimitations over the variability and/or system architecture. To thebest of our knowledge, to handle variability on model checkingis still an open problem. This work is an investigation of thewhole process of obtaining a parametric arithmetic formulafor a SPL. Knowing this process and the factors that directlyaffect the growth of the formula, we are able to develop newtechniques to deal with parametric model-checking in SPL withless restrictions.