EFSM performable test sequence generating method based on predicate dependency graph
A test sequence and dependency graph technology, applied in software testing/debugging, etc., can solve problems such as inability to guarantee test data, inability to guarantee that candidate test sequences can be executed, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0038] In order to describe the present invention more specifically, the technical solutions of the present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments.
[0039] The method for generating a guided test sequence based on an executable analysis tree in the present invention fully takes into account the relationship between transitions, rather than searching blindly.
[0040] In this embodiment, first, the transition characteristics in the EFSM model are analyzed, and a predicate dependency graph of the EFSM model is constructed. image 3 Shows figure 2 Predicate dependency graph for the shown EFSM model.
[0041] A predicate dependency graph is represented by a tuple PDS, where PDS=. In this tuple, SN represents the set of nodes in the predicate dependency graph, and TN represents the set of edges in the predicate dependency graph. exist image 3 In , each node corresponds to a transition in the EFSM mod...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com