Potential Synergies of Theorem Proving and Model Checking for Software Product Lines

被引:13
|
作者
Thuem, Thomas [1 ]
Meinicke, Jens [1 ]
Benduhn, Fabian [1 ]
Hentschel, Martin [2 ]
von Rhein, Alexander [3 ]
Saake, Gunter [1 ]
机构
[1] Univ Magdeburg, Magdeburg, Germany
[2] Univ Darmstadt, Darmstadt, Germany
[3] Univ Passau, Passau, Germany
来源
18TH INTERNATIONAL SOFTWARE PRODUCT LINE CONFERENCE (SPLC 2014), VOL 1 | 2014年
关键词
Software product lines; theorem proving; model checking; design by contract; feature-based specification; family-based verification; variability encoding; feature-oriented contracts; SPECIFICATION; VERIFICATION;
D O I
10.1145/2648511.2648530
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The verification of software product lines is an active research area. A challenge is to efficiently verify similar products without the need to generate and verify them individually. As solution, researchers suggest family-based verification approaches, which either transform compile-time into runtime variability or make verification tools variability-aware. Existing approaches either focus on theorem proving, model checking, or other verification techniques. For the first time, we combine theorem proving and model checking to evaluate their synergies for product-line verification. We provide tool support by connecting five existing tools, namely FEATUREIDE and FEATUREHOUSE for product-line development, as well as KeY, JPF, and OPENJML for verification of Java programs. In an experiment, we found the synergy of improved effectiveness and efficiency, especially for product lines with few defects. Further, we experienced that model checking and theorem proving are more efficient and effective if the product line contains more defects.
引用
收藏
页码:177 / 186
页数:10
相关论文
共 50 条
  • [41] Probabilistic software product lines
    Camacho, Carlos
    Llana, Luis
    Nunez, Alberto
    Bravetti, Mario
    JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2019, 107 : 54 - 78
  • [42] Granularity in Software Product Lines
    Kaestner, Christian
    Apel, Sven
    Kuhlemann, Martin
    ICSE'08 PROCEEDINGS OF THE THIRTIETH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, 2008, : 311 - 320
  • [43] Testing Software Product Lines
    da Mota Silveira Neto, Paulo Anselmo
    Runeson, Per
    Machado, Ivan do Carmo
    de Almeida, Eduardo Santana
    de Lemos Meira, Silvio Romero
    Engstrom, Emelie
    IEEE SOFTWARE, 2011, 28 (05) : 16 - 20
  • [44] A Classification of Product Sampling for Software Product Lines
    Varshosaz, Mahsa
    Al-Hajjaji, Mustafa
    Thum, Thomas
    Runge, Tobias
    Mousavi, Mohammad Reza
    Schaefer, Ina
    SPLC'18: PROCEEDINGS OF THE 22ND INTERNATIONAL SYSTEMS AND SOFTWARE PRODUCT LINE CONFERENCE, VOL 1, 2018, : 1 - 13
  • [45] Model checking: Software and beyond
    Clarke, Edmund M.
    Lerda, Flavio
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2007, 13 (05) : 639 - 649
  • [46] Software Model Checking SystemC
    Cimatti, Alessandro
    Narasamdya, Iman
    Roveri, Marco
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2013, 32 (05) : 774 - 787
  • [47] The Pro-PD Process Model for Product Derivation within software product lines
    O'Leary, Padraig
    de Almeida, Eduardo Santana
    Richardson, Ita
    INFORMATION AND SOFTWARE TECHNOLOGY, 2012, 54 (09) : 1014 - 1028
  • [48] DESIGN AND VERIFICATION OF PARITY CHECKING CIRCUIT USING HOL4 THEOREM PROVING
    Deniz, Elif
    Aksoy, Kubra
    Tahar, Sofiene
    Zeren, Yusuf
    SIGMA JOURNAL OF ENGINEERING AND NATURAL SCIENCES-SIGMA MUHENDISLIK VE FEN BILIMLERI DERGISI, 2019, 10 (02): : 245 - 252
  • [49] Efficient software product-line model checking using induction and a SAT solver
    He, Fei
    Gao, Yuan
    Yin, Liangze
    FRONTIERS OF COMPUTER SCIENCE, 2018, 12 (02) : 264 - 279
  • [50] Efficient software product-line model checking using induction and a SAT solver
    Fei He
    Yuan Gao
    Liangze Yin
    Frontiers of Computer Science, 2018, 12 : 264 - 279