CN116501374A - Data processing method, apparatus and computer readable storage medium - Google Patents

Data processing method, apparatus and computer readable storage medium Download PDF

Info

Publication number
CN116501374A
CN116501374A CN202310532179.4A CN202310532179A CN116501374A CN 116501374 A CN116501374 A CN 116501374A CN 202310532179 A CN202310532179 A CN 202310532179A CN 116501374 A CN116501374 A CN 116501374A
Authority
CN
China
Prior art keywords
atomic
code
processed
hash value
atomic code
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202310532179.4A
Other languages
Chinese (zh)
Inventor
李启坤
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jingdong Technology Information Technology Co Ltd
Original Assignee
Jingdong Technology Information Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Jingdong Technology Information Technology Co Ltd filed Critical Jingdong Technology Information Technology Co Ltd
Priority to CN202310532179.4A priority Critical patent/CN116501374A/en
Publication of CN116501374A publication Critical patent/CN116501374A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/70—Software maintenance or management
    • G06F8/71—Version control; Configuration management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
    • G06F21/12—Protecting executable software
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformation of program code
    • G06F8/41—Compilation
    • G06F8/44—Encoding
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

The present disclosure relates to a data processing method, apparatus, and computer readable storage medium, and relates to the field of computer technology. The present disclosure includes: acquiring an atomic code to be processed, wherein the atomic code to be processed is a minimum function with single method and single responsibility; generating fingerprint information according to the atomic code to be processed; determining whether stored atomic codes which are repeated with the atomic codes to be processed exist according to fingerprint information of the atomic codes to be processed; and under the condition that the stored atomic code which is repeated with the atomic code to be processed does not exist, the atomic code to be processed and fingerprint information of the atomic code to be processed are correspondingly stored.

Description

Data processing method, apparatus and computer readable storage medium
Technical Field
The present disclosure relates to the field of computer technology, and in particular, to a data processing method, apparatus, and computer readable storage medium.
Background
Currently, for development of applications, developers typically develop programs locally or on the cloud through programming software. Programming software such as IDE (Integrated Development Environment ) and the like.
After the developer completes the writing of the codes, the codes are stored in the form of files.
Disclosure of Invention
The inventors found that: because of the huge number of research personnel, repeated codes are inevitably caused, and repeated management of the codes cannot be effectively realized by storing the codes in a file form. The repeated code occupies a large amount of resources, and effective utilization and management of the code cannot be realized.
One technical problem to be solved by the present disclosure is: how to reduce the occupation of the code storage to the resources and improve the management efficiency of the codes.
According to some embodiments of the present disclosure, there is provided a data processing method including: acquiring an atomic code to be processed, wherein the atomic code to be processed is a minimum function with single method and single responsibility; generating fingerprint information according to the atomic code to be processed; determining whether stored atomic codes which are repeated with the atomic codes to be processed exist according to fingerprint information of the atomic codes to be processed; and under the condition that the stored atomic code which is repeated with the atomic code to be processed does not exist, the atomic code to be processed and fingerprint information of the atomic code to be processed are correspondingly stored.
In some embodiments, generating fingerprint information from the atomic code to be processed includes: performing character string splicing on the atomic codes to be processed; and respectively generating at least one of a first hash value and a second hash value according to the positive sequence and the reverse sequence of the spliced character strings of the atomic codes to be processed, and taking the at least one of the first hash value and the second hash value as fingerprint information of the atomic codes to be processed.
In some embodiments, determining whether there is stored atomic code that is duplicative of atomic code to be processed includes at least one of: comparing the first hash value of the atomic code to be processed with the first hash value of the stored atomic code, and if the first hash value is consistent with the first hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists; and comparing the second hash value of the atomic code to be processed with the second hash value of the stored atomic code, and if the second hash value is consistent with the second hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists.
In some embodiments, generating fingerprint information from the atomic code to be processed further comprises: replacing class names, method names and constant names in the atomic codes to be processed with preset class names, preset method names and preset constant names respectively to obtain mixed atomic codes; performing character string splicing on the mixed atomic codes; and respectively generating at least one of a third hash value and a fourth hash value according to the positive sequence and the reverse sequence of the spliced character strings of the mixed atomic codes, and taking the at least one of the third hash value and the fourth hash value as fingerprint information of the atomic codes to be processed.
In some embodiments, in the event that the first hash value of the atomic code to be processed is inconsistent with the first hash value comparison of the stored atomic code and/or the second hash value of the atomic code to be processed is inconsistent with the second hash value comparison of the stored atomic code, determining whether there is stored atomic code that is duplicative of the atomic code to be processed further comprises at least one of: comparing the third hash value of the atomic code to be processed with the third hash value of the stored atomic code, and if the third hash value is consistent with the third hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists; and comparing the fourth hash value of the atomic code to be processed with the fourth hash value of the stored atomic code, and if the fourth hash value is consistent with the fourth hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists.
In some embodiments, generating fingerprint information from the atomic code to be processed further comprises: compiling the confused atomic codes to generate byte codes; and generating a fifth hash value according to the byte code as fingerprint information of the atomic code to be processed.
In some embodiments, in the event that the third hash value of the atomic code to be processed is inconsistent with the third hash value comparison of the stored atomic code and/or the fourth hash value of the atomic code to be processed is inconsistent with the fourth hash value comparison of the stored atomic code, determining whether there is stored atomic code that is duplicative of the atomic code to be processed further comprises: and comparing the fifth hash value of the atomic code to be processed with the fifth hash value of the stored atomic code, and if the fifth hash value is consistent with the fifth hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists.
In some embodiments, the method further comprises: generating tamper-resistant codes of the atomic codes to be processed; and storing the tamper-proof code of the atomic code to be processed and the atomic code to be processed correspondingly.
In some embodiments, generating the encoding of the atomic code to be processed includes: performing character string splicing on the atomic codes to be processed; and according to the message digest algorithm MD5, the spliced character strings of the atomic codes to be processed are respectively generated into a first code and a second code according to the positive sequence and the reverse sequence, and the first code and the second code are used as tamper-proof codes of the atomic codes to be processed.
In some embodiments, the method further comprises: and under the condition that the atomic code to be processed is applied, generating a verification code according to the atomic code to be processed, comparing the verification code with the tamper-proof code of the atomic code to be processed, and determining whether the atomic code to be processed is changed.
In some embodiments, the method further comprises: determining whether modification of the atomic code to be processed is legal modification or not according to authority information of an operator; regenerating a tamper-resistant code of the atomic code to be processed in response to a legal modification of the atomic code to be processed; and correspondingly storing the regenerated tamper-proof code and the atomic code to be processed.
In some embodiments, the method further comprises: receiving label information input by an operator, wherein the label information comprises: at least one item of information of operators and processing information of atomic codes to be processed; correspondingly storing the tag information and the atomic code to be processed; and responding to the viewing request of the atomic code to be processed, and displaying the tag information.
In some embodiments, obtaining the atomic code to be processed includes: responding to the creation request, and creating a flow of the application; and responding to the call of the editing tool, editing the code according to the flow, and obtaining the atomic code to be processed.
In some embodiments, the method further comprises: and combining and compiling all the atomic codes corresponding to the flow to generate the flow code.
In some embodiments, the method further comprises: responding to the call of the testing tool, and testing at least one of the atomic code to be processed, the method containing the atomic code to be processed and the flow code containing the atomic code to be processed; in the event that the test is complete, the flow code containing the atomic code to be processed is packaged into one or more modes in response to the call of the packaging tool.
In some embodiments, the method further comprises: recording the performance index of the atomic code to be processed, wherein the performance index comprises: editing at least one of duration, length, number of calls, test coverage, error rate, readability, and operator scoring; determining a performance value according to the performance index of the atomic code to be processed; in response to the performance review request, a performance value of the atomic code to be processed is displayed.
According to further embodiments of the present disclosure, there is provided a data processing apparatus including: the acquisition module is used for acquiring the atomic code to be processed, wherein the atomic code to be processed is a minimum function with single method and single responsibility; the generation module is used for generating fingerprint information according to the atomic codes to be processed; the determining module is used for determining whether stored atomic codes which are repeated with the atomic codes to be processed exist or not according to fingerprint information of the atomic codes to be processed; and the storage module is used for correspondingly storing the atomic code to be processed and fingerprint information of the atomic code to be processed under the condition that the stored atomic code which is repeated with the atomic code to be processed does not exist.
According to still further embodiments of the present disclosure, there is provided a data processing apparatus including: a processor; and a memory coupled to the processor for storing instructions that, when executed by the processor, cause the processor to perform the data processing method of any of the embodiments described above.
According to still further embodiments of the present disclosure, a non-transitory computer-readable storage medium is provided, on which a computer program is stored, wherein the program, when executed by a processor, implements the data processing method of any of the previous embodiments.
According to the method and the device, the atomic code to be processed is obtained, whether the atomic code to be processed is repeated with the stored atomic code or not is determined according to fingerprint information of the atomic code to be processed, and if the atomic code to be processed is not repeated, the atomic code to be processed and the fingerprint information are stored. Because the atomic codes are the minimum functions with single method and single responsibility, whether repeated codes exist can be effectively judged aiming at the atomic codes, the original file storage form is replaced, the structured storage form is adopted, each section of atomic codes has unique fingerprint information, the storage of the repeated codes can be effectively avoided, the occupation of the code storage to resources is reduced, and the management efficiency of the codes is improved.
Other features of the present disclosure and its advantages will become apparent from the following detailed description of exemplary embodiments of the disclosure, which proceeds with reference to the accompanying drawings.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present disclosure, and other drawings may be obtained according to these drawings without inventive effort to a person of ordinary skill in the art.
Fig. 1 illustrates a flow diagram of a data processing method of some embodiments of the present disclosure.
Fig. 2 shows a flow diagram of a data processing method of other embodiments of the present disclosure.
Fig. 3 illustrates a schematic diagram of the structure of a chain code platform of some embodiments of the present disclosure.
Fig. 4 illustrates a functional schematic of a chain code platform of some embodiments of the present disclosure.
Fig. 5 illustrates a schematic diagram of a data processing apparatus of some embodiments of the present disclosure.
Fig. 6 shows a schematic structural view of a data processing apparatus of other embodiments of the present disclosure.
Fig. 7 shows a schematic structural diagram of a data processing apparatus of further embodiments of the present disclosure.
Detailed Description
The following description of the technical solutions in the embodiments of the present disclosure will be made clearly and completely with reference to the accompanying drawings in the embodiments of the present disclosure, and it is apparent that the described embodiments are only some embodiments of the present disclosure, not all embodiments. The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses. Based on the embodiments in this disclosure, all other embodiments that a person of ordinary skill in the art would obtain without making any inventive effort are within the scope of protection of this disclosure.
The present disclosure provides a data processing method, described below in connection with fig. 1-4.
FIG. 1 is a flow chart of some embodiments of the disclosed data processing method. As shown in fig. 1, the method of this embodiment includes: steps S102 to S108.
In step S102, an atomic code to be processed is acquired.
The atomic code to be processed is a minimum function that is single in method and single in responsibility, such as Java code, and is not limited to the illustrated example. In general, codes are stored in a file form, one file may contain a large number of functions (methods), repeated codes cannot be effectively identified, and common functions (methods) cannot be effectively recycled, and codes written by research and development personnel are subjected to subsequent processing in an atomic code form, so that the efficiency of identifying repeated codes can be improved, and the effectiveness of code management is improved. The atomic code to be processed may be compiled code.
In step S104, fingerprint information is generated from the atomic code to be processed.
A Hash (Hash) algorithm may be employed to generate fingerprint information for the atomic code to be processed. In some embodiments, the atomic code to be processed is subjected to character string splicing; and respectively generating at least one of a first hash value and a second hash value according to the positive sequence and the reverse sequence of the spliced character strings of the atomic codes to be processed, and taking the at least one of the first hash value and the second hash value as fingerprint information of the atomic codes to be processed.
And performing character string splicing processing on the atomic codes to be processed, formatting the codes, performing HASH processing, and generating two HASH values according to a positive sequence and a reverse sequence.
In other embodiments, the class name, the method name and the constant name in the atomic code to be processed are replaced by a preset class name, a preset method name and a preset constant name respectively, so as to obtain a confused atomic code; performing character string splicing on the mixed atomic codes; and respectively generating at least one of a third hash value and a fourth hash value according to the positive sequence and the reverse sequence of the spliced character strings of the mixed atomic codes, and taking the at least one of the third hash value and the fourth hash value as fingerprint information of the atomic codes to be processed.
For example, a string. Replay module may be used to obfuscate the atomic code to be processed, and obfuscate the class names, method names, and constant names of the code (e.g., using ClassA, methodA, intA, string a, etc. to replace the original class names, method names, and constant names). Some non-sensitive character strings can be replaced by preset character strings, so that the mixed atomic codes can be obtained.
In still other embodiments, the obfuscated atomic code is compiled to generate bytecodes; and generating a fifth hash value according to the byte code as fingerprint information of the atomic code to be processed.
Compiling the mixed character strings of the atomic codes to generate byte codes, for example, aiming at Java atomic codes, the character strings can be dynamically compiled based on Java compiler technology to obtain ClassBytes byte codes. The mixed atomic code desensitizes the influence of the special case character string, desensitizes and compiles according to fixed rules, and then generates a Hash value according to the compiled byte code.
Any one or more of the five hash values related to the above embodiments may be selected as fingerprint information of the atomic code to be processed. The stored fingerprint information of the atomic code is generated by the same method, and is not described in detail herein.
In step S106, it is determined whether there is a stored atomic code that is repeated with the atomic code to be processed, based on fingerprint information of the atomic code to be processed.
Comparing the fingerprint information of the atomic code to be processed with the fingerprint information of the stored atomic code, if the fingerprint information is consistent with the fingerprint information of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists, otherwise, determining that the stored atomic code which is repeated with the atomic code to be processed does not exist.
In some embodiments, in the case that at least one of the first hash value and the second hash value is fingerprint information of the atomic code to be processed, determining whether there is stored atomic code that is repeated with the atomic code to be processed includes at least one of: comparing the first hash value of the atomic code to be processed with the first hash value of the stored atomic code, and if the first hash value is consistent with the first hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists; and comparing the second hash value of the atomic code to be processed with the second hash value of the stored atomic code, and if the second hash value is consistent with the second hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists.
Further, in the event that the first hash value of the atomic code to be processed is inconsistent with the first hash value comparison of the stored atomic code and/or the second hash value of the atomic code to be processed is inconsistent with the second hash value comparison of the stored atomic code, determining whether there is stored atomic code that is duplicative of the atomic code to be processed further comprises at least one of: comparing the third hash value of the atomic code to be processed with the third hash value of the stored atomic code, and if the third hash value is consistent with the third hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists; and comparing the fourth hash value of the atomic code to be processed with the fourth hash value of the stored atomic code, and if the fourth hash value is consistent with the fourth hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists.
Further, in the case that the third hash value of the atomic code to be processed is inconsistent with the third hash value comparison of the stored atomic code and/or the fourth hash value of the atomic code to be processed is inconsistent with the fourth hash value comparison of the stored atomic code, determining whether there is a stored atomic code that is repeated with the atomic code to be processed further includes: and comparing the fifth hash value of the atomic code to be processed with the fifth hash value of the stored atomic code, and if the fifth hash value is consistent with the fifth hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists.
The above five hash values are classified into three types, the first hash value and the second hash value may be used to precisely match the atomic code to be processed with the stored atomic code, the third hash value and the fourth hash value may be used to fuzzy match the atomic code to be processed with the stored atomic code, and the fifth hash value may be used to perform more fuzzy matching. However, the matching efficiency is sequentially reduced, and the matching is sequentially performed on the three types of hash values according to the method of the embodiment, so that the efficiency and the accuracy can be improved.
In step S108, if there is no stored atomic code that is repeated with the atomic code to be processed, the atomic code to be processed and fingerprint information of the atomic code to be processed are stored correspondingly.
The atomic code and fingerprint information to be processed are stored together, so that the method has uniqueness and is similar to a blockchain mode. The original text semi-structured storage mode can be replaced by the structured storage mode.
If the first hash value and the second hash value are generated using a non-decodable and non-tamperable hash algorithm, the first hash value and/or the second hash value may be used as a tamper-resistant encoding of the atomic code to be processed. If the first hash value and the second hash value are generated by adopting a decodable or tamperable hash algorithm, tamper-proof codes of the atomic codes to be processed can be generated; and storing the tamper-proof code of the atomic code to be processed and the atomic code to be processed correspondingly. I.e. a non-decodable and non-tamperable hash algorithm is used to generate the tamper-resistant code.
In some embodiments, the atomic code to be processed is subjected to character string splicing; and according to MD5 (message digest algorithm), the spliced character strings of the atomic codes to be processed are respectively generated into a first code and/or a second code according to the positive sequence and the reverse sequence, and the first code and/or the second code are used as tamper-proof codes of the atomic codes to be processed.
In some embodiments, in the case where the atomic code to be processed is applied, a verification code is generated from the atomic code to be processed, and the verification code is compared with a tamper-resistant code of the atomic code to be processed to determine whether the atomic code to be processed is altered.
The authentication code and the tamper-resistant code are generated using the same algorithm. After each section of atomic code is stored, the atomic codes can be combined according to service logic to form a complete program meeting the service requirement for production application, and in order to avoid the atomic code from being tampered, the storage security of the atomic code is improved, and tamper-proof codes of the atomic code can be generated for verifying whether the atomic code is altered.
In some embodiments, determining whether the modification of the atomic code to be processed is a legal modification according to the authority information of the operator; regenerating a tamper-resistant code of the atomic code to be processed in response to a legal modification of the atomic code to be processed; and correspondingly storing the regenerated tamper-proof code and the atomic code to be processed so as to update the stored tamper-proof code.
The authority information of the operator can be determined according to the user verification information input by the operator, and whether the modification of the atomic code to be processed is legal modification is determined according to the authority information of the operator. For example, a developer of atomic code has modification rights and others do not.
Further, in response to a legal modification of the atomic code to be processed, fingerprint information of the atomic code to be processed is regenerated, and the regenerated tamper-proof code is stored in correspondence with the atomic code to be processed, so as to update the stored fingerprint information.
The method in the above embodiment obtains the atomic code to be processed, determines whether to repeat with the stored atomic code according to the fingerprint information of the atomic code to be processed, and stores the atomic code to be processed and the fingerprint information if not. Because the atomic codes are the minimum functions with single method and single responsibility, whether repeated codes exist can be effectively judged aiming at the atomic codes, the original file storage form is replaced, the structured storage form is adopted, each section of atomic codes has unique fingerprint information, the storage of the repeated codes can be effectively avoided, the occupation of the code storage to resources is reduced, and the management efficiency of the codes is improved.
The present disclosure provides a method for implementing the above embodiments by a chain code platform, and may further implement full-flow management from service creation to code writing, storage, to code testing, packaging, online, and other code lifecycles, which are described below in connection with fig. 2 to 4.
FIG. 2 is a flow chart of other embodiments of the data processing method of the present disclosure. As shown in fig. 2, the method of this embodiment includes: steps S202 to S214.
In step S202, in response to the creation request, a flow of the application is created.
An operator (e.g., a product person) may initiate a creation request through the product module to create a flow of the application. Specifically, tenants, businesses, products, applications, and flows may be created in sequence.
As shown in fig. 3, the chain code platform comprises four modules of a product, test, research and development and efficiency area, each module handles operators with different roles, supports functions of different roles, and provides basic platform services through basic platform tools.
As shown in fig. 3, an operator performs service and product maintenance through the chain code platform. And the user management module of the chain code platform completes management of tenant information. The business creation module is used for creating business information, the business line management module is used for managing the business information and carrying out regular description on business creation. The product creation module is used for creating product information at the lower layer of the business, and the product management module is used for managing products. The application creation module is used for creating the application at the lower layer of the product, and the application is managed through the application management module. Each application is followed by a set of multiple service groups, i.e., a set of flows for the next layer. The flow is created through the flow creation module, the flow information is managed through the flow management module, the display of service requirements is realized through the management of different flows, and the development of services is supported. The whole hierarchical nesting is a tenant- > business- > product- > application- > process (1- > N) model, the product is visualized through a chain code platform to set and arrange the business process, and the product needs to be designed are visually completed. Different versions of an application may correspond to different flows.
In step S204, in response to the invocation of the editing tool, the code is edited for the flow, resulting in an atomic code to be processed.
In step S206, the atomic code to be processed is stored.
After determining that there is no stored atomic code that is repeated with the atomic code to be processed by referring to the method of the foregoing embodiment, the atomic code to be processed is stored, which is not described herein. The atomic code to be processed can be packaged and issued
In step S208, all the atomic codes corresponding to the flow are combined and compiled to generate a flow code.
The program code may be packaged and published.
As shown in fig. 3, the development module mainly serves as a functional area for a developer. The chain code platform provides an editing tool (e.g., studio) that can be invoked by the function writing module to edit the atomic code for the process in response to invocation of the editing tool; the function compiling module, the function packaging module and the function publishing module are used for calling corresponding tools of the platform to compile, package and publish the atomic codes. The function storage module is used for realizing the storage process of the atomic code to be processed in the previous embodiment. All atomic codes do not allow repeated writing, ensure that the code bottommost layer with the same function in the platform is only one place, and cannot generate additional repeated codes.
And combining the atomic codes at the bottommost layer through a source code writing module to form flow codes (namely source codes) corresponding to the flow. The source code compiling module, the source code packaging module and the source code publishing module are used for compiling, packaging and publishing the source codes. The platform can also provide intelligent combination for realizing the atomic codes through the source code intelligent learning module.
The platform may also provide a Debug module for debugging the atomic code or source code to discover and modify errors.
In step S210, at least one of an atomic code to be processed, a method including the atomic code to be processed, a flow code including the atomic code to be processed, and a flow is tested in response to a call of the test tool.
In step S212, in the event that the test is completed, in response to the call of the packaging tool, the flow code containing the atomic code to be processed is packaged into one or more modes and issued.
As shown in fig. 3, the test module mainly serves as a functional area for a tester. The source code test module is used for calling a test tool (for example, white box test and black box test) to test and verify the flow code, the function test module is used for testing and verifying the atomic code, and the flow test module can test and verify the whole flow. After the test is finished, the stream codes can be packaged, released and online, the codes can be packaged into different modes, a file mode, a Class mode and a Jar mode and War mode through a basic tool, and the synchronous release of the pushing of the codes can be performed by an integrated release platform. The source code scoring authentication module, the function scoring authentication module and the flow scoring authentication module are respectively used for receiving and recording scores of the flow codes, the atomic codes and the whole flow of the testers and evaluating the effectiveness of the subsequent codes. The chain code platform can also provide a sandbox mode to perform regression testing of the online flow, and the full-flow simulation Mock, flow playback and other automatic testing functions are realized.
In step S214, at least one of the performance value of the atomic code to be processed, the performance value of the process code including the atomic code to be processed, and the performance value of the process is generated and displayed.
In some embodiments, a performance indicator of an atomic code to be processed is recorded, wherein the performance indicator comprises: editing at least one of duration, length, number of calls, test coverage, error rate, readability, and operator scoring; determining a performance value according to the performance index of the atomic code to be processed; in response to the performance review request, a performance value of the atomic code to be processed is displayed.
The performance index of the flow code includes: editing at least one of total length, number of atomic codes, number of invocations, test coverage, error rate, readability, and operator score. The performance index of the process comprises: at least one of test coverage, error rate, readability, and operator scoring.
For example, the edit duration of the atomic code (variable A), the length (variable B), the number of calls (variable C), the test coverage (variable D), the BUG rate (variable E), the readability assessment (variable F), the code review scoring, the tester scoring (variable J). And determining the efficiency value of the atomic code through the efficiency index. For example, the potency value is the weighted sum of the potency indicators, i.e., score=a (Score weight a) +b (Score weight B ') +c (Score weight C')) +d (Score weight D ')) +e (Score weight E')) +f (Score weight F ')) +j (Score weight J').
As shown in fig. 3, the performance module mainly improves view signs for operators with different roles. The research and development source code efficiency module, the research and development function efficiency module and the research and development flow efficiency module are respectively used for determining the efficiency value of source codes, the efficiency value of atomic codes and the efficiency value of flows, and are used for determining and displaying the efficiency of research and development quality. The chain code platform can also comprise a test source code efficiency module, a test function efficiency module and a test flow efficiency module according to actual requirements, and the chain code platform is used for determining and displaying the efficiency of test quality. The product flow efficiency module may be used to determine and display the efficiency of the flow creation. The chain code platform can collect indexes such as time, operator score and the like of each link, and shows performance calculation results of different dimensions aiming at different roles.
In some embodiments, label information input by an operator is received, wherein the label information comprises: information of operators and processing information; correspondingly storing the tag information and the atomic code to be processed; and responding to the viewing request of the atomic code to be processed, and displaying the tag information. For example, the tag information includes descriptions and marks of current atomic codes by operators in each link, such as identification of the operators, and processing information obtained by processing procedures such as execution efficiency, BUG repair rate, method reference number, and the like.
For an atomic code segment, the most comprehensive stored information includes: the atomic code, fingerprint information, tag information, and ID of the atomic code. The ID of an atomic code may be used to query the atomic code.
The efficiency module can also receive tag information added by a developer and display various tag information. For example, multi-dimensional label display may be performed on a label model corresponding to a developer, a label model corresponding to a tester, a label model corresponding to a product person, and the like.
The function of the chain code platform is briefly described below in connection with fig. 4.
As shown in FIG. 4, the chain code platform provides Web services, different Web interfaces can be provided for different roles, and a browser user logs on the platform to perform operation and management of various processes. In some embodiments, the chain code platform receives user authentication information of an operator, determines authority information of the operator, and provides a corresponding interface for the operator according to the authority information of the operator.
The second layer of the chain code platform is an externally provided tool layer, for example, a basic service for providing services of editing tools, products and tests and developing, carrying out full-set user management through a unified user service set, and carrying out unified authority management on the authority platform through a unified authority service.
The third layer of the chain code platform is a basic capability set, and the BPMN service is used for providing BPMN (Business Process Modeling Notation, business process modeling and labeling) standard process analysis and definition; the chain code compiling service, the chain code packaging service and the chain code publishing service are used for compiling, packaging and publishing the atomic codes and the like, and the chain code arranging service provides a process arranging service combining the atomic codes with the BPMN; the chain code storage service provides storage service of atomic codes, and the efficiency intelligent service provides determination and display of efficiency values and label information of various dimensions.
The fourth layer of the chain code platform is a storage layer, and mainly comprises storage of business product flow modules of product lines, code storage of research and development lines and test module storage of test lines. And meanwhile, the method also comprises the structural storage of the atomic codes and the source codes in the chain code platform and the file storage of the traditional codes. Two different format storage types may be performed on the atomic code.
The fifth layer of the chain code platform is a universal capability storage, comprises testing tools such as a sandbox service and the like, and comprises a class blockchain storage service for generating fingerprint information after compiling an atomic code by the chain code platform and storing the fingerprint information. The method can store the atomic codes, fingerprint information and the like in multiple parts (for example, 3 parts), does not provide Delete authority to the outside, only provides inquiry and new addition of service, is used for guaranteeing trace and unique evidence storage function of source codes, and provides effective data verification service for research and development efficiency management.
According to the method, the atomic codes and the corresponding fingerprint information are stored in a structured mode, repeated codes are not existed, the method can be used as effective research and development assets, storage resources can be effectively saved compared with the existing file storage mode, and research and development efficiency and code utilization efficiency are improved; the atomic codes can be combined with service logic through the chain code platform to fulfill the requirements of service and products; the chain code platform can effectively evaluate the quality and display the efficiency value of the atomic code, the flow code and the whole flow, and can quickly and visually check the service logic of the combined code; dynamic visualization can be realized through the chain code platform atomic codes and combinations, and the effective combination and pile inserting technology of the codes are carried out through a dynamic loading mechanism, so that unified research and development of general services are realized, and code invalidation caused by team research and development dispersion is avoided; an operator performs integrated office work through a chain code platform, and efficiently and cooperatively completes business requirements and quality authentication; through the confirmation of the atom code uniqueness of the chain code platform, repeated code fragments are avoided to repeatedly appear, and repeated waste of resources is avoided.
The present disclosure also provides a data processing apparatus, described below in connection with fig. 5.
Fig. 5 is a block diagram of some embodiments of a data processing apparatus of the present disclosure. As shown in fig. 5, the apparatus 50 of this embodiment includes: the method comprises an acquisition module 502, a generation module 504, a determination module 506 and a storage module 508.
The obtaining module 502 is configured to obtain an atomic code to be processed, where the atomic code to be processed is a minimum function with a single method and a single responsibility.
The generating module 504 is configured to generate fingerprint information according to the atomic code to be processed.
In some embodiments, the generating module 504 is configured to perform string concatenation on the atomic code to be processed; and respectively generating at least one of a first hash value and a second hash value according to the positive sequence and the reverse sequence of the spliced character strings of the atomic codes to be processed, and taking the at least one of the first hash value and the second hash value as fingerprint information of the atomic codes to be processed.
In some embodiments, the generating module 504 is configured to replace a class name, a method name, and a constant name in the atomic code to be processed with a preset class name, a preset method name, and a preset constant name, respectively, to obtain a mixed atomic code; performing character string splicing on the mixed atomic codes; and respectively generating at least one of a third hash value and a fourth hash value according to the positive sequence and the reverse sequence of the spliced character strings of the mixed atomic codes, and taking the at least one of the third hash value and the fourth hash value as fingerprint information of the atomic codes to be processed.
In some embodiments, the generating module 504 is configured to compile the obfuscated atomic code to generate bytecode; and generating a fifth hash value according to the byte code as fingerprint information of the atomic code to be processed.
The determining module 506 is configured to determine whether there is a stored atomic code that is repeated with the atomic code to be processed according to fingerprint information of the atomic code to be processed.
In some embodiments, the determination module 506 is to perform at least one of: comparing the first hash value of the atomic code to be processed with the first hash value of the stored atomic code, and if the first hash value is consistent with the first hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists; and comparing the second hash value of the atomic code to be processed with the second hash value of the stored atomic code, and if the second hash value is consistent with the second hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists.
In some embodiments, in a case where the first hash value of the atomic code to be processed is inconsistent with the first hash value comparison of the stored atomic code and/or the second hash value of the atomic code to be processed is inconsistent with the second hash value comparison of the stored atomic code, the determining module 506 is configured to perform at least one of: comparing the third hash value of the atomic code to be processed with the third hash value of the stored atomic code, and if the third hash value is consistent with the third hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists; and comparing the fourth hash value of the atomic code to be processed with the fourth hash value of the stored atomic code, and if the fourth hash value is consistent with the fourth hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists.
In some embodiments, in a case where the third hash value of the atomic code to be processed is inconsistent with the third hash value of the stored atomic code and/or the fourth hash value of the atomic code to be processed is inconsistent with the fourth hash value of the stored atomic code, the determining module 506 is configured to compare the fifth hash value of the atomic code to be processed with the fifth hash value of the stored atomic code, and if so, determine that there is a stored atomic code that is repeated with the atomic code to be processed.
The storage module 508 is configured to store the atomic code to be processed and fingerprint information of the atomic code to be processed, correspondingly, if there is no stored atomic code that is repeated with the atomic code to be processed.
In some embodiments, the generation module 504 is further configured to generate a tamper-resistant encoding of the atomic code to be processed; the storage module 508 is further configured to store the tamper-resistant code of the atomic code to be processed in correspondence with the atomic code to be processed.
In some embodiments, the generating module 504 is configured to perform string concatenation on the atomic code to be processed; and according to the message digest algorithm MD5, the spliced character strings of the atomic codes to be processed are respectively generated into a first code and a second code according to the positive sequence and the reverse sequence, and the first code and the second code are used as tamper-proof codes of the atomic codes to be processed.
In some embodiments, the apparatus further comprises: the verification module 510 is configured to, in a case where the atomic code to be processed is applied, generate a verification code according to the atomic code to be processed, compare the verification code with a tamper-proof code of the atomic code to be processed, and determine whether the atomic code to be processed is modified.
In some embodiments, the apparatus further comprises: the rights management module 512 is configured to determine whether modification of the atomic code to be processed is legal modification according to rights information of an operator; the generating module 504 is further configured to regenerate a tamper-resistant encoding of the atomic code to be processed in response to legal modification of the atomic code to be processed; the storage module 508 is further configured to store the regenerated tamper-resistant code in correspondence with the atomic code to be processed.
In some embodiments, the apparatus further comprises: the tag management module 514 and the display module 516, the tag management module 514 is configured to receive tag information input by an operator, where the tag information includes: at least one item of information of operators and processing information of atomic codes to be processed; the storage module 508 is further configured to store tag information and an atomic code to be processed in a corresponding manner; the display module 516 is configured to display tag information in response to a viewing request of the atomic code to be processed.
In some embodiments, the obtaining module 502 is configured to create a flow of the application in response to the creation request; and responding to the call of the editing tool, editing the code according to the flow, and obtaining the atomic code to be processed.
In some embodiments, the apparatus further comprises: and the combination module 518 is used for combining and compiling all the atomic codes corresponding to the flow to generate the flow code.
In some embodiments, the apparatus further comprises: a test module 520, responsive to a call of the test tool, for testing at least one of the atomic code to be processed, the method comprising the atomic code to be processed, and the flow code comprising the atomic code to be processed; in the event that the test is complete, the flow code containing the atomic code to be processed is packaged into one or more modes in response to the call of the packaging tool.
In some embodiments, the apparatus further comprises: the performance module 522 records performance metrics of the atomic code to be processed, wherein the performance metrics include: editing at least one of duration, length, number of calls, test coverage, error rate, readability, and operator scoring; determining a performance value according to the performance index of the atomic code to be processed; the display module 516 is configured to display the performance value of the atomic code to be processed in response to the performance view request.
The above modules may correspond to the modules in the chain code platform of fig. 3 according to functions, and are not described herein.
The data processing apparatus in embodiments of the present disclosure may each be implemented by various computing devices or computer systems, as described below in connection with fig. 6 and 7.
Fig. 6 is a block diagram of some embodiments of a data processing apparatus of the present disclosure. As shown in fig. 6, the apparatus 60 of this embodiment includes: a memory 610 and a processor 620 coupled to the memory 610, the processor 620 being configured to perform the data processing method in any of the embodiments of the present disclosure based on instructions stored in the memory 610.
The memory 610 may include, for example, system memory, fixed nonvolatile storage media, and the like. The system memory stores, for example, an operating system, application programs, boot Loader (Boot Loader), database, and other programs.
Fig. 7 is a block diagram of further embodiments of the data processing apparatus of the present disclosure. As shown in fig. 7, the apparatus 70 of this embodiment includes: memory 710 and processor 720 are similar to memory 710 and processor 720, respectively. Input/output interface 730, network interface 740, storage interface 750, and the like may also be included. These interfaces 730, 740, 750, as well as the memory 710 and the processor 720, may be connected by a bus 760, for example. The input/output interface 730 provides a connection interface for input/output devices such as a display, a mouse, a keyboard, a touch screen, etc. The network interface 740 provides a connection interface for various networking devices, such as may be connected to a database server or cloud storage server, or the like. Storage interface 750 provides a connection interface for external storage devices such as SD cards, U-discs, and the like.
It will be appreciated by those skilled in the art that embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable non-transitory storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It will be understood that each flowchart and/or block of the flowchart illustrations and/or block diagrams, and combinations of flowcharts and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The foregoing description of the preferred embodiments of the present disclosure is not intended to limit the disclosure, but rather to enable any modification, equivalent replacement, improvement or the like, which fall within the spirit and principles of the present disclosure.

Claims (19)

1. A data processing method, comprising:
acquiring an atomic code to be processed, wherein the atomic code to be processed is a minimum function with single method and single responsibility;
Generating fingerprint information according to the atomic code to be processed;
determining whether stored atomic codes which are repeated with the atomic codes to be processed exist according to fingerprint information of the atomic codes to be processed;
and under the condition that the stored atomic code which is repeated with the atomic code to be processed does not exist, storing the atomic code to be processed and fingerprint information of the atomic code to be processed correspondingly.
2. The data processing method according to claim 1, wherein the generating fingerprint information from the atomic code to be processed includes:
performing character string splicing on the atomic codes to be processed;
and respectively generating at least one of a first hash value and a second hash value according to the positive sequence and the reverse sequence of the spliced character strings of the atomic codes to be processed, and taking the at least one of the first hash value and the second hash value as fingerprint information of the atomic codes to be processed.
3. The data processing method of claim 1, wherein the determining whether there is stored atomic code that is repeated with the atomic code to be processed comprises at least one of:
comparing the first hash value of the atomic code to be processed with the first hash value of the stored atomic code, and if the first hash value is consistent with the first hash value of the atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists;
And comparing the second hash value of the atomic code to be processed with the second hash value of the stored atomic code, and if the second hash value is consistent with the second hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists.
4. The data processing method according to claim 2, wherein the generating fingerprint information from the atomic code to be processed further comprises:
replacing class names, method names and constant names in the atomic codes to be processed with preset class names, preset method names and preset constant names respectively to obtain mixed atomic codes;
performing character string splicing on the mixed atomic codes;
and respectively generating at least one of a third hash value and a fourth hash value according to the positive sequence and the reverse sequence of the spliced character strings of the mixed atomic codes, and taking the at least one of the third hash value and the fourth hash value as fingerprint information of the atomic codes to be processed.
5. The data processing method according to claim 2, wherein, in a case where the first hash value of the atomic code to be processed is inconsistent with the first hash value comparison of the stored atomic code, and/or the second hash value of the atomic code to be processed is inconsistent with the second hash value comparison of the stored atomic code, the determining whether there is stored atomic code that is repeated with the atomic code to be processed further includes at least one of:
Comparing the third hash value of the atomic code to be processed with the third hash value of the stored atomic code, and if the third hash value is consistent with the third hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists;
comparing the fourth hash value of the atomic code to be processed with the fourth hash value of the stored atomic code, and if the fourth hash value is consistent with the fourth hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists.
6. The data processing method of claim 4, wherein the generating fingerprint information from the atomic code to be processed further comprises:
compiling the obfuscated atomic codes to generate byte codes;
and generating a fifth hash value according to the byte code, and taking the fifth hash value as fingerprint information of the atomic code to be processed.
7. The data processing method according to claim 4, wherein in a case where the third hash value of the atomic code to be processed is inconsistent with the third hash value of the stored atomic code and/or the fourth hash value of the atomic code to be processed is inconsistent with the fourth hash value of the stored atomic code, the determining whether there is a stored atomic code that is repeated with the atomic code to be processed further includes:
Comparing the fifth hash value of the atomic code to be processed with the fifth hash value of the stored atomic code, and if the fifth hash value is consistent with the fifth hash value of the stored atomic code, determining that the stored atomic code which is repeated with the atomic code to be processed exists.
8. The data processing method of claim 1, further comprising:
generating tamper-resistant codes of the atomic codes to be processed;
and storing the tamper-proof code of the atomic code to be processed and the atomic code to be processed correspondingly.
9. The data processing method of claim 8, wherein the generating the encoding of the atomic code to be processed comprises:
performing character string splicing on the atomic codes to be processed;
and according to a message digest algorithm MD5, respectively generating a first code and a second code according to a positive sequence and a reverse sequence of the spliced character strings of the atomic codes to be processed, and using the first code and the second code as tamper-proof codes of the atomic codes to be processed.
10. The data processing method of claim 8, further comprising:
and under the condition that the atomic code to be processed is applied, generating a verification code according to the atomic code to be processed, comparing the verification code with the tamper-proof code of the atomic code to be processed, and determining whether the atomic code to be processed is changed.
11. The data processing method of claim 8, further comprising:
determining whether the modification of the atomic code to be processed is legal modification or not according to the authority information of an operator;
regenerating a tamper-resistant encoding of the atomic code to be processed in response to a legal modification of the atomic code to be processed;
and correspondingly storing the regenerated tamper-proof code and the atomic code to be processed.
12. The data processing method of claim 1, further comprising:
receiving tag information input by the operator, wherein the tag information comprises: at least one item of information of the operator and processing information of the atomic code to be processed;
correspondingly storing the tag information and the atomic code to be processed;
and responding to the viewing request of the atomic code to be processed, and displaying the tag information.
13. The data processing method of claim 1, wherein the acquiring the atomic code to be processed comprises:
responding to the creation request, and creating a flow of the application;
and responding to the call of the editing tool, editing the code for the flow, and obtaining the atomic code to be processed.
14. The data processing method of claim 13, further comprising:
and combining and compiling all the atomic codes corresponding to the flow to generate the flow code.
15. The data processing method of claim 1, further comprising:
responding to the call of a testing tool, and testing at least one of the atomic code to be processed, a method containing the atomic code to be processed and a flow code containing the atomic code to be processed;
and in the case of the completion of the test, in response to the call of the packaging tool, packaging the flow code containing the atomic code to be processed into one or more modes.
16. The data processing method of claim 1, further comprising:
recording the performance index of the atomic code to be processed, wherein the performance index comprises: editing at least one of duration, length, number of calls, test coverage, error rate, readability, and operator scoring;
determining a performance value according to the performance index of the atomic code to be processed;
and responding to the efficiency check request, and displaying the efficiency value of the atomic code to be processed.
17. A data processing apparatus comprising:
The acquisition module is used for acquiring an atomic code to be processed, wherein the atomic code to be processed is a minimum function with single method and single responsibility;
the generation module is used for generating fingerprint information according to the atomic codes to be processed;
the determining module is used for determining whether stored atomic codes which are repeated with the atomic codes to be processed exist according to the fingerprint information of the atomic codes to be processed;
and the storage module is used for correspondingly storing the atomic code to be processed and fingerprint information of the atomic code to be processed under the condition that the stored atomic code which is repeated with the atomic code to be processed does not exist.
18. A data processing apparatus comprising:
a processor; and
a memory coupled to the processor for storing instructions that, when executed by the processor, cause the processor to perform the data processing method of any of claims 1-16.
19. A non-transitory computer readable storage medium having stored thereon a computer program, wherein the program when executed by a processor implements the steps of the method of any of claims 1-16.
CN202310532179.4A 2023-05-11 2023-05-11 Data processing method, apparatus and computer readable storage medium Pending CN116501374A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310532179.4A CN116501374A (en) 2023-05-11 2023-05-11 Data processing method, apparatus and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310532179.4A CN116501374A (en) 2023-05-11 2023-05-11 Data processing method, apparatus and computer readable storage medium

Publications (1)

Publication Number Publication Date
CN116501374A true CN116501374A (en) 2023-07-28

Family

ID=87328266

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310532179.4A Pending CN116501374A (en) 2023-05-11 2023-05-11 Data processing method, apparatus and computer readable storage medium

Country Status (1)

Country Link
CN (1) CN116501374A (en)

Similar Documents

Publication Publication Date Title
US8370796B2 (en) Development tooling enablement for audit event generation
Memon Automatically repairing event sequence-based GUI test suites for regression testing
US7490319B2 (en) Testing tool comprising an automated multidimensional traceability matrix for implementing and validating complex software systems
JP5791698B2 (en) Code inspection execution system for ABAP source code
Murphy et al. Experiences with cluster and class testing
JPH10511195A (en) Object Oriented Programming Structure Testing Method and Apparatus
CN1908895B (en) System and method for application program globalization problem verification
US8656364B1 (en) System and method for enforcement of business rules using static analysis
Chen et al. Extracting and studying the Logging-Code-Issue-Introducing changes in Java-based large-scale open source software systems
CN114546868A (en) Code coverage rate testing method and device and electronic equipment
CN112131122B (en) Method and device for source code defect detection tool misinformation evaluation
von Detten et al. Reengineering component-based software systems with archimetrix
Gu et al. Logging practices in software engineering: A systematic mapping study
CN112579475A (en) Code testing method, device, equipment and readable storage medium
Elaasar et al. VPML: an approach to detect design patterns of MOF-based modeling languages
CN111258562A (en) Java code quality inspection method, device, equipment and storage medium
Abdeen et al. An approach for performance requirements verification and test environments generation
Buchgeher et al. A platform for the automated provisioning of architecture information for large-scale service-oriented software systems
CN116501374A (en) Data processing method, apparatus and computer readable storage medium
Sneed et al. The design and use of WSDL‐Test: a tool for testing Web services
Greevy et al. How developers develop features
CN115033489A (en) Code resource detection method and device, electronic equipment and storage medium
Kpodjedo et al. Recovering the evolution stable part using an ecgm algorithm: Is there a tunnel in mozilla?
Di Ruscio et al. Simulating upgrades of complex systems: The case of Free and Open Source Software
Al-Azzoni et al. A framework for the regression testing of model-to-model transformations

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination