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
关键词
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 条
  • [1] Potential synergies of theorem proving and model checking for software product lines
    Thüm, Thomas
    Meinicke, Jens
    Benduhn, Fabian
    Hentschel, Martin
    Von Rhein, Alexander
    Saake, Gunter
    ACM International Conference Proceeding Series, 2014, 1 : 177 - 186
  • [2] Combination of Model Checking and Theorem Proving to Verify Embedded Software
    XIAO Jian-yu
    2. Institute of Laser and Information
    TheJournalofChinaUniversitiesofPostsandTelecommunications, 2005, (04) : 80 - 84
  • [3] Model checking software product lines with SNIP
    Andreas Classen
    Maxime Cordy
    Patrick Heymans
    Axel Legay
    Pierre-Yves Schobbens
    International Journal on Software Tools for Technology Transfer, 2012, 14 (5) : 589 - 612
  • [4] Modeling and model checking software product lines
    Gruler, Alexander
    Leucker, Martin
    Scheidemann, Kathrin
    FORMAL METHODS FOR OPEN OBJECT-BASED DISTRIBUTED SYSTEMS, PROCEEDINGS, 2008, 5051 : 113 - 131
  • [5] Symbolic Model Checking of Software Product Lines
    Classen, Andreas
    Heymans, Patrick
    Schobbens, Pierre-Yves
    Legay, Axel
    2011 33RD INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING (ICSE), 2011, : 321 - 330
  • [6] Combinations of model checking and theorem proving
    Uribe, TE
    FRONTIERS OF COMBINING SYSTEMS, 2000, 1794 : 151 - 170
  • [7] Development and verification of high confidence embedded software by combining model checking and theorem proving
    Xiao, Jian-Yu
    Zhang, De-Yun
    Chen, Hai-Quan
    Dong, Hao
    Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2005, 35 (05): : 531 - 536
  • [8] Model checking software product lines based on feature slicing
    Huang, Ming-Yu
    Liu, Yu-Mei
    INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2019, 18 (04) : 340 - 348
  • [9] Integrating model checking and theorem proving for relational reasoning
    Arkoudas, K
    Khurshid, S
    Marinov, D
    Rinard, M
    RELATIONAL AND KLEENE-ALGEBRAIC METHODS IN COMPUTER SCIENCE, 2003, 3051 : 21 - 33
  • [10] Divider circuit verification with model checking and theorem proving
    Kaivola, R
    Aagaard, MD
    THEOREM PROVING IN HIGHER ORDER LOGICS, PROCEEDINGS, 2000, 1869 : 338 - 355