A Logical Approach to Generating Test Plans

2016/12/13 by Tobias Morciniec, Morciniec, Tobias, Andreas Podelski +1
Computer Science · #FOS: Computer and information sciences #Software Engineering (cs.SE) #Software Engineering Research #Software Reliability and Analysis Research #Software Testing and Debugging Techniques

paper · pdf · doi:10.48550/arxiv.1612.04351

openalex publication_date 2016/12/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

During the execution of a test plan, a test manager may decide to drop a test case if its result can be inferred from already executed test cases. We show that it is possible to automatically generate a test plan to exploit the potential to justifiably drop a test case and thus reduce the number of test cases. Our approach uses Boolean formulas to model the mutual dependencies between test results. The algorithm to generate a test plan comes with the formal guarantee of optimality with regards to the inference of the result of a test case from already executed test cases.

Citations

• Structuring Functional Requirements of Control Systems to Facilitate Refinement-based Formalisation

Related

• Combining Dynamic Symbolic Execution, Machine Learning and Search-Based Testing to Automatically Generate Test Cases for Classes
• Generalized Coverage Criteria for Combinatorial Sequence Testing
• Chaining Test Cases for Reactive System Testing (extended version)
• Supplementary Material for the Information Sciences Paper: An Experimental Study of Hyper-Heuristic Selection and Acceptance Mechanism for Combinatorial t-way Test Suite Generation
• Flaky Test Sanitisation via On-the-Fly Assumption Inference for Tests with Network Dependencies