Model Checking Reducing Redundant Search Paths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing model checking techniques, such as DPOR and DPOR-DS, face inefficiencies due to redundant searches when handling data in a concolic manner, leading to unnecessary searches and reduced verification effectiveness.
Innovation Solution
A model checking apparatus and method that exclude data already used in previous searches from the data set during re-searches based on dependence relations, using a re-search control unit to manage backtrack points and reduce redundant paths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If model checking is applied to verify systems and software, then verification reliability is improved, but memory and time consumption increase exponentially
Solution Approach 1:
The patent extracts and eliminates redundant search paths from the model checking process. By identifying and removing execution paths that do not contribute to verification results, the system reduces time consumption while maintaining verification reliability. This is achieved through analyzing dependence relations between transitions and excluding redundant paths from the search space.
Solution Approach 2:
The patent creates a universal data structure that stores information applicable to multiple transitions and execution paths. This data structure enables the system to efficiently manage and reuse verification information across different paths, reducing redundant computation and memory consumption while maintaining comprehensive verification coverage.
2Reliability
If model checking is applied to verify systems and software, then verification reliability is improved, but memory consumption increases exponentially
Solution Approach 1:
The patent extracts and eliminates redundant search paths from the model checking process. By identifying and removing execution paths that do not contribute to verification results, the system reduces memory consumption while maintaining verification reliability. This is achieved through analyzing dependence relations between transitions and excluding redundant paths from the search space.
Solution Approach 2:
The patent applies partial action by performing verification on only the necessary subset of execution paths rather than all possible paths. By identifying and verifying only the critical paths that affect verification results, the system reduces memory consumption while maintaining sufficient verification coverage for reliability.
3Productivity
If DPOR technique is used to prune redundant searches, then search efficiency is improved, but redundant searches still occur in concolic model checking
Solution Approach 1:
The patent changes the parameters used for identifying redundant paths by considering data set dependence relations between transitions. Instead of using only traditional dependence relations, the system incorporates data set changes to more accurately identify and eliminate redundant searches, thereby improving search efficiency and reducing redundant time consumption in concolic model checking.
Solution Approach 2:
The patent implements feedback mechanisms that use verification results and data set information to guide the search process. By analyzing how data sets change across transitions and using this information to prune the search space, the system continuously improves search efficiency and eliminates redundant searches through iterative refinement of the verification process.
Data Source
AI summary
A model checking apparatus able to reduce redundant search in a model checking is provided. The model checking apparatus is configured to: accept verification information representing a state transition model and a verification content; obtain an execution path by causing a transition in the state transition model; analyze, between transitions on the execution path, a dependence relation relating to data set determination processing for determining a data set being a set of representative values of data used in a transition with data use; perform a re-search using a data set in which data already used in a previous search in the transition is excluded from the data set obtained by the data set determination processing, when performing a re-search from a backtrack point based on the dependence relation relating to the data set determination processing; and provide a verification result of the verification content based on the search result.