2012 · 13 citations · 13 references
Software MaintenanceSoftware Reliability TestingEngineeringVerificationSoftware EngineeringModel CheckingModel VerificationSoftware AnalysisFormal VerificationScalability AnalysisArithmetic FormulaVariability ManagementReliability EngineeringSystems EngineeringDependability AnalysisReliabilitySoftware ReliabilityComputer EngineeringComputer ScienceSoftware Product LinesDependability ModellingSoftware DesignParametric Arithmetic FormulaReliability ModellingProgram AnalysisSoftware TestingFormal MethodsProduct Line EngineeringSystem Software
Some domains, specially those of critical systems, require dependable software. Ensuring dependability is not a trivial problem. Model checking can be used to estimate the reliability of a software through models that represent the behavior of the system. Through these models it is possible to estimate and measure quantitatively properties such as reliability. In the context of Software Product Lines (SPL), we need to check an entire family of systems. It is not feasible to build a model for each configuration of a SPL as the number of models required can be very large. Some contributions directly address this issue proposing techniques specifically tailored for SPL. Particularly, the technique of parametric model-checking allows the use of a single model to obtain properties values from different configurations through an arithmetic formula. However, even an arithmetic formula may not be easy to evaluate. If the number of operands is large enough the cost of evaluation of this formula could also be large. Current techniques may impose limitations over the variability and/or system architecture. To the best of our knowledge, to handle variability on model checking is still an open problem. This work is an investigation of the whole process of obtaining a parametric arithmetic formula for a SPL. Knowing this process and the factors that directly affect the growth of the formula, we are able to develop new techniques to deal with parametric model-checking in SPL with less restrictions.
13
Introduction to automata theory, languages, and computation
Computer Languages · 1980 · 6.8K citations
A logic for reasoning about time and reliability
Hans Hansson, Bengt Jönsson · Formal Aspects of Computing · 1994 · 1.3K citations · Full text
Model checking <u>lots</u> of systems
Patrick Heymans, Pierre‐Yves Schobbens, Axel Legay et al. · 2010 · 329 citations
Symbolic model checking of software product lines
Patrick Heymans, Pierre‐Yves Schobbens, Axel Legay · 2011 · 208 citations · Full text