Optimal Test Suite Generation for Modified Condition Decision Coverage Using SAT Solving

被引:5
|
作者
Kitamura, Takashi [1 ]
Maissonneuve, Quentin [1 ,2 ]
Choi, Eun-Hye [1 ]
Artho, Cyrille [3 ]
Gargantini, Angelo [4 ]
机构
[1] Natl Inst Adv Ind Sci & Technol, Osaka, Japan
[2] Univ Nantes, Nantes, France
[3] KTH Royal Inst Technol, Stockholm, Sweden
[4] Univ Bergamo, Bergamo, Italy
关键词
REDUCTION;
D O I
10.1007/978-3-319-99130-6_9
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Boolean expressions occur frequently in descriptions of computer systems, but they tend to be complex and error-prone in complex systems. The modified condition decision coverage (MCDC) criterion in system testing is an important testing technique for Boolean expression, as its usage mandated by safety standards such as DO-178 [1] (avionics) and ISO26262 [2] (automotive). In this paper, we develop an algorithm to generate optimal MCDC test suites for Boolean expressions. Our algorithm is based on SAT solving and generates minimal MCDC test suites. Experiments on a real-world avionics system confirm that the technique can construct minimal MCDC test suites within reasonable times, and improves significantly upon prior techniques.
引用
收藏
页码:123 / 138
页数:16
相关论文
共 50 条
  • [41] Artificial bee colony algorithm in data flow testing for optimal test suite generation
    Snehlata Sheoran
    Neetu Mittal
    Alexander Gelbukh
    International Journal of System Assurance Engineering and Management, 2020, 11 : 340 - 349
  • [42] Using mutual information to test from Finite State Machines: Test suite generation?,??
    Ibias, Alfredo
    JOURNAL OF SYSTEMS AND SOFTWARE, 2022, 192
  • [43] Test Suite Generation using Memetic Algorithm on Adaptive Local Search
    Mundade, Ankita A.
    Pattewar, T. M.
    2015 INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND SIGNAL PROCESSING (ICCSP), 2015, : 630 - 633
  • [44] Multifaceted Test Suite Generation Using Primary and Supporting Fitness Functions
    Gay, Gregory
    PROCEEDINGS 2018 IEEE/ACM 11TH INTERNATIONAL WORKSHOP ON SEARCH-BASED SOFTWARE TESTING (SBST), 2018, : 2 - 5
  • [45] Path Constraint Solving based Test Generation for Observability-enhanced Branch Coverage
    Zhou, Yanhong
    Li, Huawei
    Wang, Tiancheng
    Liu, Bo
    Gao, Yingke
    Li, Xiaowei
    2016 IEEE 34TH VLSI TEST SYMPOSIUM (VTS), 2016,
  • [46] Generation of Time and Energy Optimal Coverage Motion for Industrial Machines Using a Modified S-Curve Trajectory
    Halinga, Mathias Sebastian
    Nyobuya, Haryson Johanes
    Uchiyama, Naoki
    2023 IEEE/SICE INTERNATIONAL SYMPOSIUM ON SYSTEM INTEGRATION, SII, 2023,
  • [47] Towards Complete Fault Coverage by Test Point Insertion using Optimization-SAT Techniques
    Eggersgluess, Stephan
    2019 IEEE INTERNATIONAL TEST CONFERENCE IN ASIA (ITC-ASIA 2019), 2019, : 67 - 72
  • [48] Towards Complete Fault Coverage by Test Point Insertion using Optimization-SAT Techniques
    Eggersgluess, Stephan
    2019 IEEE INTERNATIONAL TEST CONFERENCE (ITC), 2019,
  • [49] J3 Model: A novel framework for improved Modified Condition/Decision Coverage analysis
    Godboley, Sangharatna
    Dutta, Arpita
    Mohapatra, Durga Prasad
    Mall, Rajib
    COMPUTER STANDARDS & INTERFACES, 2017, 50 : 1 - 17
  • [50] Towards Automatic Generation of Test Data using Branch Coverage
    Chen, Jifeng
    Yang, Luming
    ICCSSE 2009: PROCEEDINGS OF 2009 4TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION, 2009, : 921 - 925