CN117312167A - Automatic test method and system for low-code platform - Google Patents
Automatic test method and system for low-code platform Download PDFInfo
- Publication number
- CN117312167A CN117312167A CN202311382416.XA CN202311382416A CN117312167A CN 117312167 A CN117312167 A CN 117312167A CN 202311382416 A CN202311382416 A CN 202311382416A CN 117312167 A CN117312167 A CN 117312167A
- Authority
- CN
- China
- Prior art keywords
- node
- test
- graph
- low
- test case
- 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.)
- Pending
Links
- 238000010998 test method Methods 0.000 title claims abstract description 14
- 238000012360 testing method Methods 0.000 claims abstract description 119
- 238000002372 labelling Methods 0.000 claims abstract description 17
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 14
- 238000004458 analytical method Methods 0.000 claims abstract description 11
- 238000013100 final test Methods 0.000 claims abstract description 9
- 238000012216 screening Methods 0.000 claims abstract description 7
- 238000004590 computer program Methods 0.000 claims description 12
- 238000012800 visualization Methods 0.000 claims description 8
- 238000004364 calculation method Methods 0.000 claims description 5
- 238000001514 detection method Methods 0.000 claims description 5
- 230000000007 visual effect Effects 0.000 claims description 4
- 238000001914 filtration Methods 0.000 claims description 3
- 238000000034 method Methods 0.000 abstract description 12
- 238000011161 development Methods 0.000 abstract description 11
- 238000012545 processing Methods 0.000 description 6
- 230000009466 transformation Effects 0.000 description 4
- 238000013461 design Methods 0.000 description 3
- 230000002159 abnormal effect Effects 0.000 description 2
- 238000012827 research and development Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
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/3676—Test management for coverage analysis
-
- 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
-
- 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/3688—Test management for test execution, e.g. scheduling of test suites
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
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 discloses an automatic test method and system for a low-code platform, wherein the method comprises the following steps: s1: identifying a node set and an edge set of the graph according to the application program code; s2: constructing a program component node execution directed graph of the whole application system according to the node set and the edge set; s3: calculating a path set of the directed graph based on the algorithm of the graph, automatically removing the duplication, and outputting a test case set; s4: carrying out demand association, screening, classification and labeling on the test case set to obtain a final test case set; s5: and automatically executing the test case set, analyzing the test result, and finally visually displaying according to the analysis result. The method and the device can be better applied to program testing in a low-code development mode, realize automatic generation of test cases with higher program code coverage rate, and improve the testing efficiency of software.
Description
Technical Field
The invention relates to the technical field of application testing, in particular to an automatic testing method and system for a low-code platform.
Background
The low code is translated from the LowCode first proposed by forest in 2014 and 6, which means that the design and development of the application program can be completed quickly without coding or by a small amount of code. The low code development platform is driven by a graphical and visual interface to drag components and models, etc.
With the continuous progress of informatization, digital transformation is not possible. In order to accelerate the digitalized transformation speed of enterprises and meet the high-speed development of the businesses, enable the integration of the business technology and reduce the development work of low-value repeatability, focus more on and meet the agile innovation of the businesses, a low-code development platform becomes an important means for a plurality of enterprises in digitalized transformation upgrading. The logic transaction is performed by adopting a low-code mode of 'component + flow configuration', which becomes a more common full-flow visual development mode. The mode completes business logic and process construction in a dragging component and parameter configuration mode through the graphical interface, so that operation and maintenance cost can be effectively reduced, and product innovation efficiency can be improved.
The low-code development platform can effectively reduce the software development threshold, and assist research and development personnel to rapidly respond to the demand to finish product online, so that the quality of application codes of the whole system is possibly unstable, challenges are brought to system testing, and high-efficiency testing pressure is brought to a testing team. The traditional test mode or the currently mainstream automatic test tool cannot respond to the characteristics of rapidness, uniformity, simplicity and the like in the low-code development mode well.
Disclosure of Invention
The invention aims to provide an automatic test method and system for a low-code platform, which are used for solving the technical problem of how to improve the software test efficiency.
The invention is realized by adopting the following technical scheme: an automatic test method for a low-code platform comprises the following steps:
s1: identifying a node set and an edge set of the graph according to the application program code;
s2: constructing a program component node execution directed graph of the whole application system according to the node set and the edge set;
s3: calculating a path set of the directed graph based on the algorithm of the graph, automatically removing the duplication, and outputting a test case set;
s4: carrying out demand association, screening, classification and labeling on the test case set to obtain a final test case set;
s5: and automatically executing the test case set, analyzing the test result, and finally visually displaying according to the analysis result.
Further, step S1 is: the node set and the edge set of the graph are identified according to the application program code developed by the low-code platform, and specifically comprise the following sub-steps:
s11: taking each operation component in the application program as a node for drawing, wherein the input parameter and the output parameter of each operation component are attribute information of the node, and all the nodes form a node set which comprises a starting node and an ending node;
s12: according to the execution sequence of the operation components, the connected two component relations are generalized into one directed edge of two nodes in the graph;
s13: repeating the steps to obtain a node set and an edge set of the whole application program.
Further, step S2 includes the following sub-steps:
s21: constructing a directed graph according to the node set and the edge set;
s22: judging whether the directed graph has a ring or not by adopting a topology ordering detection method;
s23: if the directed graph has a ring, adjusting the edge set of the directed graph so as to obtain a directed acyclic graph; if the directed graph is loop-free, step S3 is directly performed.
Further, step S22 specifically includes: taking out a node with the ingress degree of 0 from the directed ring graph each time, deleting the node and all edges taking the node as a starting point, and if the directed graph is finally empty, proving no ring; if the final directed graph is not empty, then loops are demonstrated.
Further, the step S3 specifically includes: and calculating all paths between the starting node and the ending node according to the depth-first traversal algorithm and the breadth-first traversal algorithm of the graph, and simultaneously calculating a critical path, a longest path and a shortest path of the directed graph to obtain a path set covering all the nodes.
Further, step S4 includes the following sub-steps:
s41: filtering invalid paths according to service requirements;
s42: and carrying out association and classification labeling on the test cases according to the service requirements to obtain a final test case set, wherein the classification labeling comprises grade labeling and/or labeling.
Further, the step S5 specifically includes: and automatically executing all test case sets, comparing according to expected result values and execution result values of the test cases to obtain the passing condition of each test case, calculating the test passing rate of each requirement according to the corresponding relation between the requirements and the test cases, and finally visually displaying the execution results and the test passing rate data of the test cases.
An automatic test system facing to a low-code platform comprises a demand management module, a calculation module, an execution module and a visualization module, wherein,
the demand management module is used for inputting and storing product information to be tested;
the computing module is used for identifying a node set and an edge set of the graph according to the application program codes, constructing a program component node execution directed graph of the whole application system according to the node set and the edge set, then computing a path set of the directed graph based on an algorithm of the graph, automatically removing duplication and outputting a test case set;
the execution module is used for carrying out demand association, screening, classification and labeling on the test case set to obtain a final test case set, automatically executing the test case set and carrying out test result analysis;
and the visualization module is used for performing visual display according to the analysis result.
A computer program product comprising a computer program which, when executed by a processor, implements a low code platform oriented automated test method as described above.
A computer readable storage medium storing a computer program which, when executed by a processor, implements a low code platform oriented automated test method as described above.
The invention has the beneficial effects that:
1. aiming at a system with complex transaction logic, the invention can effectively and rapidly design the test case set covering the whole application system component node, and can effectively provide test coverage rate and test efficiency.
2. The method and the device can be better applied to program testing in a low-code development mode, realize automatic generation of test cases with higher program code coverage rate, and improve the testing efficiency of software.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to the structures shown in these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a block diagram of a system of the present invention;
FIG. 3 is a flow chart of a portion of a program component;
FIG. 4 is a directed graph of the transformed FIG. 3.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. The components of the embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further definition or explanation thereof is necessary in the following figures.
Some embodiments of the present invention are described in detail below with reference to the accompanying drawings. The following embodiments and features of the embodiments may be combined with each other without conflict.
Examples
Referring to fig. 1, an automated test method for a low code platform includes the steps of:
step one, node sets and edge sets of the graph are identified according to application program codes developed by the low-code platform. The method comprises the following steps: in a flow chart mode program developed by a low-code platform, each operation component is regarded as a node of a chart, the input parameters and the output parameters of the component are attribute information of the node, and a node set comprises a start node and an end node. Meanwhile, according to the component execution sequence, the connected two component relations are generalized into one directed edge of two nodes in the graph, and according to the method, the node set and the edge set of the whole application system are generalized and arranged.
And step two, constructing a program component node execution directed graph of the whole application system according to the node set and the edge set. The method comprises the following steps: in actual program development, the program is likely to have loop logic. Therefore, the graph constructed from the node set and the edge set at this time will be a directed ring graph. The solution is to use topology order detection method, etc., namely, each time delete a node with 0 degree of entry from the directed graph, delete the node and all sides starting from the node, if the final graph is empty, prove loop-free, and if the final graph is not empty, prove loop-free. And according to the result of the topological order detection, if the directed graph has a ring, adjusting the edge set of the graph so as to obtain a final directed acyclic graph. If the graph does not have loops, the next step is directly performed.
And thirdly, calculating a path set based on an algorithm of the graph, automatically removing the duplication, and outputting a test case set. The method comprises the following steps: and calculating all paths between the starting node and the ending node according to the depth-first traversal algorithm and the breadth-first traversal algorithm of the graph, and simultaneously calculating a key path, a longest path and a shortest path of the graph to obtain a path set covering all the nodes.
And step four, carrying out demand association, screening, classification and labeling on the test case set to obtain a final test case set. The method comprises the following steps: after the path set is automatically de-duplicated, invalid paths are manually filtered according to service requirements, and the test cases are associated and classified according to the service requirements, for example, the test cases can be classified into four grades, namely ' extra high ', ' medium ', low and the like ', and labels such as ' abnormal test ' or ' inclusion regression test ' can be marked on the test cases. Thus, the subsequent analysis of the test result and the iterative regression test can be effectively assisted. After these steps, the final test case set is obtained.
And fifthly, automatically executing the test case set, analyzing the test result, and finally visually displaying according to the execution result. The method comprises the steps of automatically executing all test case sets, comparing expected result values and execution result values of the test cases to obtain passing conditions of each test case, calculating test passing rate of each requirement according to corresponding relation between the requirements and the test cases, finally visually displaying data such as test case execution results and the test passing rate, assisting test personnel in analyzing the test conditions such as test coverage rate and test efficiency, and simultaneously facilitating research and development personnel to quickly locate problems and optimize programs.
Referring to fig. 2, an automated test system for a low code platform includes a demand management module, a calculation module, an execution module, and a visualization module, wherein,
the demand management module is used for inputting and storing product information to be tested, particularly, according to product demands, the demand is subdivided and input into the system and stored, and the demand information comprises attributes such as function names, service rule demand grades, developers, testers, demand priorities and the like;
the computing module mainly comprises three aspects of data processing, path computing and path deduplication, wherein the data processing is used for identifying a node set and an edge set of the graph according to application program codes, and constructing a program component node execution directed graph of the whole application system according to the node set and the edge set. The graph is a structure for representing entities and relationships thereof, and is denoted as G (V, E), and is composed of two sets, one set of nodes and one set of edges. In the edge set, one edge connects a pair of nodes and indicates that there is a relationship between the two nodes. The relationship may be undirected or directed. In the present invention, a node refers to each component in a program, and an edge refers to an execution sequence of two component nodes, and is directed, as shown in fig. 3: to simulate part of the program component flow, fig. 4 is a directed graph after transformation according to rules, as can be seen from fig. 4, v= (1,2,3,4,5,6,7,9); e= ((1, 2), (2, 3), (3, 4), (3, 6), (4, 9), (4, 5), (6, 7), (6, 8), (5, 9), (7, 9), (8, 9)). In the program implementation, one node and one side in the graph are packaged and represented by using an object in an automatic test program, the attribute of the node object comprises a node serial number, a node name, an input parameter set and an output parameter set, and the object attribute is packaged by using a JSON format. The attribute of the edge object comprises a source node serial number, a source node output value and a destination node serial number, and finally the attribute dimension information of each flow node in the flow is organized and formed. In the invention, the reading of the graph data JSON format file is supported, the FLW file input into the low-code platform development program is supported, and the node set and the edge set of the graph are automatically identified.
And path calculation, namely rendering and displaying the graph through a visualization module according to the node set and the edge set obtained after the data processing module, so that a tester can be helped to know the program complexity of the whole system preliminarily and intuitively, and the evaluation and test workload and the like are assisted. And (5) ring detection. In actual program development, the program is likely to have loop logic. Therefore, the graph rendered at this time will be a directed loop graph, and the loops in the directed loop graph will affect the path computation of the road graph. The ring can be detected by adopting topological ordering, namely, a node with an ingress degree of 0 is taken out from the directed graph each time, the node and all edges starting from the node are deleted, if the final graph is empty, the ring is proved to be loop-free, and if the final graph is not empty, the ring is proved to be loop-free. The ring may also perform DFS on the graph by employing DFS traversal checking, and the path of the DFS may then generate a tree. For nodes on the DFS tree, if there are edges pointing to an ancestor or edges pointing to itself, then the graph has a ring or loop. For ring processing, manual adjustment or automatic processing by a selection system can be realized, and two processing modes are set for the system. The first is to directly remove the edge that caused the loop, i.e., the edge that points to the ancestor or the edge that points to itself. The second is to limit the number of loops when calculating the path, the loop test can be set to 1 or a suitable threshold. The algorithm for calculating all paths between two points of the directed graph is a common graph theory algorithm, which can find all paths from the start point to the end point and record the paths. The core idea is to traverse the entire graph using either a depth-first search or a breadth-first search. For the directed graph, since the directed graph can be searched along the directed graph, all the direction information needs to be recorded in the traversal process, and when the destination is searched, the found path is returned and stored.
And path deduplication, wherein an executable path set is obtained in the path calculation module, only one path is reserved for the same path, and a test case set is obtained according to the input parameters, the output parameters and the attribute information of the edges of the nodes on each path set. Each test case data includes an input parameter set and an expected output parameter set.
The execution module is mainly divided into several aspects of demand association, test case screening, test case classification, test case labeling, execution test case and test result analysis, wherein,
the requirement association supports an inter-association function between the test cases and the requirements, one test case can only associate one requirement at the same time, and one requirement can associate a plurality of test cases at the same time.
Test case filtering is supported to filter test cases that are invalid or unlikely to occur.
The test case classification supports the classification of different grades of test cases, including 'extra-high', 'medium', low and the like. The auxiliary tester performs important analysis on important test cases in the analysis of test results.
Labeling test cases, namely labeling the test cases with labels such as 'abnormal test' or 'inclusion regression test', so as to assist subsequent iterative regression test or regression test.
Executing test cases, automatically executing all test case sets, and comparing according to expected result values and execution result values of the test cases to obtain the passing condition of each test case
And analyzing test results, and calculating related indexes such as test passing rate, code coverage rate and the like of each requirement.
And the visualization module is used for drawing a graph by adopting a graphviz library, the execution path of each test case can be shown in the graph through the execution result data of the test case, the nodes and edges passing through the visualization module are green, the components encountering errors or at the middle end are represented by red lines, and in addition, the graph display is supported by the test passing rate and the code coverage rate of the whole system.
The invention also provides a computer program product, which comprises a computer program, and when the computer program is executed by a processor, the automatic test method facing the low-code platform is realized.
The invention also provides a computer readable storage medium, wherein the storage medium stores a computer program, and the computer program realizes the automatic test method facing the low-code platform when being executed by a processor.
Based on the above embodiments, the present invention has at least the following technical effects:
1. aiming at a system with complex transaction logic, the invention can effectively and rapidly design the test case set covering the whole application system component node, and can effectively provide test coverage rate and test efficiency.
2. The method and the device can be better applied to program testing in a low-code development mode, realize automatic generation of test cases with higher program code coverage rate, and improve the testing efficiency of software.
For the foregoing embodiments, for simplicity of explanation, the same is shown as a series of acts, but it should be understood by those skilled in the art that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently in accordance with the application. Further, those skilled in the art will also appreciate that the embodiments described in the specification are presently preferred embodiments, and that the acts referred to are not necessarily required for the present application.
In the above embodiments, the basic principle and main features of the present invention and advantages of the present invention are described. It will be appreciated by persons skilled in the art that the present invention is not limited by the foregoing embodiments, but rather is shown and described in what is considered to be illustrative of the principles of the invention, and that modifications and changes can be made by those skilled in the art without departing from the spirit and scope of the invention, and therefore, is within the scope of the appended claims.
Claims (10)
1. An automated test method for a low-code platform is characterized by comprising the following steps:
s1: identifying a node set and an edge set of the graph according to the application program code;
s2: constructing a program component node execution directed graph of the whole application system according to the node set and the edge set;
s3: calculating a path set of the directed graph based on the algorithm of the graph, automatically removing the duplication, and outputting a test case set;
s4: carrying out demand association, screening, classification and labeling on the test case set to obtain a final test case set;
s5: and automatically executing the test case set, analyzing the test result, and finally visually displaying according to the analysis result.
2. The automated testing method for a low-code platform according to claim 1, wherein step S1 is: the node set and the edge set of the graph are identified according to the application program code developed by the low-code platform, and specifically comprise the following sub-steps:
s11: taking each operation component in the application program as a node for drawing, wherein the input parameter and the output parameter of each operation component are attribute information of the node, and all the nodes form a node set which comprises a starting node and an ending node;
s12: according to the execution sequence of the operation components, the connected two component relations are generalized into one directed edge of two nodes in the graph;
s13: repeating the steps to obtain a node set and an edge set of the whole application program.
3. The automated test method for a low code platform according to claim 1, wherein step S2 comprises the sub-steps of:
s21: constructing a directed graph according to the node set and the edge set;
s22: judging whether the directed graph has a ring or not by adopting a topology ordering detection method;
s23: if the directed graph has a ring, adjusting the edge set of the directed graph so as to obtain a directed acyclic graph; if the directed graph is loop-free, step S3 is directly performed.
4. The automated testing method for a low-code platform according to claim 3, wherein step S22 specifically comprises: taking out a node with the ingress degree of 0 from the directed ring graph each time, deleting the node and all edges taking the node as a starting point, and if the directed graph is finally empty, proving no ring; if the final directed graph is not empty, then loops are demonstrated.
5. The automated testing method for a low-code platform according to claim 1, wherein step S3 specifically comprises: and calculating all paths between the starting node and the ending node according to the depth-first traversal algorithm and the breadth-first traversal algorithm of the graph, and simultaneously calculating a critical path, a longest path and a shortest path of the directed graph to obtain a path set covering all the nodes.
6. The automated testing method of low code platform oriented according to claim 5, wherein step S4 comprises the sub-steps of:
s41: filtering invalid paths according to service requirements;
s42: and carrying out association and classification labeling on the test cases according to the service requirements to obtain a final test case set, wherein the classification labeling comprises grade labeling and/or labeling.
7. The automated testing method for low-code platforms according to claim 6, wherein step S5 specifically comprises: and automatically executing all test case sets, comparing according to expected result values and execution result values of the test cases to obtain the passing condition of each test case, calculating the test passing rate of each requirement according to the corresponding relation between the requirements and the test cases, and finally visually displaying the execution results and the test passing rate data of the test cases.
8. An automated testing system for a low-code platform, for implementing the automated testing method for a low-code platform according to any one of claims 1 to 7, comprising a demand management module, a calculation module, an execution module, and a visualization module, wherein,
the demand management module is used for inputting and storing product information to be tested;
the computing module is used for identifying a node set and an edge set of the graph according to the application program codes, constructing a program component node execution directed graph of the whole application system according to the node set and the edge set, then computing a path set of the directed graph based on an algorithm of the graph, automatically removing duplication and outputting a test case set;
the execution module is used for carrying out demand association, screening, classification and labeling on the test case set to obtain a final test case set, automatically executing the test case set and carrying out test result analysis;
and the visualization module is used for performing visual display according to the analysis result.
9. A computer program product comprising a computer program which, when executed by a processor, implements a low code platform oriented automated test method according to any one of claims 1 to 7.
10. A computer readable storage medium storing a computer program, wherein the computer program when executed by a processor implements a low code platform oriented automated test method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311382416.XA CN117312167A (en) | 2023-10-24 | 2023-10-24 | Automatic test method and system for low-code platform |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311382416.XA CN117312167A (en) | 2023-10-24 | 2023-10-24 | Automatic test method and system for low-code platform |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117312167A true CN117312167A (en) | 2023-12-29 |
Family
ID=89297144
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311382416.XA Pending CN117312167A (en) | 2023-10-24 | 2023-10-24 | Automatic test method and system for low-code platform |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117312167A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117596165A (en) * | 2024-01-18 | 2024-02-23 | 中国人民解放军军事科学院系统工程研究院 | Software radio standard compliance testing method and device based on logic function packaging |
-
2023
- 2023-10-24 CN CN202311382416.XA patent/CN117312167A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117596165A (en) * | 2024-01-18 | 2024-02-23 | 中国人民解放军军事科学院系统工程研究院 | Software radio standard compliance testing method and device based on logic function packaging |
| CN117596165B (en) * | 2024-01-18 | 2024-03-29 | 中国人民解放军军事科学院系统工程研究院 | Software radio standard compliance testing method and device based on logic function packaging |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mannhardt | Multi-perspective process mining | |
| CN102239458B (en) | Visualizing relationships between data elements | |
| US7853549B2 (en) | Method for rule compliance situation checking and related checking system | |
| US9031873B2 (en) | Methods and apparatus for analysing and/or pre-processing financial accounting data | |
| US10726052B2 (en) | Path generation and selection tool for database objects | |
| Xiang et al. | Detecting data-flow errors based on Petri nets with data operations | |
| US8321251B2 (en) | Evolutionary process system | |
| US8630887B2 (en) | Business process flowchart editing program and business process flowchart editing method | |
| US9304991B2 (en) | Method and apparatus for using monitoring intent to match business processes or monitoring templates | |
| US7805284B2 (en) | Simulation model defining system for generating a simulation program for a simulator simulating a behavior of economy or society regarded as a system of phenomena and events | |
| CN117312167A (en) | Automatic test method and system for low-code platform | |
| CN109101410B (en) | Risk drive testing method and device and computer readable storage medium | |
| Molka et al. | Conformance checking for BPMN-based process models | |
| CN111651460A (en) | Data management method and device, electronic equipment and readable storage medium | |
| JP2005122560A (en) | Program for detecting deadlock beforehand | |
| JP5582540B2 (en) | Method for extracting frequent partial structure from data having graph structure, apparatus and program thereof | |
| US8166453B2 (en) | Method and system for inconsistency resolution with cycle detection in a model-driven software environment | |
| US20140372386A1 (en) | Detecting wasteful data collection | |
| CN116629330A (en) | Operator detection method and device and computer equipment | |
| CN112749325A (en) | Training method and device for search ranking model, electronic equipment and computer medium | |
| CN114312930B (en) | Train operation abnormality diagnosis method and device based on log data | |
| CN115454826A (en) | Regression testing method, device, electronic equipment and storage medium | |
| Uysal et al. | Re-engineering enterprise architectures | |
| US8510149B1 (en) | Method of constructing causality network graphs and visual inference presentations for business rule applications | |
| Weber et al. | Detecting inconsistencies in multi-view uml models |
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 |