Process verification method and device, readable storage medium and program product

Abstract

The invention relates to a process verification method and device, computer equipment, a computer readable storage medium and a computer program product, and the method comprises the steps: determining a recombination process according to the number of preprocessing items of a to-be-verified node in a to-be-verified process; taking the to-be-checked node as a to-be-added node, and determining a forward node of the to-be-added node from the added nodes based on a condition parameter in a pre-processing item of the added nodes; adding the to-be-added node to a recombination process where the forward node is located to generate a target recombination process; and executing the target recombination process to obtain a verification result of the target recombination process, and taking the verification result of the target recombination process as a verification result of the to-be-verified process. According to the invention, automatic verification of the process can be realized.

Description

Technical Field

[0001] The present application relates to the field of data processing, and specifically to a process verification method, apparatus, computer equipment, computer-readable storage medium, and computer program product. Background Art

[0002] In today's digital and automated era, processes have become the core driving force for efficient business operations. These processes not only cover all aspects of business operations, but also involve information transmission, resource allocation, and decision-making. To ensure that every step of the process is accurate, process verification is particularly important. Summary of the invention

[0003] Based on this, it is necessary to provide a process verification method, device, computer equipment, computer-readable storage medium and computer program product that can automatically verify the process in order to solve the above technical problems.

[0004] In a first aspect, the present application provides a process verification method, comprising:

[0005] Determine the reorganization process according to the number of pre-processing items of the nodes to be verified in the process to be verified;

[0006] Taking the node to be checked as the node to be added, and determining the forward node of the node to be added from the added nodes based on the condition parameters in the pre-processing item of the added node;

[0007] Adding the node to be added to the reorganization process where the forward node is located to generate a target reorganization process;

[0008] The target reorganization process is executed to obtain a verification result of the target reorganization process, and the verification result of the target reorganization process is used as the verification result of the process to be verified.

[0009] In a second aspect, the present application also provides a process verification device, comprising:

[0010] A process determination module, used to determine the reorganization process according to the number of pre-processing items of the nodes to be verified in the process to be verified;

[0011] A node determination module, used to take the node to be verified as a node to be added, and determine a forward node of the node to be added from the added nodes based on a condition parameter in a pre-processing item of the added node;

[0012] A node adding module, used for adding the node to be added to the reorganization process where the forward node is located, to generate a target reorganization process;

[0013] The process verification module is used to execute the target reorganization process, obtain the verification result of the target reorganization process, and use the verification result of the target reorganization process as the verification result of the process to be verified.

[0014] In a third aspect, the present application further provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0015] Determine the reorganization process according to the number of pre-processing items of the nodes to be verified in the process to be verified;

[0016] Taking the node to be checked as the node to be added, and determining the forward node of the node to be added from the added nodes based on the condition parameters in the pre-processing item of the added node;

[0017] Adding the node to be added to the reorganization process where the forward node is located to generate a target reorganization process;

[0018] The target reorganization process is executed to obtain a verification result of the target reorganization process, and the verification result of the target reorganization process is used as the verification result of the process to be verified.

[0019] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the following steps are implemented:

[0020] Determine the reorganization process according to the number of pre-processing items of the nodes to be verified in the process to be verified;

[0021] Taking the node to be checked as the node to be added, and determining the forward node of the node to be added from the added nodes based on the condition parameters in the pre-processing item of the added node;

[0022] Adding the node to be added to the reorganization process where the forward node is located to generate a target reorganization process;

[0023] The target reorganization process is executed to obtain a verification result of the target reorganization process, and the verification result of the target reorganization process is used as the verification result of the process to be verified.

[0024] In a fifth aspect, the present application further provides a computer program product, including a computer program, which implements the following steps when executed by a processor:

[0025] Determine the reorganization process according to the number of pre-processing items of the nodes to be verified in the process to be verified;

[0026] Taking the node to be checked as a node to be added, and determining a forward node of the node to be added from the added nodes based on the conditional parameters in the pre-processing items of the added nodes;

[0027] Adding the node to be added to the reorganization process where the forward node is located to generate a target reorganization process;

[0028] The target reorganization process is executed to obtain a verification result of the target reorganization process, and the verification result of the target reorganization process is used as the verification result of the process to be verified.

[0029] The above-mentioned process verification method, device, computer equipment, computer-readable storage medium and computer program product determine the reorganization process according to the number of pre-processing items of the node to be verified in the process to be verified; take the node to be verified as the node to be added, and determine the forward node of the node to be added from the added nodes based on the conditional parameters in the pre-processing items of the added node; add the node to be added to the reorganization process where the forward node is located to generate the target reorganization process; execute the target reorganization process to obtain the verification result of the target reorganization process, and use the verification result of the target reorganization process as the verification result of the process to be verified. Since the pre-processing is the preparation before the node is executed and affects the result of the node output, the process can be reorganized based on the pre-processing items configured for the node to obtain the target reorganization process, and the automatic verification of the process can be realized by executing the target reorganization process. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0031] Figure 1 An application environment diagram of a process verification method in an embodiment;

[0032] Figure 2 A schematic diagram of a process flow of a process verification method in an embodiment;

[0033] Figure 3 A schematic diagram of a process to be verified in an embodiment;

[0034] Figure 4 A schematic diagram of warehousing a process to be verified in an embodiment;

[0035] Figure 5 A schematic diagram of a process of storing nodes to be verified in an embodiment;

[0036] Figure 6 A schematic diagram of a pre-processing item configured in one embodiment;

[0037] Figure 7 A schematic diagram of a post-processing item configured in an embodiment;

[0038] Figure 8 A schematic diagram of a target reorganization process warehousing in one embodiment;

[0039] Fig. 9 A schematic diagram of the target reorganization process execution in one embodiment;

[0040] Fig.10 A structural block diagram of a process verification device in an embodiment;

[0041] Fig.11 is an internal structure diagram of a computer device in one embodiment;

[0042] Fig.12 FIG. 4 is a diagram showing the internal structure of a computer device in another embodiment. DETAILED DESCRIPTION

[0043] In order to make the purpose, technical scheme and advantages of the present application more clear, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used in the description of the present application. If there is a description of the first and the second, it is only for the purpose of distinguishing the technical features, and cannot be understood as indicating or implying the relative importance or implicitly indicating the number of the indicated technical features or implicitly indicating the order of the indicated technical features.

[0044] In the description of this application, unless otherwise clearly defined, terms such as setting, installing, connecting, etc. should be understood in a broad sense, and technicians in the relevant technical field can reasonably determine the specific meanings of the above terms in this application based on the specific content of the technical solution.

[0045] See also Figure 1 , Figure 1 FIG. 1 is an application environment diagram of a process verification method in an embodiment. The process verification method provided in the embodiment of the present application can be applied to Figure 1 In the application environment shown, the terminal 102 communicates with the server 104 through a network. The data storage system can store data that the server 104 needs to process. The data storage system can be integrated on the server 104, or placed on the cloud or other servers.

[0046] Both the terminal and the server can be used independently to execute the process verification method provided in the embodiments of the present application.

[0047] For example, the server determines the reorganization process according to the number of pre-processing items of the node to be verified in the process to be verified. The server uses the node to be verified as the node to be added, determines the forward node of the node to be added from the added nodes based on the conditional parameters in the pre-processing items of the added node, adds the node to be added to the reorganization process where the forward node is located, and generates a target reorganization process. The server executes the target reorganization process, obtains the verification result of the target reorganization process, and uses the verification result of the target reorganization process as the verification result of the process to be verified.

[0048] In addition, the terminal and the server can also be used together to execute the process verification method provided in the embodiments of the present application.

[0049] For example, the server determines the reorganization process according to the number of pre-processing items of the node to be verified in the process to be verified, takes the node to be verified as the node to be added, determines the forward node of the node to be added from the added nodes based on the conditional parameters in the pre-processing items of the added node, adds the node to be added to the reorganization process where the forward node is located, generates the target reorganization process, and sends the target reorganization process to the server. The server executes the target reorganization process, obtains the verification result of the target reorganization process, and takes the verification result of the target reorganization process as the verification result of the process to be verified.

[0050] The terminal 102 may be a smart phone, a tablet computer, a laptop computer, a desktop computer, a smart speaker, a smart watch, an IoT device, and a portable wearable device. The IoT device may be a smart speaker, a smart TV, a smart air conditioner, a smart vehicle-mounted device, a projection device, etc. The portable wearable device may be a smart watch, a smart bracelet, a head-mounted device, etc. The head-mounted device may be a virtual reality (VR) device, an augmented reality (AR) device, smart glasses, etc.

[0051] The server 104 may be an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides cloud computing services.

[0052] The terminal 102 and the server 104 may be connected via Bluetooth, USB (Universal Serial Bus) or a network or other communication connection methods, which are not limited in this application.

[0053] In an exemplary embodiment, Figure 2 As shown, a process verification method is provided, and the method is applied to a computer device as an example, and the computer device can be a terminal or a server. Figure 2 The process verification method includes the following steps S202 to S210. Among them:

[0054] Step S202, determining a reorganization process according to the number of pre-processing items of the nodes to be verified in the process to be verified.

[0055] The process to be verified can be obtained from a process management system, etc. After obtaining, the process to be verified is added to the process table to be verified and stored in the database. The process to be verified is a process whose accuracy needs to be verified. It contains a series of process nodes. It can be used to perform various operations, such as passing data, calling interfaces, or obtaining data through interfaces, calling services, etc.

[0056] To ensure that each node in the process to be verified can be executed accurately, the process to be verified needs to be verified. Some nodes in the process to be verified need to be verified, while others do not. This depends on the importance of the node in the process, the requirements for data integrity, and the needs of execution logic. The nodes that need to be verified are the nodes to be verified.

[0057] For example, for inputs involving important business decisions, financial transactions, or customer information, strict verification is usually required to ensure the accuracy and completeness of the data; in processes that need to comply with specific regulations or industry standards, certain nodes may need to be verified to ensure compliance with relevant requirements, such as customer identity verification, tax information verification, etc.; when a node in the process depends on data from previous nodes, verification is required to ensure data consistency, such as in the order processing process, it is necessary to verify whether the order information is consistent with the inventory information; for nodes that are prone to errors or often have problems, adding verification steps can help prevent errors and correct them in a timely manner, thereby improving the accuracy and efficiency of the process.

[0058] In some cases, the return value of the interface in the process will affect the interface called by the next node. For such processes, when they are used as processes to be verified, the verification methods for these processes to be verified include: the verification personnel analyze and sort out the outputs of all nodes in the process and the complete process direction. When the process branches, the verification personnel need to manually control the return value of each interface to adjust the process direction to hit each expected process. This verification method relies on manual control, the operation process is cumbersome, and it takes a lot of manual time each time, and the risk of omission is also very high. Once a node in the process changes, the use case analysis process needs to be revised again.

[0059] Another verification method is for the verification staff to design and develop a verification script for each interface separately, and verify the process direction of different outputs of different interfaces through the verification script code. However, this method requires writing a lot of code, the verification process is very cumbersome, and a single script can only support the verification of a single interface process. Different processes require customized development of verification scripts.

[0060] Based on the shortcomings of the above verification methods, the present application provides a simpler, more convenient and easily expandable process verification method, which can improve the efficiency and accuracy of process verification and reduce human intervention.

[0061] The process verification method provided by the present application obtains the pre-processing items configured for the nodes to be verified after obtaining the process to be verified containing the nodes to be verified. The pre-processing items are configured with pre-processing and conditional parameters before the node is executed. Among them, the pre-processing items include pre-processing pre-processing items for pre-processing and pre-processing items for non-pre-processing. The conditional parameters are parameters for realizing logical association and conditional control between different nodes to be verified, and are used to associate each node to be verified.

[0062] The preprocessing preprocessing items include the preprocessing preprocessing, which is used to configure the node to perform the required data preparation, where each set of data preparation may cause inconsistent node returns. The non-preprocessing preprocessing items include non-preprocessing preprocessing, such as the interface corresponding to the execution node. Optionally, the preprocessing preprocessing items and non-preprocessing preprocessing items can be marked differently to distinguish them. For example, the preprocessing items are marked with preFlag, where the preFlag of the preprocessing preprocessing items is marked as 1 or "true", and the preFlag of the non-preprocessing preprocessing items is marked as 0 or "false". Alternatively, the preprocessing preprocessing items are marked with the preset mark preFlag=1 or "preFlag is true", and the non-preprocessing preprocessing items are not marked.

[0063] Before verifying the process, pre-processing items are configured for the nodes to be verified in the process to be verified.

[0064] Among them, a pre-processing item configuration table for the process to be verified can be established. Relevant personnel can execute logic according to the context of the node to be verified, configure corresponding pre-processing items for the node to be verified, and store the configured pre-processing items together with the node label of the corresponding node to be verified in the pre-processing configuration table, number each pre-processing item, and mark the pre-processed pre-processing items with a preset identifier.

[0065] A node to be verified can be configured with one pre-processing item or multiple pre-processing items, depending on whether the data processing of the node to be verified affects the data returned by the node to be verified. For example, when the node to be verified enters different backward nodes after execution according to the different data returned by it, at least two pre-processing items corresponding to its branch logic can be configured for the node to be verified.

[0066] In one embodiment, in addition to configuring pre-processing items for the node to be verified, basic information of each node to be verified and configuration items such as post-processing items, access verification items and post-check items can also be configured. Among them, the post-processing items are used to query the SQL table or API interface data after the node to be verified is executed; the access verification items are used to verify the conditions that must be met for executing the node to be verified. There can be multiple groups of access verification items. If any group is met, the node to be verified can be executed. If none of them are met, the node to be verified will not be executed; the post-check items are checks after the node is executed, including SQL insertion status checks or API interface return value checks.

[0067] After the configuration is completed, the configuration items are stored in the database. Each configuration item can be stored in a separate table or in one table. When storing each configuration item, the corresponding node to be verified needs to be marked.

[0068] When the node to be verified needs to be verified, the pre-processing items configured for the node to be verified are obtained from the database, and the process to be verified is reorganized according to the pre-processing items.

[0069] It should be noted that if a node to be verified has a large number of pre-processing items, this may indicate that the node to be verified is highly dependent on data provided by other nodes or systems to be verified. These pre-processing items may include operations such as data verification, data conversion, data merging, or data cleaning to ensure that the node to be verified can receive correct and complete data. Too many pre-processing items may reduce the efficiency of the process because each processing item requires time and resources to execute. If the pre-processing items can be merged or optimized, it can reduce bottlenecks in the process and improve overall performance.

[0070] Therefore, in the embodiment of the present application, by reorganizing the nodes to be verified of the process to be verified, the complexity of the process is reduced and the verification efficiency is improved. Since the number of pre-processing items can reflect the number of process branches that may exist next to the node to be verified, the reorganization process can be determined based on the number of pre-processing items of the node to be verified. Optionally, at least two reorganization processes can be determined. Compared with the original process to be verified, the execution logic of at least two reorganization processes is simpler, and fewer branches need to be considered, which can improve the efficiency of process verification. In addition, the two reorganization processes can be executed in parallel to further improve the efficiency of process verification.

[0071] In one embodiment, determining the reorganization process includes determining the number of reorganization processes and generating the reorganization process. For example, an empty reorganization process set may be initialized, nodes to be verified may be gradually added to the reorganization process set, and the added nodes to be verified may be linked to the already added nodes to be verified, and finally a target reorganization process may be generated.

[0072] In one embodiment, determining at least two reorganization processes includes determining that the number of reorganization processes to be generated is at least two, and generating at least two reorganization processes. For example, an empty reorganization process set may be initialized, nodes to be verified may be gradually added to the reorganization process set, and the added nodes to be verified may be linked to the already added nodes to be verified, and finally at least two target reorganization processes may be generated.

[0073] Taking the number of processes to be verified as k as an example (k is a positive integer), optionally, when determining the reorganization process according to the number of pre-processing items of the nodes to be verified in the processes to be verified, for each of the k processes to be verified, the corresponding number of reorganization processes is determined based on the number of pre-processing items of the nodes to be verified in the processes to be verified. For example, the number of pre-processing items M of the first node to be verified among the nodes to be verified is determined, and the number of reorganization processes is determined to be N based on the number of pre-processing items M of the first node to be verified, and the first node to be verified is added to the N reorganization processes as the starting point. Among them, M and N are both integers greater than 1, M can be greater than N, M can be equal to N, and M can be less than N. M and N of each node to be verified can be the same or different.

[0074] Optionally, after the first node to be verified is added to the M reorganization processes as the starting point of the M reorganization processes, the pre-processing items of the first node to be verified can be associated with the starting points of the M reorganization processes. For example, each pre-processing item of the first node to be verified is associated with at least one reorganization process.

[0075] Step S204: taking the node to be checked as the node to be added, and determining the forward node corresponding to the node to be added from the added nodes based on the conditional parameters in the pre-processing items of the added nodes.

[0076] To achieve the reorganization of the process, the nodes to be verified are added to the reorganization process in sequence. For example, the first node to be verified is added to the reorganization process as the starting point of the reorganization process, and the obtained reorganization process includes the first node to be verified.

[0077] When adding the nodes to be checked to the reorganization process in sequence, the nodes to be checked that have been added to the reorganization process are taken as the added nodes, the nodes to be checked that have not been added to the reorganization process are taken as the unadded nodes, and the first unadded node is taken as the node to be added. The nodes to be checked of the process to be checked are traversed in sequence, and the forward nodes corresponding to the nodes to be added are determined from the added nodes based on the conditional parameters in the pre-processing items of the added nodes.

[0078] In a process, a forward node refers to the node corresponding to a task or step that has been completed before a task or step. A backward node refers to the node corresponding to the subsequent task or step to be executed after a task or step is completed. The forward node and the backward node are relative. If A is the forward node of B, then B is the backward node of A.

[0079] It should be noted that when determining the forward node corresponding to the node to be added from the added nodes based on the conditional parameters in the pre-processing items of the added nodes, the determined forward nodes may be one or more. Optionally, it may be determined whether the added node meets the entry condition of the node to be added based on the conditional parameters in the pre-processing items of the added nodes. If the conditional parameters in the pre-processing items of an added node meet the entry condition of the node to be added, then an added node that meets the entry condition will be used as the forward node of the node to be added; if the conditional parameters in the pre-processing items of multiple added nodes meet the entry condition of the node to be added, then multiple added nodes that meet the entry condition will be used as the forward nodes of the node to be added. Among them, an admission check item may be set for the node to be checked. When the node to be checked is used as the node to be added, the admission check item of the node to be added can be used as the entry condition of the node to be added.

[0080] Step S206, adding the node to be added to the reorganization process where the forward node is located, to generate a target reorganization process.

[0081] After determining the forward node of the node to be added, it is possible to determine in which reorganization process the node to be added is to be added. After determining the forward node corresponding to the node to be added from the added nodes based on the conditional parameters in the pre-processing item of the added node, the reorganization process where the forward node is located can be determined as the reorganization process corresponding to the node to be added, and then the node to be added is added to the reorganization process where the forward node is located to generate a target reorganization process.

[0082] Optionally, all nodes to be checked in the process to be checked can be traversed, and all nodes to be checked can be used as nodes to be added in order according to the order of all nodes to be checked, and the forward node of the node to be added can be determined, and the reorganization process where the forward node of the node to be added is located can be used as the reorganization process corresponding to the node to be added, and the node to be added can be added to the corresponding reorganization process until all nodes to be checked are added to the corresponding reorganization process to obtain the target reorganization process.

[0083] Step S208, executing the target reorganization process, obtaining the verification result of the target reorganization process, and using the verification result of the target reorganization process as the verification result of the process to be verified.

[0084] After the target reorganization process is reorganized, the verification result of the target reorganization process can be obtained by executing the target reorganization process, and the verification result of the target reorganization process can be used as the verification result of the process to be verified, thereby realizing automatic verification of the process to be verified.

[0085] Among them, when executing the target reorganization process, the target reorganization process can be verified, and the verification includes: verifying the structural integrity and correctness of the target reorganization process, verifying whether there are unconnected nodes or duplicated nodes, verifying whether the data processing and transmission in the process are correct, whether the mapping of data fields is correct, whether the data conversion is valid, etc., to ensure that the flow of data in the process complies with the preset rules and logic.

[0086] The above-mentioned process verification method determines the reorganization process according to the number of pre-processing items of the node to be verified in the process to be verified; takes the node to be verified as the node to be added, and determines the forward node of the node to be added from the added nodes based on the conditional parameters in the pre-processing items of the added node; adds the node to be added to the reorganization process where the forward node is located to generate the target reorganization process; executes the target reorganization process to obtain the verification result of the target reorganization process, and uses the verification result of the target reorganization process as the verification result of the process to be verified. Since the pre-processing is the preparation before the node is executed and affects the result of the node output, the process can be reorganized based on the pre-processing items configured for the node to obtain the target reorganization process, and the automatic verification of the process can be realized by executing the target reorganization process.

[0087] This application does not require manual design of verification use cases. It only needs to configure pre-processing items for each node. The computer equipment can directly reorganize the process and output a fully covered process clear, eliminating the process of manual analysis and reorganization of the process, and can also avoid missing some process branches due to human errors. This application is applicable to different processes to be verified. When there is a new process to be verified that needs to be verified, it is only necessary to configure the pre-processing items for the new process to be verified to achieve automatic reorganization and verification of the process. There is no need to develop a separate process verification script based on the characteristics of the new process to be verified, which can solve the problem of high script development and maintenance costs.

[0088] In one embodiment, there may be at least two target reorganization processes. When there are at least two target reorganization processes, from the process to be verified to the target reorganization process, after the complex process is split into at least two target reorganization processes, the structure of a single process is simplified, and these target reorganization processes can be executed in parallel, which means that they can handle different tasks at the same time in the same time period, so they are executed faster, thereby improving the efficiency of process verification. Moreover, compared with the process to be verified, the target reorganization process has fewer branches to be judged, the waiting time for process execution is shorter, and the dependence on manual labor is reduced.

[0089] In one embodiment, the reorganization process is determined according to the number of pre-processing items of the node to be verified in the process to be verified, including:

[0090] Determine the number M of pre-processing items of the first node to be verified among the nodes to be verified; determine the number of reorganization processes to be M, and add the first node to be verified as the starting point of the M reorganization processes to the M reorganization processes, and associate each pre-processing item of the first node to be verified with at least one reorganization process.

[0091] When determining the reorganization process according to the number of pre-processing items of the node to be verified in the process to be verified, the corresponding number of reorganization processes can be determined based on the number of pre-processing items of the node to be verified in the process to be verified. For example, the number of pre-processing items M of the first node to be verified among the nodes to be verified is determined, and based on the number of pre-processing items M of the first node to be verified, the number of reorganization processes is determined to be M, and the first node to be verified is added as the starting point of the M reorganization processes to the M reorganization processes.

[0092] Furthermore, in each process to be verified, the number of pre-processing items of the node to be verified may be more than one, that is, M is an integer greater than 1. When determining the reorganization process according to the number of pre-processing items of the node to be verified in the process to be verified, M reorganization processes can be determined based on the number M of pre-processing items of the first node to be verified, and the first node to be verified can be added to the M reorganization processes as the starting point of the M reorganization processes. After having the starting point, each node to be verified can be added to the reorganization process in sequence according to the order of each node to be verified in the process to be verified, and linked with the added nodes in the reorganization process to generate a target reorganization process. Among them, the first node to be verified is the node to be verified that is the first in the execution order in the process to be verified. The first node to be verified is both the starting point of the process to be verified and the starting point of the reorganization process.

[0093] Taking M equal to 2 as an example, an empty reorganization process set can be initialized. Based on the two pre-processing items of the first node to be verified, the number of reorganization processes to be generated is determined to be two, and the first node to be verified is added to the two reorganization processes as the starting point of the two reorganization processes. At this time, the two reorganization processes only contain the starting point (the first node to be verified). Gradually add nodes to be verified to the reorganization process set. When adding, link each node to be verified to the added node to be verified, and finally generate at least two target reorganization processes.

[0094] Optionally, after the starting point of the reorganization process is determined, each pre-processing item of the first node to be verified is associated with at least one reorganization process.

[0095] It is understandable that in some cases, for example, when the number of reorganization processes is greater than the number of pre-processing items of the first node to be verified, the pre-processing item of the first node to be verified can be associated with one or more reorganization processes, so that each reorganization process is associated with a pre-processing item of the starting point, and each pre-processing item of the starting point has one or more corresponding reorganization processes, that is, there are multiple starting points associated with the same pre-processing item. The multiple mentioned here includes two or more.

[0096] Furthermore, it may also include associating each pre-processing item of the first node to be verified one-to-one with the corresponding reorganization process, so that each reorganization process is only associated with one pre-processing item of the first node to be verified, and each pre-processing item of the first node to be verified also has only one corresponding reorganization process.

[0097] The corresponding reorganization process refers to the reorganization process where the forward node of the node to be verified is located.

[0098] In the above embodiment, the number of reorganization processes and the reorganization process are determined according to the number of the first node to be verified. The first node to be verified, as the first added node added to the reorganization process, can be used as a starting point for linking all subsequent nodes to be added. All nodes to be verified after the first node to be verified can be used as nodes to be added, and are gradually linked to the corresponding reorganization process according to the association with each added node, so as to realize the transformation from the reorganization process to the target reorganization process.

[0099] Furthermore, for the case where there are at least two pre-processing items for the first node to be verified (i.e., M≥2), the original process to be verified must perform multiple pre-processing at the starting point and go to multiple process branches when executing each verification, which consumes a lot of time and resources when the process is verified at the beginning. However, this application determines the number of reorganized processes M≥2 based on the number of pre-processing items M of the first node to be verified. When the reorganized process is just generated, it can ensure that the number of processes is greater than the number of original processes to be verified, and split the process from the starting point, thereby reducing the number of pre-processing to be performed at the starting point when verifying a single process, and reducing the number of process branches at the starting point, which can effectively ensure that the reorganized process is simpler and faster to execute than the original process to be verified.

[0100] In one embodiment, when adding the node to be checked to the reorganization process where the forward node is located, a loop step can be used. For example: sequentially traverse the nodes to be checked in the process to be checked, treat the nodes to be checked that have been added to the reorganization process as the added nodes, treat the nodes to be checked that have not been added to the reorganization process as the unadded nodes, and treat the first unadded node as the node to be added; determine the forward node of the node to be added from the added nodes based on the conditional parameters in the pre-processing item of the added node, and add the node to be added to the reorganization process where the forward node is located; then, return to execute the step of sequentially traversing the nodes to be checked in the process to be checked, and loop the above steps until all the nodes to be added are added to the corresponding reorganization process, and generate the target reorganization process, wherein the reorganization process corresponding to the node to be added includes the reorganization process where the forward node corresponding to the node to be added is located.

[0101] Among them, the unadded node refers to the node to be verified that has not been added to the reorganization process, and the opposite of the unadded node is the added node, and the added node refers to the node to be verified that has been added to the reorganization process. Each node to be verified in the process to be verified is either an unadded node or an added node.

[0102] For example, the first node to be verified is used as the starting point of all reorganization processes, and M reorganization processes to be generated are determined. After each pre-processing item of the first node to be verified is associated with at least one reorganization process, the first node to be verified among the nodes to be verified is an added node, the second node to be verified and the nodes to be verified thereafter are not added nodes, and the second node to be verified is a node to be added. From the starting point of the M reorganization processes (i.e., the first node to be verified), the forward node of the second node to be verified is determined, and the second node to be verified is added to the reorganization process where the forward node is located.

[0103] In the above embodiment, a loop is performed according to the same set of adding steps, all the nodes to be checked in the process to be checked are traversed, and all the nodes to be checked in the process to be checked are added to the corresponding reorganization process. Setting the node adding step as a loop can greatly improve the efficiency of the code, simplify the code, and make it easy to maintain the code. The reduction of redundant code can further improve the reorganization efficiency of the process, thereby further improving the verification efficiency of the process. When it is necessary to modify the node adding method, it is only necessary to modify the node adding method in the loop step to change the adding method of all nodes to be checked. Therefore, the loop step designed in the present application also supports dynamic adjustment of the node adding method.

[0104] In one embodiment, the added node is a node to be checked that has been added to the reorganization process, and the node to be added is configured with an admission check item. Based on the conditional parameters in the pre-processing item of the added node, determining the forward node of the node to be added from the added node includes:

[0105] For each reorganization process, the admission check item of the node to be added is checked according to the conditional parameters in the pre-processing item of the added node; if the admission check item of the node to be added passes the check, the added node is determined as the forward node of the node to be added.

[0106] Optionally, the node to be verified may also be configured with an admission check item. The admission check item is used to verify the conditions that must be met to execute the node to be verified. The admission check item of the node to be verified can be pre-configured and stored as an admission check item configuration table, and stored in a database. When the forward node corresponding to the node to be added is determined from the added nodes based on the conditional parameters of the pre-processing items of the added nodes, the admission check item configuration table of the process to be verified is retrieved from the database, and the admission check item of the node to be added is queried from the admission check item configuration table. The admission check item of the node to be added is verified according to the conditional parameters in the pre-processing items of the added nodes of the reorganization process. For example, the admission check item of the node to be added can be verified according to the conditional parameters in the pre-processing items of the terminal node of the reorganization process. The terminal node is the last added node in each reorganization process.

[0107] Among them, if the verification passes, it means that the conditional parameters in the pre-processing items of the added node meet the access conditions of the access check items of the node to be added, and the added node is determined as the forward node of the node to be added, and the node to be added is added to the reorganization process where the added node is located; if the verification fails, it means that the conditional parameters in the pre-processing items of the added node do not meet the access conditions of the access check items of the node to be added, the added node is not used as the forward node of the node to be added, and the node to be added is not linked to the end node, the added node is skipped, and the access check items of the node to be added are verified based on the conditional parameters of other added nodes.

[0108] If the admission check items of the nodes to be added fail to pass the verification according to the conditional parameters in the pre-processing items of all the added nodes in the reorganization process, it means that the conditional parameters in the pre-processing items of all the added nodes in the reorganization process do not meet the admission conditions of the admission check items of the nodes to be added, and all the added nodes in the reorganization process will not be used as the forward nodes of the nodes to be added, and the nodes to be added will not be added to the reorganization process. Instead, the reorganization process will be skipped, and the admission check items of the nodes to be added will be verified based on the conditional parameters of the added nodes of other reorganization processes.

[0109] It should be noted that not all nodes to be verified need to be configured with access check items. Access check items can be configured for some of the nodes to be verified based on the execution logic of the nodes to be verified and based on actual conditions. For nodes to be verified that are not configured with access check items, when the nodes to be verified are used as nodes to be added, the nodes to be verified are directly added to all reorganization processes.

[0110] In the above embodiment, the forward node of the node to be added is determined from the added nodes through the access check item of the node to be added and the conditional parameters in the pre-processing item of the node that has been added, which can ensure that only the backward nodes that meet specific conditions and standards can be added to the corresponding reorganization process, and can also ensure that no logical errors will occur when the node to be added is added to the reorganization process, thereby ensuring that the target reorganization process finally generated can be accurately executed.

[0111] In one embodiment, when verifying the admission check item of the node to be added based on the conditional parameters in the pre-processing item of the added node, it can be verified whether the conditional parameters meet the conditional limitations on the conditional parameters in the admission check item; if so, it is determined that the admission check item of the node to be added has passed the verification.

[0112] Among them, the conditional parameter (CommomParam) is a parameter for realizing logical association and conditional control between different nodes to be verified. Different values ​​can be set for the conditional parameters in different pre-processing items to control the different nodes to be verified that are linked thereafter. For example, the conditional parameter can be set to a number or a character.

[0113] The access check item of the node to be added includes conditional restrictions on the conditional parameters. When the conditional restrictions on the conditional parameters in the access check item are different, the conditions for entering the node to be added are different, and the forward node of the node to be added needs to perform different pre-processing. The conditional restrictions on the conditional parameters may include but are not limited to: restricting the conditional parameters to a certain value, or restricting the value range of the conditional parameters, or restricting the conditional parameters to be equal to a certain character, etc.

[0114] For example, the conditional parameter can be set to a character code, and the value of code in different pre-processing items can be set to 0 or 1, etc. The conditional restriction on the conditional parameter can be code=1, or code≠1, or code=0, etc.

[0115] By checking whether the condition parameters meet the conditional restrictions on the condition parameters in the admission check items, it can be determined whether the admission check items of the node to be added have been verified. If the condition parameters in the pre-processing items of the terminal node meet the conditional restrictions on the condition parameters in the admission check items of the node to be added, it is determined that the admission check items of the node to be added have been verified; if the condition parameters in the pre-processing items of the terminal node do not meet the conditional restrictions on the condition parameters in the admission check items of the node to be added, it is determined that the admission check items of the node to be added have not been verified.

[0116] For example, the conditional restriction for the conditional parameter in the admission check item of the node to be added can be code = 1. If the conditional parameter code in the pre-processing item of the added node takes the value of 1, the admission check item of the node to be added passes the check; if the conditional parameter code in the pre-processing item of the added node takes the value of 0 or other values ​​not equal to 1, the admission check item of the node to be added fails the check.

[0117] If the admission check item of the node to be added passes the verification, the added node is determined as the forward node of the node to be added. If the admission check item of the node to be added passes the verification, the added node is skipped and the conditional parameters in the pre-processing item of the next added node are continued to be verified.

[0118] In the above embodiment, the conditional parameters realize logical association and conditional control between different nodes to be verified. By setting conditional limitations on the conditional parameters in the access check of the nodes to be verified, it is possible to limit the random association between the nodes to be verified, but to associate them according to the actual execution logic of the process under different pre-processing conditions, thereby ensuring the accuracy of the forward node determined for each node to be verified, thereby ensuring that after the node to be verified is added to the reorganization process, it does not conflict with the original execution logic of the process to be verified.

[0119] In one embodiment, adding the node to be added to the reorganization process where the forward node is located to generate the target reorganization process includes:

[0120] Add the node to be added to the reorganization process where the forward node is located; based on the number of pre-processing items of the node to be added, copy the reorganization process where the forward node is located to obtain the corresponding copied reorganization process; associate the pre-processing items of the node to be added with at least one reorganization process where the forward node is located or the corresponding copied reorganization process to obtain the target reorganization process.

[0121] When adding the node to be added to the corresponding reorganization process, in addition to linking the node to be added to the corresponding forward node and thus adding the node to be added to the reorganization process where the forward node is located, the pre-processing items of the node to be added can also be associated with the corresponding reorganization process after the link, such as associating the node to be added to the linked forward node.

[0122] In some cases, in addition to associating the pre-processing items of the node to be added to the reorganization process where the forward node is located, the reorganization process where the forward node is located can be copied based on the number of pre-processing items of the node to be added to obtain the corresponding copied reorganization process, and the pre-processing items of the node to be added can be associated with at least one reorganization process where the forward node is located or the corresponding copied reorganization process to obtain the target reorganization process. In addition to associating the pre-processing items of the node to be added to the corresponding reorganization process, it can also be associated with the corresponding copied reorganization process. The copied reorganization process is a reorganization process obtained by copying the reorganization process where the forward node is located.

[0123] For example, the node to be added contains M pre-processing items (M is an integer greater than 1). Based on the number M of pre-processing items of the node to be added, the reorganization process where the forward node is located is copied. If there are N reorganization processes where the forward node is located (N is a positive integer), MN duplicated reorganization processes are copied, so that the number M of pre-processing items of the node to be added is equal to the sum of the number N of reorganization processes where the corresponding forward node is located and the number MN of duplicated reorganization processes obtained by copying. When N is 1, M-1 duplicated reorganization processes can be directly copied according to the reorganization process.

[0124] In the above embodiment, the reorganization process is copied based on the number of pre-processing items of the node to be added, which can ensure that the pre-processing items of the node to be added have enough reorganization processes to be mounted respectively, thereby reducing the complexity of the reorganization process and the reliance on manual selection of branches, thereby saving labor costs.

[0125] Furthermore, due to the difference in the pre-processing items, the process will have different branches, and when the node to be added is added to the reorganization process and is only associated with a unique pre-processing item, the node will no longer have a different process direction. By controlling the number of duplicate reorganization processes of each node to be added, the number of reorganization processes and duplicate reorganization processes corresponding to the node to be added can be made greater than or equal to the number of pre-processing items of the node to be added, thereby making the reorganization process contain no process branches and only a unique direction. Performing the same copy operation on each node to be added in turn can make the target reorganization process finally generated contain only a unique branch. Furthermore, not only can the overall process execution efficiency be improved by executing multiple target reorganization processes in parallel, but each target reorganization process itself does not contain a process branch and has only a unique direction, so the execution efficiency of a single target reorganization process is also rapidly improved, thereby further improving the efficiency of reorganization process execution and verification. At the same time, there is no need for human participation in selecting the next execution branch at the bifurcation point, and the process of process reorganization and execution can be achieved by one-click computer equipment.

[0126] In one embodiment, executing the target reorganization process to obtain the verification result of the target reorganization process includes:

[0127] For the node to be verified in the target reorganization process, if the node to be verified is configured with a pre-processing item, pre-processing is performed on the node to be verified according to the pre-processing item to obtain a first execution result; if the node to be verified is configured with a post-processing item, post-processing is performed on the node to be verified according to the post-processing item to obtain a second execution result; if the node to be verified is configured with a post-check item, a post-check is performed on the node to be verified according to the recorded data when the node to be verified performs pre-processing and post-processing, and the post-check item, to obtain a third execution result; based on the first execution result, the second execution result and the third execution result, the verification result of the target reorganization process is obtained.

[0128] According to the actual execution logic of the process to be verified, post-processing items and post-checking items can also be configured for the nodes to be verified. Among them, post-processing items are the processing performed after the node is executed, including querying the SQL table or API interface data after the node to be verified is executed; post-checking items are checks after the node is executed, including SQL insertion status checks or API interface return value checks, etc.

[0129] In one embodiment, the post-processing items can be configured corresponding to the pre-processing items. For example, for a node to be verified that is configured with a pre-processing item, the processing that depends on the data prepared by its pre-processing item and is performed after the node is executed can be configured as a post-processing item. Since both the pre-processing items and the post-processing items are configurations at the use case level, when adding the node to be added to the corresponding reorganization process, the post-processing items of the node to be added can be associated with the reorganization process corresponding to the pre-processing items by referring to the way in which the pre-processing items of the node to be added are associated with the reorganization process.

[0130] For the post-check items at the node level, each node to be checked is configured with only one post-check item, so after adding the node to be added to the corresponding reorganization process, the post-check items of the node to be added can be directly associated with the corresponding reorganization process.

[0131] Furthermore, the pre-processing items, post-processing items and post-checking items of each node to be verified are added to the reorganization process. When executing the target reorganization process, the target reorganization process can be executed according to the pre-processing items, post-processing items and post-checking items of each node to be verified contained in the target reorganization process.

[0132] When executing the target reorganization process, all nodes to be verified in the target reorganization process can be traversed, and corresponding pre-processing can be performed on the nodes to be verified that are configured with pre-processing items, and corresponding post-processing can be performed on the nodes to be verified that are configured with post-processing items; according to the process data when executing the pre-processing and post-processing, the corresponding post-check can be performed on the nodes to be verified that are configured with post-check items in the reorganization process.

[0133] For each node to be checked in the reorganization process, if the node to be checked is configured with a pre-processing item, pre-processing is performed on the node to be checked according to the pre-processing item to obtain a first execution result; if the node to be checked is configured with a post-processing item, post-processing is performed on the node to be checked according to the post-processing item to obtain a second execution result; if the node to be checked is configured with a post-check item, a post-check is performed on the node to be checked according to the recorded data when the node to be checked performs pre-processing and post-processing, and the post-check item, to obtain a third execution result.

[0134] Among them, the recorded data is the data generated or used when performing pre-processing and post-processing, and is the intermediate data that can reflect the processing results. The first execution result is the execution result of the pre-processing, the second execution result is the execution result of the post-processing, and the third execution result is the execution result of the post-check. Each execution result includes the result prompt information or execution exception information when the node to be verified performs the corresponding processing or inspection. Among them, the result prompt information is used to reflect the success or failure of the execution, and the execution exception information includes the abnormal location when the execution fails.

[0135] According to the first execution result of the pre-processing, the second execution result of the post-processing and the third execution result of the post-checking, the verification result of the target reorganization process is obtained, and the verification result of the target reorganization process can be obtained. Verifying the target reorganization process by executing the target reorganization process is an important step to ensure that the target reorganization process is carried out as expected. When executing the target reorganization process, it can be verified whether the interface called by each node and the calling order are correct, whether the parameters passed are correct, whether the return of the interface meets expectations, and whether the entire process can be carried out according to the expected logic. Since the target reorganization process is reorganized by the process to be verified, the verification result of the target reorganization process can be used as the verification result of the process to be verified.

[0136] In the above embodiment, by performing pre-processing, the data entering the node can be effectively screened and verified to ensure the accuracy and compliance of the data, reduce process interruptions or errors caused by data errors or non-compliance with specifications, and discover potential problems before the data enters the node; by performing post-processing, the results after node processing can be verified to ensure the correctness and integrity of the node output results, and discover process errors caused by result errors; by performing post-checking, it can be verified whether the nodes of the process are executed as expected, and the integrity and correctness of the process can be verified. Through post-checking, the execution performance of the process, such as execution time, resource consumption, etc., can also be monitored to provide a basis for process optimization. By performing pre-processing, post-processing and post-checking of nodes in the target reorganization process, the correctness and integrity of the target reorganization process can be fully verified, which is not only beneficial to reducing the error rate and risk in the process execution process, but also can provide a basis for subsequently improving the execution efficiency and quality of the process, and promote the continuous improvement and optimization of the process to be verified itself or the target reorganization process obtained by reorganization.

[0137] In one embodiment, the pre-processing item includes a first pre-processing item and a second pre-processing item, and the first pre-processing item includes a preset identifier, and the preset identifier is used to mark the pre-processing item including data preparation. Executing the target reorganization process includes:

[0138] For the nodes to be checked that are configured with the first pre-processing item in the target reorganization process, pre-processing is performed on the nodes to be checked according to the first pre-processing item; after the pre-processing of the nodes to be checked that are configured with the first pre-processing item is completed, for the nodes to be checked that are configured with the second pre-processing item in the target reorganization process, pre-processing is performed on the nodes to be checked according to the second pre-processing item.

[0139] The pre-processing items of the node to be verified include a first pre-processing item and a second pre-processing item, wherein the first pre-processing item may be a pre-processing of a pre-processing, which involves data preparation when executed, and the second pre-processing item may be a non-pre-processing pre-processing, which does not involve data preparation when executed. Since data preparation may cause inconsistent node returns, a pre-processing item including data preparation may be marked with a preset identifier to distinguish the first pre-processing item from the second pre-processing item.

[0140] For example, the pre-processing items of the pre-processing may be marked with a preset flag preFlag=1 or "preFlag is true", while the pre-processing items of the non-pre-processing may not be marked.

[0141] When executing the target reorganization process, all nodes to be checked configured with the first pre-processing item in the target reorganization process are first determined according to the preset identifier, and pre-processing is performed on the nodes to be checked according to the first pre-processing item in the order of nodes. After the pre-processing of all nodes to be checked configured with the first pre-processing item is completed, all nodes to be checked configured with the second pre-processing item in the target reorganization process are determined, and pre-processing is performed on the nodes to be checked according to the second pre-processing item in the order of nodes.

[0142] After the first pre-processing item and the second pre-processing item are executed, post-processing is performed on all nodes to be verified in the reorganization process in order. After the post-processing is completed, a post-check is performed on the nodes to be verified according to the recorded data of the pre-processing and post-processing of each node to be verified. The verification result of the target reorganization process is obtained according to the first execution result of the pre-processing, the second execution result of the post-processing, and the third execution result of the post-check, and the verification result of the target reorganization process is used as the verification result of the process to be verified.

[0143] In the above embodiment, by marking the pre-processing items with preset identifiers, all pre-processing items can be executed first to avoid causing data changes that affect the verification results of the nodes to be verified, ensuring the accuracy of the verification of the target reorganization process, and further ensuring the accuracy of the verification of the process to be verified.

[0144] This application also provides a specific embodiment, please refer to Figure 3 . Figure 3 An example of a process to be verified is given, and this embodiment is explained by taking the application of the process verification method to the verification of the process to be verified as an example.

[0145] exist Figure 3 The process to be verified shown includes 5 nodes: Node A, Node B, Node C, Node D and Start Node. Node A, Node B, Node C and Node D are nodes to be verified. Node A calls Interface A and Interface G during execution, where Interface G can query Parameter A and return. If the query of Interface G is abnormal, such as when querying Parameter A.name, the return value is null or empty, then the feedback information of abnormal termination of the process is returned and the process is terminated. After the call to Interface G is finished, Node B is entered. Node B calls Interface B during execution, and uses the queried Parameter A to query the data table for verification, and then feedbacks the condition parameter. According to the different values ​​of the condition parameter returned by Interface B, Node C or Node D is entered. For example, when the value of the condition parameter returned by Interface B is equal to 1, Node C is entered, and Node C calls Interface C to store Table C during execution; when the value of the condition parameter returned by Interface B is not equal to 1, Node D is entered, and Node D calls Interface D to store Table D during execution. The condition parameter can be a code value.

[0146] The specific embodiment of the process verification method includes the following steps:

[0147] 1. Add process to the database

[0148] See also Figure 4 ,Will Figure 3 The name of the process to be verified is defined as "Process B", which is added to the process table stored in the database. The number of Process B is 2.

[0149] 2. Add nodes to the library

[0150] Store the process nodes of process B in the process node table of the database. For example, if the process node table already has the node Node1 of process A, set the corresponding node numbers for the A node, B node, C node, D node and the start node of process B (where Node represents a node and StarFlow represents a start node), add them to the process node table, and store them in the database, such as Figure 5 In the process node table, a ranking can be set for each node to be verified according to the execution order of the node to be verified in process B.

[0151] 3. Configure access check items and post-check items

[0152] Admission check items and post-check items are node-level configuration items, so they can be directly configured in the process node table, such as Figure 5 As shown. Verifiers can configure access verification items and post-check items for each process node according to the execution logic of each process node and the data processing involved, and store them in the process node table.

[0153] For example, in process B, the start node needs to verify the interface output parameters, so a post-check item for verifying the interface output parameters is configured for the start node; the C interface corresponding to the C node will be executed only when the condition parameter code returned by the B interface corresponding to the B node is equal to 1, so the access check item NodeB.code=1 can be configured, and the same is true for NodeD; the C node will store table C (tmpC) when calling the C interface, so a post-check item for verifying the field value of table C is configured for the C node.

[0154] Another example is the JSON parsing in the post-check: such as {"parse path":"$.tmpC.field1","type":"variable","value":"$.mockG.name","condition":"code=1"}, which means that if and only if the condition parameter code=1 is met, the value (parse path) of the field1 field in the processing result of table C (tmpC) with uniKey is obtained from the pre-processing and post-processing, and it is determined whether its value is equal to the parsed result of the value field (that is, the name in the data of mockG with uniKey). When the type is a constant, it is determined that the value of the parse path is directly equal to a constant value.

[0155] The admission check items and post-check items configured for each node to be checked are as follows: Figure 5 shown.

[0156] 4. Configure pre-processing items

[0157] Pre-processing involves the preparation of pre-data for each node. Pre-processing items correspond to various pre-processing items of the node. They are configuration items at the use case level. A node can have multiple pre-processing items. Figure 6 As shown, a pre-processing item configuration table for process B can be established. The verification personnel can prepare corresponding pre-processing items for the nodes to be verified based on the data involved in the nodes to be verified, and store the configured pre-processing items together with the node labels of the corresponding nodes to be verified in the pre-processing configuration table, number each pre-processing item, and mark the pre-processed pre-processing items with the preset identifier Preflag:true.

[0158] Please also read Figure 3 and Figure 6 , where pre-preparation items are added to nodes A and B. For example, the A parameter queried by node A is name. Since node A depends on interface G, two pre-processing items are configured for node A (number 2, number 3, and number 4 in the figure), which respectively indicate the call results when interface G returns a normal value, returns name as Null, and does not return name. Pre-processing item number 3 indicates that when name is returned as null, interface A executes abnormally and the process terminates. Similarly, the two sets of data in the data table that node B depends on are configured as pre-processing items, and the conditional parameter code values ​​of the two pre-processing items are 1 and 2, respectively. In addition, the interface call needs to be executed when the start node is started, so the interface address and input parameter pre-processing items used to start the process are configured for the start node.

[0159] 5. Configure post-processing items

[0160] Post-processing items involve the execution content of the node. Figure 7As shown, a post-processing item configuration table of process B is established. The verification personnel can configure the corresponding post-processing items for the nodes to be verified according to the execution content of the nodes to be verified, and store the configured post-processing items together with the node numbers of the corresponding nodes to be verified in the post-processing configuration table, and number each post-processing item.

[0161] Please also read Figure 3 and Figure 7 When nodes C and D are executed, two SQL tables (table C and table D) will be inserted. Therefore, post-processing items for table lookup can be configured for nodes C and D respectively.

[0162] 6. Process Reengineering

[0163] The above steps 1 to 5 are the configuration process of each configuration item. After preparation, traverse Figure 5 The process node table shown and Figure 6 The pre-processing item configuration table shown is used to reorganize the process for the nodes to be verified in process B. First, an empty reorganized process set can be generated, and the reorganized process set can exist in the form of a reorganized process table.

[0164] Among them, based on the number of pre-processing items of node A, which is 3, three reorganization processes to be generated are determined. At this time, the three reorganization processes only include the starting node A. The three pre-processing items of node A are respectively associated with the A nodes of these three reorganization processes, so that the A node of each reorganization process is associated with different pre-processing items.

[0165] Then, follow Figure 5 The order in the process node table shown in the figure traverses all nodes to be checked in process B, takes node A as an added node, takes nodes B, C and D as unadded nodes, and takes node B as a node to be added. At this time, the added nodes of the three reorganization processes are all node A. According to the conditional parameter code value in the pre-processing item of node A in the three reorganization processes, the access check item of node B is checked. Since the A parameter name returned by the interface in the pre-processing items of node A in two reorganization processes (pre-processing items corresponding to numbers 3 and 4 respectively) is null or empty, the access check item of node B fails to pass the check, so these two reorganization processes have no downstream links; and the pre-processing item corresponding to number 2 makes the access check item of node B pass the check, and then, the A node associated with the pre-processing item number 2 is used as the forward node of node B, that is, node B is added to the reorganization process where node A is located.

[0166] According to the pre-processing item configuration table, it can be determined that the number of pre-processing items of node B is 2, and then the reorganization process linked to node B is copied to obtain a corresponding copied reorganization process, and the two pre-processing items of node B are respectively associated with the reorganization process where node A of the pre-processing item numbered 2 is located or the copied reorganization process.

[0167] At this point, node B has been added to the corresponding reorganization process. Return to execute the step of traversing all the nodes to be verified in process B. According to the way node B is added, node C and node D are also added to the corresponding reorganization process in turn, until all the nodes to be verified in process B in the process node table are added to the corresponding reorganization process, and finally the target reorganization process is generated.

[0168] Optionally, two target reorganization processes without downstream links can be deleted, so that Figure 3 The process to be verified shown can obtain 4 target reorganization processes, such as Figure 8 As shown in the figure, each target reorganization process does not contain any process branches and only has a unique direction.

[0169] 7. Execute verification

[0170] After obtaining the target reorganization process, the verification of process B can be achieved by executing the target reorganization process.

[0171] See also Fig. 9 When executing the target reorganization process, you can specify or randomly select a target reorganization process to execute, and execute each node in the order of the nodes in each reorganization process. Optionally, each target reorganization process can be executed simultaneously to further improve the efficiency of process verification.

[0172] When executing a node, the pre-processing items with preFlag set to true are executed first, and then other pre-processing items are executed. After the pre-processing items are executed, the post-processing items are executed. Post-processing items are generally table operations, such as querying the corresponding SQL table.

[0173] After the pre-processing items and post-processing items are executed, the post-check items are executed according to the data recorded when executing the pre-processing items and post-processing items (such as input parameters and output parameters). When executing the post-check items, first determine whether the conditions of the post-check are met. If they are met, the verification is performed, otherwise they are not performed. Verification supports two methods: variables and constants. Variables are the parsed results of the json path in value, and constants use value as a constant value to compare the parsed results of the parsed path. The input and output parameters, execution results, etc. of the pre-processing, post-processing, and post-processing of each node are stored in the database. According to the execution results of each process, the verification results of the target reorganization process can be obtained, and the verification results of the target reorganization process can be used as the verification results of process B.

[0174] Generate a verification report for process B based on the verification results and related execution results, execution record data, etc., and display the verification report on the page or send the verification report to the verification personnel.

[0175] By performing process verification through the process verification method of the present application, the process to be verified can be reorganized into target reorganization processes that do not contain process branches and only have unique process directions. Each target reorganization process is executed in parallel, and the structure of each target reorganization process is simplified to the maximum. Since there are no process branches, there is no need for human participation in controlling the direction of process execution, and computer equipment does not need to spend a lot of time to determine which branch to execute, and there is no risk of missing a branch, which improves the efficiency and accuracy of process verification and saves computing resources.

[0176] It should be understood that, although the steps in the flowcharts involved in the above embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps is not strictly limited in order, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above embodiments may include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0177] Based on the same inventive concept, the embodiment of the present application also provides a process verification device for implementing the process verification method involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in one or more process verification device embodiments provided below can refer to the limitations on the process verification method above, and will not be repeated here.

[0178] In an exemplary embodiment, Fig.10 As shown, a process verification device is provided, including: a process determination module 701, a node determination module 702, a node addition module 703 and a process verification module 704, wherein:

[0179] A process determination module 701 is used to determine a reorganization process according to the number of pre-processing items of the nodes to be verified in the process to be verified;

[0180] A node determination module 702 is used to take the node to be verified as the node to be added, and determine the forward node of the node to be added from the added nodes based on the condition parameters in the pre-processing items of the added nodes;

[0181] A node adding module 703, used to add the node to be added to the reorganization process where the forward node is located, to generate a target reorganization process;

[0182] The process verification module 704 is used to execute the target reorganization process, obtain the verification result of the target reorganization process, and use the verification result of the target reorganization process as the verification result of the process to be verified.

[0183] In one embodiment, when determining the reorganization process according to the number of pre-processing items of the nodes to be verified in the process to be verified, the process determination module 701 is further used to:

[0184] Determine the number M of pre-processing items of the first node to be verified among the nodes to be verified; determine the number of reorganization processes to be M, and add the first node to be verified as the starting point of the M reorganization processes to the M reorganization processes, and associate each pre-processing item of the first node to be verified with at least one reorganization process.

[0185] In one embodiment, the added node is a node to be checked that has been added to the reorganization process, and the node to be added is configured with an admission check item; when determining the forward node of the node to be added from the added node based on the conditional parameters in the pre-processing item of the added node, the node determination module 702 is further used to:

[0186] For each reorganization process, the admission check item of the node to be added is checked according to the conditional parameters in the pre-processing item of the added node; if the admission check item of the node to be added passes the check, the added node is determined as the forward node of the node to be added.

[0187] In one embodiment, the conditional parameter is a parameter for realizing logical association and conditional control between different nodes to be verified, and the admission verification item includes conditional restrictions on the conditional parameter. When verifying the admission verification item of the node to be added according to the conditional parameter in the pre-processing item of the node to be added, the node determination module 702 is further used to:

[0188] Check whether the condition parameter satisfies the condition limit of the condition parameter in the admission check item; if satisfied, it is determined that the admission check item of the node to be added has passed.

[0189] In one embodiment, when adding the node to be added to the reorganization process where the forward node is located to generate the target reorganization process, the node adding module 703 is further used to:

[0190] Add the node to be added to the reorganization process where the forward node is located; based on the number of pre-processing items of the node to be added, copy the reorganization process where the forward node is located to obtain the corresponding copied reorganization process; associate the pre-processing items of the node to be added with at least one reorganization process or the corresponding copied reorganization process to obtain the target reorganization process.

[0191] In one embodiment, when executing the target reorganization process and obtaining the verification result of the target reorganization process, the process verification module 704 is further used to:

[0192] For the node to be verified in the target reorganization process, if the node to be verified is configured with a pre-processing item, pre-processing is performed on the node to be verified according to the pre-processing item to obtain a first execution result; if the node to be verified is configured with a post-processing item, post-processing is performed on the node to be verified according to the post-processing item to obtain a second execution result; if the node to be verified is configured with a post-check item, a post-check is performed on the node to be verified according to the recorded data when the node to be verified performs pre-processing and post-processing, and the post-check item, to obtain a third execution result; based on the first execution result, the second execution result and the third execution result, the verification result of the target reorganization process is obtained.

[0193] In one embodiment, the pre-processing item includes a first pre-processing item and a second pre-processing item, the first pre-processing item includes a preset identifier, and the preset identifier is used to mark the pre-processing item including data preparation; when executing the target reorganization process, the process verification module 704 is also used to:

[0194] For the nodes to be checked that are configured with the first pre-processing item in the target reorganization process, pre-processing is performed on the nodes to be checked according to the first pre-processing item; after the pre-processing of the nodes to be checked that are configured with the first pre-processing item is completed, for the nodes to be checked that are configured with the second pre-processing item in the target reorganization process, pre-processing is performed on the nodes to be checked according to the second pre-processing item.

[0195] In the above-mentioned process verification device, the process determination module 701 determines the reorganization process according to the number of pre-processing items of the node to be verified in the process to be verified; the node determination module 702 takes the node to be verified as the node to be added, and determines the forward node of the node to be added from the added node based on the conditional parameters in the pre-processing items of the added node; the node adding module 703 adds the node to be added to the reorganization process where the forward node is located, and generates a target reorganization process; the process verification module 704 executes the target reorganization process, obtains the verification result of the target reorganization process, and uses the verification result of the target reorganization process as the verification result of the process to be verified. Since the pre-processing is the preparation before the node is executed, which affects the result of the node output, the process can be reorganized based on the pre-processing items configured for the node, and the target reorganization process can be obtained. The automatic verification of the process is realized by executing the target reorganization process.

[0196] Each module in the above-mentioned process verification device can be implemented in whole or in part by software, hardware and a combination thereof. Each of the above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory in the computer device in the form of software, so that the processor can call and execute the operations corresponding to each of the above modules.

[0197] Terms such as "component", "module", and "system" are intended to refer to a computer-related entity, which can be hardware, a combination of hardware and software, software, or software in execution. For example, a component can be, but is not limited to, a process running on a processor, a processor, an object, an executable code, a thread of execution, a program, and / or a computer. As an illustration, both a running program running on a server and a server can be a component. One or more components can reside in a process and / or a thread of execution, and a component can be located in one computer and / or distributed between two or more computers.

[0198] In an exemplary embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as shown in FIG. Fig.11As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. Among them, the processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile computer-readable storage medium and an internal memory. The non-volatile computer-readable storage medium stores an operating system, computer-readable instructions and a database. The internal memory provides an environment for the operation of the operating system and computer-readable instructions in the non-volatile computer-readable storage medium. The database of the computer device can be used to store the process to be verified and the reorganization process, the target reorganization process, the verification results, and the configured pre-processing items, post-processing items, access verification items, post-check items, etc. The input / output interface of the computer device is used to exchange information between the processor and the external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer-readable instructions are executed by the processor, the process verification method is implemented.

[0199] In an exemplary embodiment, a computer device is provided. The computer device may be a terminal, and its internal structure diagram may be as shown in FIG. Fig.12 As shown. The computer device includes a processor, a memory, an input / output interface, a communication interface, a display unit and an input device. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface, the display unit and the input device are connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile computer-readable storage medium and an internal memory. The non-volatile computer-readable storage medium stores an operating system and computer-readable instructions. The internal memory provides an environment for the operation of the operating system and computer-readable instructions in the non-volatile computer-readable storage medium. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be implemented through WIFI, a mobile cellular network, near field communication (NFC) or other technologies. When the computer-readable instructions are executed by the processor, a process verification method is implemented. The display unit of the computer device is used to form a visually visible picture, which can be a display screen, a projection device or a virtual reality imaging device. The display screen can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device can be a touch layer covering the display screen, or a button, trackball or touchpad set on the computer device shell, or an external keyboard, touchpad or mouse.

[0200] Those skilled in the art will understand that Fig.11 , 12 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0201] In one embodiment, a computer device is further provided, including a memory and a processor, wherein the memory stores computer-readable instructions, and the processor implements the steps in the above-mentioned method embodiments when executing the computer-readable instructions.

[0202] In one embodiment, a computer-readable storage medium is provided, which stores computer-readable instructions. When the computer-readable instructions are executed by a processor, the steps in the above-mentioned method embodiments are implemented.

[0203] In one embodiment, a computer program product is provided, the computer program product comprising computer-readable instructions, the computer-readable instructions being stored in a computer-readable storage medium. A processor of a computer device reads the computer-readable instructions from the computer-readable storage medium, and the processor executes the computer-readable instructions, so that the computer device performs the steps in the above-mentioned method embodiments.

[0204] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through computer-readable instructions, and the computer-readable instructions can be stored in a non-volatile computer-readable storage medium. When the computer-readable instructions are executed, they can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in this application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0205] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0206] The above embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A process verification method, characterized in that: include: Determine the reorganization process according to the number of pre-processing items of the nodes to be verified in the process to be verified; Taking the node to be checked as a node to be added, and determining a forward node of the node to be added from the added nodes based on the conditional parameters in the pre-processing items of the added nodes; Adding the node to be added to the reorganization process where the forward node is located to generate a target reorganization process; The target reorganization process is executed to obtain a verification result of the target reorganization process, and the verification result of the target reorganization process is used as the verification result of the process to be verified.

2. The method according to claim 1, characterized in that The step of determining the reorganization process according to the number of pre-processing items of the nodes to be verified in the process to be verified includes: Determine the number M of pre-processing items of the first node to be verified among the nodes to be verified; The number of the reorganization processes is determined to be M, and the first node to be verified is added to the M reorganization processes as a starting point of the M reorganization processes, and each pre-processing item of the first node to be verified is associated with at least one reorganization process.

3. The method according to claim 1, characterized in that The added node is a node to be checked that has been added to the reorganization process, and the node to be added is configured with an admission check item; the determining the forward node of the node to be added from the added node based on the conditional parameter in the pre-processing item of the added node includes: For each reorganization process, the admission check item of the node to be added is checked according to the conditional parameters in the pre-processing item of the node that has been added; If the admission check item of the node to be added passes the check, the added node is determined as the forward node of the node to be added.

4. The method according to claim 3, characterized in that The conditional parameter is a parameter for realizing logical association and conditional control between different nodes to be verified, the admission verification item includes conditional restrictions for the conditional parameter, and the admission verification item of the node to be added is verified according to the conditional parameter in the pre-processing item of the node to be added, including: Verifying whether the conditional parameters satisfy the conditional limitations on the conditional parameters in the access verification item; If satisfied, it is determined that the admission check item of the node to be added has passed.

5. The method according to claim 1, characterized in that: The step of adding the node to be added to the reorganization process where the forward node is located to generate a target reorganization process includes: Adding the node to be added to the reorganization process where the forward node is located; Based on the number of pre-processing items of the node to be added, the reorganization process where the forward node is located is copied to obtain a corresponding copied reorganization process; The pre-processing items of the to-be-added nodes are respectively associated with at least one reorganization process or a corresponding copy reorganization process to obtain the target reorganization process.

6. The method according to any one of claims 1 to 5, characterized in that: The executing the target reorganization process to obtain a verification result of the target reorganization process includes: For the node to be verified in the target reorganization process, if the node to be verified is configured with a pre-processing item, pre-processing is performed on the node to be verified according to the pre-processing item to obtain a first execution result; If the node to be checked is configured with a post-processing item, performing post-processing on the node to be checked according to the post-processing item to obtain a second execution result; If the node to be checked is configured with a post-check item, performing a post-check on the node to be checked according to the recorded data when the node to be checked performs pre-processing and post-processing, and the post-check item, to obtain a third execution result; A verification result of the target reorganization process is obtained according to the first execution result, the second execution result and the third execution result.

7. The method according to any one of claims 1 to 5, characterized in that: The pre-processing item includes a first pre-processing item and a second pre-processing item, the first pre-processing item includes a preset identifier, and the preset identifier is used to mark the pre-processing item including data preparation; The executing the target reorganization process includes: For a node to be checked that is configured with a first pre-processing item in the target reorganization process, performing pre-processing on the node to be checked according to the first pre-processing item; After the pre-processing of the node to be checked configured with the first pre-processing item is completed, for the node to be checked configured with the second pre-processing item in the target reorganization process, pre-processing is performed on the node to be checked according to the second pre-processing item.

8. A process verification device, characterized in that: include: A process determination module, used to determine the reorganization process according to the number of pre-processing items of the nodes to be verified in the process to be verified; A node determination module, used to take the node to be verified as a node to be added, and determine a forward node of the node to be added from the added nodes based on a condition parameter in a pre-processing item of the added node; A node adding module, used for adding the node to be added to the reorganization process where the forward node is located, to generate a target reorganization process; The process verification module is used to execute the target reorganization process, obtain the verification result of the target reorganization process, and use the verification result of the target reorganization process as the verification result of the process to be verified.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

11. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

Images