CN109656801B - Business flow test case automatic generation system based on path adaptive technology - Google Patents
Business flow test case automatic generation system based on path adaptive technology Download PDFInfo
- Publication number
- CN109656801B CN109656801B CN201710935810.XA CN201710935810A CN109656801B CN 109656801 B CN109656801 B CN 109656801B CN 201710935810 A CN201710935810 A CN 201710935810A CN 109656801 B CN109656801 B CN 109656801B
- Authority
- CN
- China
- Prior art keywords
- path
- state
- state transition
- node
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/3668—Software testing
- G06F11/3672—Test management
- G06F11/3684—Test management for test design, e.g. generating new test cases
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention relates to a service flow test case automatic generation system based on a path self-adaptive technology, which automatically generates an association relation between all nodes by utilizing an algorithm through inputting description of state conversion of every two nodes and automatically generates a covering flow chart and an accurate case set, and comprises the following steps: drawing a state transition diagram: abstracting a state transition diagram from the user requirement document; extracting a state transition matrix: appointing a conversion matrix according to the relationship, the action, the data and the subsequent result between every two states in the state conversion diagram; setting strong and weak paths: setting strong and weak paths for the paths in the state transition diagram according to a coverage strategy, and specifying the depth of the weak path; and (3) generating a state transition tree: the algorithm automatically generates a state transition tree; and generating a test case. The invention provides the function of automatically generating the use case, can generate specific test steps, corresponding test data and expected results according to the state conversion path without manual intervention, and greatly reduces the cost of manually compiling the use case.
Description
Technical Field
The invention relates to a software testing technology, in particular to a service flow test case automatic generation system based on a path self-adaptive technology.
Background
The software test is an important component in the software development process, and is an activity process for verifying and confirming software products (including staged products) throughout the whole software development life cycle, and aims to find various problems existing in the software products, namely inconsistency with user requirements and predefined, as soon as possible and carry out quality control on the software products. Generally, an independent product evaluation center is responsible for software testing, a test plan, a test scheme and a test specification are made strictly according to a software test flow, the test is implemented, test records are analyzed, and a test report is written according to a regression test condition.
The chinese intellectual property office disclosed a method and apparatus (201410003501.5) for generating a state transition test case in 2014, 3, 26. The method is mainly characterized in that a state transition table comprising each state existing in the system and state transition information is generated, and the state transition information is used for indicating whether the state can be converted or not; generating an N-Switch state transition tree according to the state transition table, and generating an effective state transition test path according to the N-Switch state transition tree; generating an invalid state transition test path according to the state transition table; and generating a state transition test case set through the effective state transition test path and the ineffective state transition test path.
Although the technology solves the problems of generating an N-Switch state transition tree and a state transition test case set according to a state transition table, the N-Switch state transition algorithm has the following problems to be solved:
1. when a plurality of same nodes exist in the same level of the state transition diagram, the node on the left has absolute advantage to continuously traverse the subsequent state, so that the generated state transition sequence is not rich enough;
2. when the state switching path needs to be fully covered, the N-Switch method needs complicated manual analysis to specify the 'depth' to complete the requirement of full coverage, and use case redundancy and design efficiency are not high.
3. All paths adopt the same coverage intensity, and the test strategy cannot be flexibly customized according to whether the path is a 'core path'. Therefore, the input-output ratio cannot be balanced, and a targeted high-strength test is performed.
The software testing process involves complex business data flow, and in the business data flow process, various factors such as roles, data, state changes, trigger conditions, whether loops exist in the process and the like are involved. In such a case, how to effectively cover all the business processes and the correctness of the associated functions becomes a problem which is difficult to overcome.
Disclosure of Invention
Aiming at the defects that the software test in the prior art cannot balance the input-output ratio and realize the targeted high-strength test, the invention aims to solve the problem of providing the service flow test case automatic generation system based on the path self-adaption technology, which sets different coverage strengths and depths aiming at the path in the state transition diagram and automatically identifies the traversal path of the state transition sequence.
In order to solve the technical problems, the invention adopts the technical scheme that:
the invention relates to a service flow test case automatic generation system based on a path self-adaptive technology, which automatically generates an incidence relation between all nodes by utilizing an algorithm through inputting description of state conversion of every two nodes and automatically generates a covering flow chart and an accurate case set, and comprises the following steps:
1) drawing a state transition diagram: abstracting a state transition diagram from the user requirement document;
2) extracting a state transition matrix: appointing a conversion matrix according to the relationship, the action, the data and the subsequent result between every two states in the state conversion diagram;
3) setting strong and weak paths: setting strong and weak paths for the paths in the state transition diagram according to a coverage strategy, and specifying the depth of the weak path;
4) and (3) generating a state transition tree: the algorithm automatically generates a state transition tree;
5) and generating a test case.
The coverage strategy adopts an optimized N-Switch state coverage algorithm, namely:
301) taking the initial state of the state transition diagram as the root of the tree, wherein the root is the first layer of the tree;
302) for nodes on any layer, if a plurality of nodes in the same state on the layer exist, the number of newly added sub-nodes under each node is calculated according to an equal proportion sharing principle, and then the newly added nodes are randomly selected from a sub-node set;
303) the following checks are made for each newly added node:
if the state corresponding to the newly added node is the ending state of the state transition diagram, identifying the node as a leaf node;
if the newly added node is in a non-terminal node state and appears in the same level or the previous level of the state transition tree, the node is identified as a leaf node, and the node is not newly added;
304) according to the configured depth, automatically judging the number of child node layers to be added under all leaf nodes in the non-terminal state after executing the steps 301) and 302) so as to determine the terminal non-leaf nodes of the traversal branches.
The coverage strategy adopts a full path coverage algorithm, namely:
311) taking the initial state of the state transition diagram as the root of the tree, wherein the root is the first layer of the tree;
312) for nodes on any layer, adding another node pointed by the directed edge from left to right as a child node of the node;
313) the following checks are made for each newly added node:
if the state corresponding to the newly added node is the ending state of the state transition diagram, identifying the node as a leaf node;
if the newly added node is in a non-terminal node state and the subsequent state transition has been passed under the same precursor path sequence, the node is identified as a leaf node in the same way and is not newly added with the node;
314) for full path coverage, when a state loop exists in a path, that is, an infinite loop path occurs by converting one state in the path back to a state that the previous path has occurred, the number of child node layers to be added in all non-terminating state leaf nodes is determined by configuring the depth to perform steps 311) and 312).
The coverage strategy simultaneously combines two coverage strategies according to the overall investment, quality and period requirements of the project, namely, covering the core process of the reinforced project by a full path, and covering the non-core process by the coverage strategy of the N-Switch so as to give consideration to both quality and efficiency, and specifically comprises the following steps:
321) taking the initial state of the state transition diagram as the root of the tree, wherein the root is the first layer of the tree;
322) for nodes on any layer:
if a plurality of nodes in the same state on the level exist, calculating the number of newly added sub-nodes under each node according to an equal proportion sharing principle, and then randomly selecting the newly added nodes from the sub-node set;
323) the following checks are made for each newly added node:
if the state corresponding to the newly added node is the ending state of the state transition diagram, identifying the node as a leaf node;
if the newly added node is in a non-terminal node state, judging whether a path pointing to the node is a strong path, if the path is the strong path and the subsequent state conversion has been carried out under the same precursor path sequence, similarly marking the node as a leaf node and not adding the newly added node to the node;
if the path is a weak path and the path is already present in the same level or the upper level of the state transition tree, the node is also identified as a leaf node, and no more nodes are added to the node.
The strong and weak paths set for the path in the state transition diagram are as follows:
the user inputs two nodes, states and actions of the two nodes are declared, and the path name of state conversion is completed.
Setting strong and weak paths in the state transition diagram as follows: defining the path as a strong edge or a weak edge.
The strong edge is: the path connecting the two states is a core path, and the edge which needs to be covered by the full path is designed in the case;
or, the weak edge is: the path connecting the two states is a non-core path, and only the edge covered by the N-Switch state is needed in case design.
Setting strong and weak paths in the state transition diagram as follows: when a user inputs data and an expected result, and a use case is automatically generated, the system automatically fills in test data and the expected result in corresponding states according to the input information of the user.
The automatic generation of the use case comprises the following steps:
the system automatically judges which of all states input by the user is the initial state;
traversing the initial state and unfolding the state path, and judging whether the state of the current path meets the end state condition one by one according to the strong and weak side information set by a user and an N-Switch algorithm, thereby forming a complete path;
according to the algorithm, after traversing all initial states and all paths in the initial states, the system collects all path information required by traversing the scene;
according to all the generated path information, the system automatically draws and generates a state conversion chart for requirement analysis, proofreading and review;
and the system automatically compiles and generates a corresponding test case according to the nodes passed by each path.
Setting strong and weak paths in the state transition diagram as follows: the user specifies the number of depth layers covered by the loop and the weak edge through the configuration file.
The invention has the following beneficial effects and advantages:
1. the invention optimizes the N-Switch algorithm and solves the following problems:
1) when a plurality of same nodes exist in the same level of the state transition diagram, sub-nodes are randomly selected by adopting an equal proportion sharing principle, so that the generated state transition sequence is richer;
2) when the state transition path needs to be fully covered, the system automatically judges that the depth is designated without complex manual analysis;
3) and flexibly customizing a test strategy according to whether the path is a core path.
2. The invention can realize the coverage of all state combinations by the full path coverage strategy to avoid omission, and can simultaneously use the full path coverage and the optimized flexible combination strategy of the N-Switch coverage in the design according to the strategy customized by the user, thereby successfully solving the problems of insufficient N-Switch coverage and overhigh full path coverage cost, and effectively improving the input-output ratio of the project by the conventional process testing method through strategy adjustment.
3. The invention provides the function of automatically generating the use case, can generate specific test steps, corresponding test data and expected results according to the state conversion path without manual intervention, and greatly reduces the cost of manually compiling the use case.
Drawings
FIG. 1 is a flow diagram of a test case design and generation system of the present invention;
FIG. 2 is a state transition diagram of the present invention;
FIG. 3 is a state transition matrix in the present invention;
FIG. 4 is a state transition tree in the present invention;
FIG. 5 is a final test case of the present invention;
fig. 6 is a diagram of state transition information input by a user in the present invention.
Detailed Description
The invention is further elucidated with reference to the accompanying drawings.
As shown in fig. 1, the system for automatically generating a service flow test case based on a path adaptive technique according to the present invention automatically generates an association relationship between all nodes by using an algorithm and automatically generates a coverage flow chart and an accurate case set by inputting descriptions of state transition of every two nodes, and includes the following steps:
1) drawing a state transition diagram: abstracting a state transition diagram from the user requirement document;
2) extracting a state transition matrix: appointing a conversion matrix according to the relationship, the action, the data and the subsequent result between every two states in the state conversion diagram;
3) setting strong and weak paths: setting strong and weak paths for the paths in the state transition diagram according to a coverage strategy, and specifying the depth of the weak path;
4) and (3) generating a state transition tree: the algorithm automatically generates a state transition tree;
5) and generating a test case.
In step 3), all paths are defined, and the user only needs to input the states of two nodes and the path name for completing state conversion. Strong edges (high strength coverage needed) and weak edges (low strength coverage) are specified. Meanwhile, a user can input data and an expected result, when a use case is automatically generated, the use case can provide corresponding test data and an expected result when the step is finished, the user can also specify the number of depth layers covered by a loop and a weak edge through a configuration file, and the steps are as follows:
the user declares the state, and the action (path) between two nodes;
defining the path as a 'strong edge' or a 'weak edge';
declaring data and expected results;
a configurable number of depth layers.
When the user declares the state conversion information, the precondition, the test data and the expected result when the state A is changed to the state B are filled, and when the system automatically generates a use case, the corresponding information is written into the generated test use case.
The invention provides two concepts of 'strong edge' and 'weak edge', wherein the strong edge refers to a path connecting two states as a core path and needs full path coverage during case design; the weak edge means that a path connecting the two states is a non-core path, and only the N-Switch state is needed to be covered when a use case is designed.
After two concepts of 'strong edge' and 'weak edge' are defined, the strong edge and the weak edge can be flexibly specified according to the actual needs of the project so as to improve the input-output ratio of the project.
The present invention provides three coverage strategies: firstly, the optimized N-Switch state covers a higher standard full path cover and simultaneously combines two coverage strategies under the same flow according to the special conditions and requirements of the project. The core flow of the reinforced project is covered by the full path, and the non-core flow is covered by the covering strategy of the N-Switch, so that the aim of giving consideration to both quality and efficiency is fulfilled.
For the coverage strategy (i), an optimized N-Switch state coverage algorithm is adopted, namely:
301) taking the initial state of the state transition diagram as the root of the tree, wherein the root is the first layer of the tree;
302) for nodes on any layer, if a plurality of nodes in the same state on the layer exist, the number of newly added sub-nodes under each node is calculated according to an equal proportion sharing principle, and then the newly added nodes are randomly selected from a sub-node set;
303) the following checks are made for each newly added node:
if the state corresponding to the newly added node is the ending state of the state transition diagram, identifying the node as a leaf node;
if the newly added node is in a non-terminal node state and appears in the same level or the previous level of the state transition tree, the node is identified as a leaf node, and the node is not newly added;
304) according to the configured depth, automatically judging the number of child node layers to be added under all leaf nodes in the non-terminal state after executing the steps 301) and 302) so as to determine the terminal non-leaf nodes of the traversal branches.
For the coverage strategy two, a higher standard full path coverage algorithm is adopted, namely:
311) taking the initial state of the state transition diagram as the root of the tree, wherein the root is the first layer of the tree;
312) for nodes on any layer, adding another node pointed by the directed edge from left to right as a child node of the node;
313) the following checks are made for each newly added node:
if the state corresponding to the newly added node is the ending state of the state transition diagram, identifying the node as a leaf node;
if the newly added node is in a non-terminal node state and the subsequent state transition has been passed under the same precursor path sequence, the node is identified as a leaf node in the same way and is not newly added with the node;
314) for full path coverage, after a state loop condition (as identified in the figure) exists in the flowchart shown in fig. 1, that is, a certain state in a path can be converted back to a state in which a previous path has appeared, so that an infinite loop path appears, and therefore, it is necessary to determine to execute steps 311) and 312 by configuring a depth, the number of child node layers needs to be increased under all leaf nodes in a non-terminating state. For the coverage strategy III, two coverage strategies are simultaneously combined according to the special conditions and requirements of the project, namely, the core flow of the reinforced project is covered by the full path, and the non-core flow is covered by the coverage strategy of the N-Switch, so as to take quality and efficiency into consideration, and the method specifically comprises the following steps:
321) taking the initial state of the state transition diagram as the root of the tree, wherein the root is the first layer of the tree;
322) for nodes on any layer:
if a plurality of nodes in the same state on the level exist, calculating the number of newly added sub-nodes under each node according to an equal proportion sharing principle, and then randomly selecting the newly added nodes from the sub-node set;
323) the following checks are made for each newly added node:
if the state corresponding to the newly added node is the ending state of the state transition diagram, identifying the node as a leaf node;
if the newly added node is in a non-terminal node state, judging whether a path pointing to the node is a strong path, if the path is the strong path and the subsequent state conversion under the same precursor path sequence has been carried out, identifying the node as a leaf node in the same way, and not adding the node to the leaf node any more;
if the path is a weak path and the path is already present in the same level or the upper level of the state transition tree, the node is also identified as a leaf node, and no more nodes are added to the node.
In step 4), the algorithm automatically generates a state transition tree as shown in fig. 2 to 4, the system automatically analyzes the relationship between the nodes according to the user input, and combs out the state transition tree meeting the user coverage policy in a self-adaptive manner, and the user can complete the inspection and the audit according to the state transition tree generated by the system. All state and action names are labeled in FIG. 6, along with strong and weak edge definitions.
As shown in fig. 4, the flow chart is labeled with a start node and a next node, and is labeled with an action (path) name 3 and a strong edge.
The present invention provides the function of automatically generating use cases, and after the user inputs the state conversion information (fig. 6) in the foreground page, the system has collected all the information (test data, expected results, etc.) required for generating use cases. The background system analyzes the expansion data by the following steps:
A. the system automatically judges which of all states input by the user is the initial state;
B. traversing the initial state, expanding the state path and traversing, and judging whether the state of the current path meets the end state condition one by one according to user setting (strong and weak side information) and an N-Switch algorithm, thereby forming a complete path;
C. according to the above algorithm, after traversing all the initial states and all the paths in the initial states, the system has collected all the path information required for traversing the scene;
D. according to all the generated path information, the system automatically draws and generates a state conversion chart (figure 4) for requirement analysis proofreading and review;
E. meanwhile, the system automatically compiles and generates a corresponding test case according to the nodes passed by each path (fig. 5).
Therefore, the user only needs to input the state transition information (fig. 6), and the system automatically generates the corresponding test case. Therefore, the purpose of generating a specific test case according to the path information of the state conversion without manual intervention is achieved, and the cost of manually compiling the case is greatly reduced.
The display page of the system for automatically generating use cases as shown in fig. 5 contains the step sequence, the operation content, the test data and the expected result.
In step a, the system automatically determines which of all the states input by the user are initial states: the system will traverse the user's input states (fig. 6), and when a state is not reached by any one, the system determines that the state is the starting state of the entire process.
In step B, the N-Switch algorithm was proposed by TSUN S.CHOW in 1978, who defined N-Switch as a sequence of consecutive edges or arcs (usually representing loops in a state diagram) of length N +1 in a program diagram.
And D, automatically drawing and generating a state conversion chart by the system, namely merging the nodes of the same path, marking the state information and the strong and weak side information, and finally outputting the state conversion chart to a front-end page in an HTML format.
And 4, automatically compiling and generating a corresponding test case, wherein the test case comprises a state conversion case template, and a test case is correspondingly generated by one conversion path. Each state transition in the path is described in a use case step, and corresponding test data and expected results are added to each step according to user input information (fig. 5).
Claims (5)
1. A service flow test case automatic generation system based on a path adaptive technology is characterized in that: by inputting the description of state transition of every two nodes, the incidence relation between all the nodes is automatically generated by utilizing an algorithm, and a covering flow chart and an accurate use case set are automatically generated, and the method comprises the following steps:
1) drawing a state transition diagram: abstracting a state transition diagram from the user requirement document;
2) extracting a state transition matrix: appointing a conversion matrix according to the relationship, the action, the data and the subsequent result between every two states in the state conversion diagram;
3) setting strong and weak paths: setting strong and weak paths for the paths in the state transition diagram according to a coverage strategy, and specifying the depth of the weak path;
4) and (3) generating a state transition tree: the algorithm automatically generates a state transition tree;
5) generating a test case;
the coverage strategy simultaneously combines two coverage strategies according to the overall investment, quality and period requirements of the project, namely, covering the core process of the reinforced project by a full path, and covering the non-core process by the coverage strategy of the N-Switch so as to give consideration to both quality and efficiency, and specifically comprises the following steps:
321) taking the initial state of the state transition diagram as the root of the tree, wherein the root is the first layer of the tree;
322) for nodes on any layer:
if a plurality of nodes in the same state on the level exist, calculating the number of newly added sub-nodes under each node according to an equal proportion sharing principle, and then randomly selecting the newly added nodes from the sub-node set;
323) the following checks are made for each newly added node:
if the state corresponding to the newly added node is the ending state of the state transition diagram, identifying the node as a leaf node;
if the newly added node is in a non-terminal node state, judging whether a path pointing to the node is a strong path, if the path is the strong path and the subsequent state conversion under the same precursor path sequence has been carried out, identifying the node as a leaf node in the same way, and not adding the node to the leaf node any more;
if the path is a weak path and the path appears in the same level or the upper level of the state transition tree, the node is also identified as a leaf node, and no node is added to the leaf node;
the strong and weak paths set for the path in the state transition diagram are as follows: defining the path to be a strong edge or a weak edge;
the strong edge is: the path connecting the two states is a core path, and the edge which needs to be covered by the full path is designed in the case;
or, the weak edge is: the path connecting the two states is a non-core path, and only the edge covered by the N-Switch state is needed in case design.
2. The system for automatically generating the service flow test case based on the path adaptive technology as claimed in claim 1, wherein the strong and weak paths set for the path in the state transition diagram are:
the user inputs two nodes, states and actions of the two nodes are declared, and the path name of state conversion is completed.
3. The system for automatically generating the service flow test case based on the path adaptive technology as claimed in claim 1, wherein the strong and weak paths are set in the state transition diagram as follows: when a user inputs data and an expected result, and a use case is automatically generated, the system automatically fills in test data and the expected result in corresponding states according to the input information of the user.
4. The system for automatically generating a service flow test case based on a path adaptive technology as claimed in claim 3, wherein the automatically generating a case comprises the steps of:
the system automatically judges which of all states input by the user is the initial state;
expanding state path traversal based on the initial state, and judging whether the state of the current path meets the condition of the terminal state one by one according to the strong and weak side information set by a user, a full path coverage strategy and a coverage strategy of the N-Switch, thereby forming a complete path;
according to the full path coverage strategy and the coverage strategy of the N-Switch, after traversing all the initial states and all the paths in the initial states, the system collects all the path information required in the traversing state transition diagram;
according to all the generated path information, the system automatically draws and generates a state conversion chart for requirement analysis, proofreading and review;
and the system automatically compiles and generates a corresponding test case according to the nodes passed by each path.
5. The system for automatically generating the service flow test case based on the path adaptive technology as claimed in claim 1, wherein the strong and weak paths are set in the state transition diagram as follows: the user specifies the number of depth layers covered by the loop and the weak edge through the configuration file.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710935810.XA CN109656801B (en) | 2017-10-10 | 2017-10-10 | Business flow test case automatic generation system based on path adaptive technology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710935810.XA CN109656801B (en) | 2017-10-10 | 2017-10-10 | Business flow test case automatic generation system based on path adaptive technology |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109656801A CN109656801A (en) | 2019-04-19 |
| CN109656801B true CN109656801B (en) | 2022-05-13 |
Family
ID=66109477
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710935810.XA Active CN109656801B (en) | 2017-10-10 | 2017-10-10 | Business flow test case automatic generation system based on path adaptive technology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109656801B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111723008B (en) * | 2020-05-29 | 2024-06-11 | 北京机电工程研究所 | Test path generation method based on state transition diagram |
| CN112256591A (en) * | 2020-11-12 | 2021-01-22 | 北京联创信安科技股份有限公司 | Test case generation method and device, test equipment and storage medium |
| CN113011484B (en) * | 2021-03-12 | 2023-12-26 | 大商所飞泰测试技术有限公司 | Graphical demand analysis and test case generation method based on classification tree and judgment tree |
| CN113190438A (en) * | 2021-04-22 | 2021-07-30 | 大商所飞泰测试技术有限公司 | Graphical demand analysis and test case intelligent generation method based on business flow graph |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102854877A (en) * | 2012-10-12 | 2013-01-02 | 山东省科学院自动化研究所 | Function test system and test method of automobile body control module |
| CN103678138A (en) * | 2014-01-03 | 2014-03-26 | 北京经纬恒润科技有限公司 | Method and device for generating state conversion test samples |
| CN106681915A (en) * | 2016-12-19 | 2017-05-17 | 成都康赛信息技术有限公司 | Software function test case design method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5107131B2 (en) * | 2008-04-28 | 2012-12-26 | 株式会社東芝 | Test case generation device, generation method thereof, and program for test case generation |
-
2017
- 2017-10-10 CN CN201710935810.XA patent/CN109656801B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102854877A (en) * | 2012-10-12 | 2013-01-02 | 山东省科学院自动化研究所 | Function test system and test method of automobile body control module |
| CN103678138A (en) * | 2014-01-03 | 2014-03-26 | 北京经纬恒润科技有限公司 | Method and device for generating state conversion test samples |
| CN106681915A (en) * | 2016-12-19 | 2017-05-17 | 成都康赛信息技术有限公司 | Software function test case design method |
Non-Patent Citations (1)
| Title |
|---|
| 基于UML statecharts测试方法的研究;占学德;《中国博士学位论文全文数据库 信息科技辑》;20070115;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109656801A (en) | 2019-04-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109656801B (en) | Business flow test case automatic generation system based on path adaptive technology | |
| CN110909039A (en) | Big data mining tool and method based on drag type process | |
| CN108959068A (en) | Software interface testing method, device and storage medium | |
| CN103218692B (en) | Workflow mining method based on dependence analysis between activity | |
| CN109426516A (en) | Software version management method and device | |
| CN101645036B (en) | Method for automatically distributing test tasks based on capability level of test executor | |
| US9594543B2 (en) | Activity diagram model-based system behavior simulation method | |
| CN103345446B (en) | A kind of automated testing method being applicable to remote control series products | |
| CN104679488A (en) | Flow path customized development platform and method | |
| CN106503872B (en) | A kind of business process system construction method based on basic business active set | |
| CN103713933B (en) | Focus function, the assemblage method of variable, apparatus and system in computer program | |
| CN106021816A (en) | Method for achieving distributed system behavior simulated analysis tool based on behavior tree | |
| CN105677306A (en) | Automation script compiling method and device | |
| CN110532021A (en) | The processing method and processing device of the configuration file of dcs | |
| CN101634966B (en) | Method for carrying out automatic fault mode and influence analysis of software process | |
| Mendling et al. | Yet another event-driven process chain | |
| CN115934097A (en) | Method, device, storage medium and electronic device for generating executable statement | |
| CN106096159A (en) | Distributed system behavior simulation under a kind of cloud platform analyzes the implementation method of system | |
| CN103400050A (en) | Multiple-user cooperative nuclear reactor risk determining method and system | |
| CN117311798A (en) | RPA flow generation system and method based on large language model | |
| CN103941627B (en) | Conversion methods of the SFC to ladder diagram in a kind of programming based on PLC | |
| CN106919374A (en) | A kind of scenario generation method and device | |
| CN106776689A (en) | A kind of host information querying method, device and main frame | |
| CN112181399A (en) | Method for generating front-end code based on data analysis construction model | |
| CN110413518A (en) | The generation method and generating means and computer readable storage medium of control object library |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20220228 Address after: No. 178, Huanghai Avenue, Dalian Economic and Technological Development Zone, Liaoning, 116600 Applicant after: Dashangsuo Feitai Testing Technology Co.,Ltd. Address before: 116019 48F, futures building, 129 Convention and Exhibition Road, Shahekou District, Dalian City, Liaoning Province Applicant before: DALIAN FUTURES INFORMATION TECHNOLOGY Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |