PROGRAM CORRECTING APPARATUS, PROGRAM CORRECTING METHOD, AND PROGRAM CORRECTING PROGRAM

The program correction device evaluates patch dependencies on input values to ensure only reliable patches are proposed, addressing inefficient patch proposals in existing technologies and improving program defect correction efficiency.

JP7596213B2Active Publication Date: 2024-12-09HITACHI LTD
View PDF 8 Cites 0 Cited by

Patent Information

Application Number
JP2021085420
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Filing Date
2021-05-20
Publication Date
2024-12-09
Estimated Expiration
2041-05-20

AI Technical Summary

Technical Problem

Existing automated program repair technologies struggle to detect irregular defects that appear depending on the contents of specific variables or expressions, leading to inefficient patch proposals and additional confirmation work by software developers.

Method used

A program correction device and method that includes a modification candidate acquisition unit, execution unit, and inspection unit to evaluate how the output value of a modified program portion depends on input values, ensuring only patches that do not depend on input values are proposed as final corrections.

Benefits of technology

This approach allows for accurate correction of program defects based on internal relationships, reducing unnecessary patch proposals and resource load by identifying patches that reliably operate under various conditions.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007596213000001
    Figure 0007596213000001
  • Figure 0007596213000002
    Figure 0007596213000002
  • Figure 0007596213000003
    Figure 0007596213000003
Patent Text Reader

Abstract

To provide a program correction device, a program correction method, and a program correction program for correcting defects in a program according to its internal relationship.SOLUTION: A program correction device 100 includes: a correction candidate acquiring unit 215 that acquires a correction candidate that is a program obtained by correcting an original program; a correction candidate executing unit 220 that sets a plurality of patterns of input values for a corrected portion in the acquired correction candidate and executes the correction candidate; and a correction candidate inspection unit 230 that determines whether or not an output value of the corrected portion in the executed correction candidate depends on the input value, and outputs the correction candidate as a correction proposal for the original program when it is determined that the output value of the corrected portion depends on the input value.SELECTED DRAWING: Figure 1
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates to a program correction device, a program correction method, and a program correction program. [Background technology]

[0002] Automated Program Repair (APR) has been proposed as a technology to identify and fix defects (bugs) in software. APR consists of two phases: "identifying the defect" and "generating a patch." Specifically, a specific defect detection program is used to identify the defect in the software to be fixed, and then multiple correction programs (patch candidates) are created that can fix the software by rewriting the parts related to the defect. Then, each of the created patch candidates is verified to identify the optimal patch candidate (patch proposal). The bug is repaired by applying this patch proposal to the software to be fixed.

[0003] However, this patch proposal is not necessarily the best for software development. For example, if the patch candidates are not sufficiently verified, many patch proposals are output, which requires additional confirmation by the software developer.

[0004] Here, as a method for determining the suitability of a software correction program, Patent Document 1 describes using a test suite to identify errors in the software program, and depending on the identified errors, correcting the software program with a repair template, determining whether the correction satisfies an anti-pattern condition indicating whether the correction is inappropriate, and disallowing the correction if the correction satisfies the anti-pattern condition, or performing further testing on the corrected software program if the correction does not satisfy the anti-pattern condition. [Prior art documents] [Patent documents]

[0005] [Patent Document 1] JP 2017-045446 A Summary of the Invention [Problem to be solved by the invention]

[0006] In Patent Document 1, inappropriate modifications such as the deletion of a specific statement are defined in advance as "anti-patterns" and patch proposals that match these anti-patterns are excluded. However, there is a problem in that it is difficult to detect inappropriateness that becomes evident by specifically executing a program (for example, defects in modifications that appear depending on the contents of a specific variable or expression).

[0007] The present invention has been made in consideration of such problems, and its purpose is to provide a program correction device, a program correction method, and a program correction program that are capable of correcting program defects in accordance with the internal relationships of the program. [Means for solving the problem]

[0008] In order to solve the above problem, one of the present inventions includes a correction candidate acquisition unit having a processor and a memory, which acquires correction candidates which are programs in which corrections have been made to an original program, and a correction candidate acquisition unit which sets a plurality of patterns of input values ​​for the portions in the acquired correction candidates, The program correction device includes a correction candidate execution unit that executes the correction candidate, and a correction candidate inspection unit that determines whether or not an output value of a portion corrected in the executed correction candidate depends on the input value, and outputs the correction candidate as a correction proposal for the original program when it is determined that the output value of the portion corrected depends on the input value.

[0009] In addition, one of the present inventions for solving the above problem is a program correction method in which an information processing device executes a correction candidate acquisition process in which an information processing device acquires a correction candidate, which is a program that has been corrected from an original program; a correction candidate execution process in which a plurality of input value patterns are set for the portion that has been corrected in the acquired correction candidate and the correction candidate is executed; and a correction candidate inspection process in which a determination is made as to whether an output value of the portion that has been corrected in the executed correction candidate depends on the input value, and if it is determined that the output value of the portion that has been corrected depends on the input value, the correction candidate is output as a correction proposal for the original program.

[0010] In addition, one of the present inventions for solving the above problem is a program correction program that causes an information processing device to execute a correction candidate acquisition process that acquires a correction candidate which is a program that has been corrected from an original program, a correction candidate execution process that sets multiple input value patterns for the portion that has been corrected in the acquired correction candidate and executes the correction candidate, and a correction candidate inspection process that determines whether an output value of the portion that has been corrected in the executed correction candidate depends on the input value, and if it is determined that the output value of the portion that has been corrected depends on the input value, outputs the correction candidate as a correction proposal for the original program. Effect of the Invention

[0011] According to the present invention, defects in a program can be corrected in accordance with the internal relationships of the program.

[0012] Problems, configurations and effects other than those described above will become apparent from the following description of the embodiments. [Brief description of the drawings]

[0013] [Figure 1] FIG. 1 illustrates an example of a configuration of a program correction device according to a first embodiment. [Diagram 2] FIG. 2 is a diagram illustrating an example of hardware included in the program correction device. [Diagram 3]FIG. 11 is a flow diagram illustrating an example of a program correction process. [Figure 4] FIG. 11 is a flow diagram illustrating details of a correction candidate generating process. [Diagram 5] FIG. 13 is a diagram illustrating an example of source code. [Figure 6] FIG. 11 is a diagram showing an example of correction candidate information. [Figure 7] FIG. 11 is a flow diagram illustrating details of a correction candidate execution process. [Figure 8] FIG. 13 is a diagram illustrating an example of test code for a correction candidate. [Figure 9] FIG. 11 is a diagram illustrating an example of test execution result information. [Figure 10] FIG. 13 is a diagram illustrating an example of test execution time information. [Figure 11] FIG. 11 is a flow diagram illustrating details of a correction candidate inspection process. [Figure 12] FIG. 11 is a diagram illustrating an example of correction result information. [Figure 13] FIG. 11 is a diagram illustrating an example of test execution time information according to the second embodiment. [Figure 14] FIG. 11 is a flow diagram illustrating an example of a correction candidate inspection process according to the second embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0014] Example 1 FIG. 1 is a diagram showing an example of the configuration of a program correction device 100 according to a first embodiment. The program correction device 100 creates a plurality of programs (patches) for correcting defects (bugs) present in the source code of a program as candidates, and creates source code to which the patches (patch candidates) have been applied (hereinafter referred to as corrected programs or correction candidates). Then, the program correction device 100 executes test codes created in advance. By doing so, the most appropriate patch candidate (patch proposal) is identified based on the execution result of each correction candidate and the processing result of the part of the source code to which the patch has been applied (hereinafter, referred to as the patch part). In this way, the program correction device 100 corrects the source code.

[0015] That is, the program correction device 100 includes the following functional units: a correction candidate generating unit 210, a correction candidate acquiring unit 215, a correction candidate executing unit 220, and a correction candidate inspecting unit 230.

[0016] The program modification device 100 also stores the following information: source code 291, test code 292, modification candidate information 293, test execution result information 294, test execution time information 295, and modification result information 296.

[0017] Correction candidate generating unit 210 generates a plurality of patches (patch candidates) to be applied to source code 291, and generates source code (correction candidates) to which each patch has been applied. Correction candidate generating unit 210 stores the generated correction candidates.

[0018] The source code 291 is the source code of a program written in any language, and the patch is, for example, a program that modifies or adds a conditional branch expression.

[0019] The correction candidate acquisition section 215 acquires the correction candidates generated by the correction candidate generation section 210 .

[0020] The correction candidate execution unit 220 executes each of the correction candidates by setting multiple patterns of input values ​​to patch portions in the correction candidates acquired by the correction candidate acquisition unit 215. In this embodiment, the correction candidates are executed by executing test code in which multiple patterns of input values ​​are set and calling the correction candidates.

[0021] The correction candidate inspection unit 230 determines whether the output value of the patch portion in the correction candidate executed by the correction candidate execution unit 220 depends on the input value set by the correction candidate execution unit 220, and if it determines that the output value of the correction portion depends on the set input value, it applies the correction candidate to the original source code 291 to generate it as a new program (new source code).

[0022] The correction candidate inspection section 230 generates test execution time information 295 as information that associates the patch portion in the correction candidate with the output value of the correction portion.

[0023] 2 is a diagram for explaining an example of hardware included in the program modification device 100. The program modification device 100 includes a processor 110 such as a CPU (Central Processing Unit), an MPU (Micro Processing Unit), or a GPU (Graphics Processing Unit), a main memory device 120 such as a ROM (Read Only Memory) or a RAM (Random Access Memory), an auxiliary memory device 130 such as a hard disk drive, a flash memory, or an SSD (Solid State Drive), an input device 140 such as a keyboard, a mouse, a card reader, or a touch panel, and an LCD (Liquid Crystal Display). The computer includes an output device 150 such as a display, an audio output device (speaker), or a printer, and a communication device 160 such as a network interface card (NIC), a wireless communication module, a universal serial interface (USB) module, or a serial communication module.

[0024] The functions of the program modification device 100 are realized by the processor 311 reading and executing a program stored in the main storage device 120 or the auxiliary storage device 130. The above-mentioned program can be recorded on a recording medium and distributed, for example. Next, the process performed by the program modifying device 100 will be described.

[0025] <Program correction process> 3 is a flow diagram illustrating an example of a program modification process that modifies source code. The program modification process is executed, for example, when a user inputs a predetermined command to the program modification device 100.

[0026] First, the correction candidate generating unit 210 of the program correction device 100 executes a correction candidate generating process for generating a correction candidate which is a source code in which a defective portion has been corrected by a patch candidate (s111).

[0027] The correction candidate execution unit 220 executes a correction candidate execution process (s112) that generates information on the execution results of the correction candidate by the test program (test execution result information 294) and information on the processing results of the patch portion of the correction candidate (test execution time information 295) by executing a test program in which multiple input value patterns are set in the patch portion of the correction candidate generated in the correction candidate generation process s111.

[0028] Based on the information generated in the correction candidate execution process s112, the correction candidate inspection unit 230 executes a correction candidate inspection process (s113) to determine a final correction candidate by identifying a correction candidate whose execution of the test program is successful and whose patch portion does not depend on each input value set in the test program. The correction candidate inspection unit 230 then outputs the final correction candidate as a formal patch proposal and presents it to the user (for example, by outputting it to a file or displaying it on the screen). This ends the program correction process. These processes will be described in detail below.

[0029] <Correction candidate generation process> FIG. 4 is a flow diagram illustrating the details of the correction candidate generation process s111. The correction candidate generating unit 210 acquires the source code 291 and identifies the fault location (location of the bug) in the acquired source code 291 (s1111). For example, the correction candidate generating unit 210 executes a test case prepared for the source code 291 to call (execute) the source code 291, thereby identifying the execution path of the process in the source code 291. The correction candidate generating unit 210 calculates a suspicion value, etc. of each process in the source code 291 based on the identified execution path, and identifies the fault location (for example, Spectrum-Based Fault Localization: SBFL). Note that the method of identifying the fault location described here is just an example, and in actual practice the method may be used. Any method can be used, such as comparing the contents of the lines with those of a predetermined database, or manual checking.

[0030] (Source Code) 5 is a diagram showing an example of the source code 291. The source code 291 is configured by a function 2912 that performs output for an input variable 2911, for example, and the function 2912 further includes one or more functions 2913.

[0031] 4, the correction candidate generating unit 210 generates a plurality of patch candidates for correcting the defective part of the source code 291 identified in s1111 (s1112). The patch candidates are, for example, programs that perform a conditional branch for the defective part, add a constant, a variable, or a function expression, change the defective part, or delete the defective part.

[0032] Then, the correction candidate generating unit 210 generates new source code (i.e., correction candidates) by applying each patch generated in s1112 to the source code 291, and stores the generated source code in the correction candidate information 293 (s1113). This ends the correction candidate generating process s111.

[0033] (Correction candidate information) 6 is a diagram showing an example of the correction candidate information 293. The correction candidate information 293 includes each correction candidate The source code includes a correction ID 2931 and a correction candidate 2932. The correction candidate 2932 is source code obtained by applying a patch 2933 to the source code before correction.

[0034] <Correction candidate execution process> 7 is a flow diagram illustrating the details of the correction candidate execution process s112. The correction candidate acquisition unit 215 acquires each correction candidate generated in the correction candidate generation process s111. Then, the correction candidate execution unit 220 executes each correction candidate by executing a predetermined test code (s1121).

[0035] (Test code) 8 is a diagram showing an example of test code 292 for a correction candidate. Test code 292 has one or more test units 2921. Each test unit 2921 includes a call unit 2923 that executes the correction candidate by substituting different input values ​​2922 for the correction candidate, and a determination unit 2924 that determines whether or not the execution result of the correction candidate based on the call unit 2923 matches a previously specified correct value.

[0036] The determination unit 2924 outputs a "success" of the test (if the execution result matches the correct value) or a "failure" of the test (if the execution result does not match the correct value).

[0037] 7, the correction candidate executing unit 220 stores the execution result (success or failure) of the test code based on the test code executed in s1121 in the test execution result information 294. In addition, the correction candidate executing unit 220 stores information on the output value of the patch portion in the test code executed in s1121 (for example, the output value of a conditional decision portion in a conditional branch) in the test execution time information 295 (s1123).

[0038] The correction candidate execution unit 220 executes the processes of s1122 and s1123 for each correction candidate. Note that the order of execution of s1122 and s1123 does not matter. This ends the correction candidate execution process s112.

[0039] Here, specific examples of the test execution result information 294 and the test execution time information 295 will be described.

[0040] (Test execution result information) 9 is a diagram showing an example of the test execution result information 294. The test execution result information 294 includes an ID 2941 of each correction candidate and an execution result 2942 of the test code (specifically, the execution result (success or failure) of each determination unit).

[0041] (Test execution information) 10 is a diagram showing an example of test execution information 295. The test execution information 295 includes an ID 2951 of each correction candidate, a corrected expression 2952 which is a portion to which a patch has been applied in the correction candidate, and a runtime value 2953 which is an output value of the corrected expression 2952 in each test part 2921 of the test code 292.

[0042] For example, if the patch is an addition or change of a conditional branch process, the modified expression 2952 is the judgment part of the condition, and if the patch is an addition or change of a variable or an expression, the modified expression 2952 is the variable or expression. Also, for the execution value 2953, if the modified expression 2952 is the judgment part of the condition, one of the values ​​of the condition expression, true, false, or an exception (abnormality) is set. Also, if the modified expression 2952 is a variable or an expression, the value of the variable or expression is set.

[0043] <Correction candidate inspection process> FIG. 11 is a flow diagram illustrating the details of the correction candidate inspection process s113.

[0044] The correction candidate checking unit 230 extracts correction candidates that have been successfully executed in the test code based on the test execution result information 294 generated in the correction candidate execution process s112 (s1131). Specifically, the correction candidate checking unit 230 extracts records in which all items in the test execution result 2942 are "successful" from among the records in the test execution result information 294.

[0045] Furthermore, the correction candidate inspection unit 230 identifies, among the correction candidates extracted in s1131, the correction candidate whose result (output value) of the patch portion related to the correction candidate depends on the test pattern (test section 2921) of the test code 292 as the final correction candidate (s1132).

[0046] For example, the correction candidate inspection unit 230 excludes from the final correction candidates those records in the test execution information 295 related to the correction candidates extracted in s1131, in which all items of the execution time values ​​2953 are the same (for example, all are true or all are false).

[0047] Also, for example, the correction candidate inspection unit 230 excludes from the final correction candidates, among the records related to the correction candidates extracted in s1131 in the test execution time information 295, records in which the values ​​of items in the execution time values ​​2953 are the same (for example, both true or false) for a predetermined percentage or more (for example, 90% or more) of all items.

[0048] Also, for example, the correction candidate inspection unit 230 excludes from the final correction candidates, among the records related to the correction candidates extracted in s1131 in the test execution information 295, records in which the values ​​of each item of the execution value 2953 are in a predetermined pattern.

[0049] Also, for example, the correction candidate inspection unit 230 excludes from the final correction candidates, among the records related to the correction candidates extracted in s1131 in the test execution time information 295, records that have an abnormal value (e.g., an exception has occurred or a null value) in any of the items of the execution time value 2953.

[0050] Then, the correction candidate inspection section 230 displays the final correction candidate identified in s1132 on the screen (s1133). Also, the correction candidate inspection section 230 stores the final correction candidate in the correction result information 296 (s1133).

[0051] (Correction result information) 12 is a diagram showing an example of the correction result information 296. This correction result information 296 stores an ID 2961 of a final correction candidate (i.e., corrected source code) and a correction result 2962 which is the content of the correction candidate.

[0052] The modification result 2962 shown in the figure indicates that the execution results of all the test parts 2921 of the test code 292 were "successful" (test execution result information 294). Furthermore, the patch 2963 in the modification result information 296 (including the conditional branch expression "w != null") The results of the process (including the process above) are "true", "true", and "false", and therefore do not fall under any of the reasons for exclusion explained in s1132 (test execution time information 295).

[0053] In this manner, the program correction device 100 of this embodiment uses the test code 292, sets multiple patterns of input values ​​for the patch portion in the correction candidate, executes the correction candidate, and, if the output value (corrected formula 2952) of the patch portion in the correction candidate depends on the above input value of the test unit 2921, applies the correction candidate to the source code 291 to generate a corrected program (corrected source code).

[0054] That is, the program correction device 100 of this embodiment sets the corresponding correction candidate as the final patch proposal only when the patch applied to the correction candidate does not depend on the input value to the correction candidate, that is, when the patch is a correct program that can eliminate the bug in the source code even when the source code is executed under various internal conditions. In this way, the program correction device 100 of this embodiment can correct the bug of the program in accordance with its internal relationships.

[0055] Furthermore, in identifying the final correction candidate, the program correction device 100 of this embodiment determines that the output values ​​of the correction parts (patches) do not depend on the input values ​​when the output values ​​of the correction parts are identical to each other, and excludes them from the correction candidates, thereby making it possible to reliably exclude correction candidates that are thought not to operate normally.

[0056] Similarly, in identifying the final correction candidates, if at least one of the output values ​​of the correction part is an abnormal value (such as an exception occurring), the program correction device 100 of this embodiment determines that the output value of the correction part does not depend on the input value and excludes it from the correction candidates, thereby making it possible to reliably exclude correction candidates that are thought not to operate normally.

[0057] Moreover, the program correction device 100 of this embodiment generates test execution time information 295 that associates information on the correction part in the correction candidate (corrected formula 2952) with the output value of the correction part (runtime value 2953), thereby minimizing the information to be referred to in identifying the final correction candidate. This makes it possible to reduce the resource load related to identifying the final correction candidate.

[0058] Example 2 In the first embodiment, the program modification device 100 generates information on the relationship between the formula of the patch part (the formula after modification 2952) and its output value as the test execution information 295, but the test execution information 295 may be information in other formats.

[0059] 13 is a diagram showing an example of test execution time information 298 according to the second embodiment. This test execution time information 298 includes ID 2981 of each correction candidate, line number 2982 (which may be a process number) in the correction candidate, and execution status 2983 which is information indicating whether or not line number 2982 of the correction candidate is executed when the correction candidate is executed by each test unit 2921. Information on the presence or absence of execution for all lines of the correction candidate including the patch portion is set in execution status 2983. Note that when an abnormal value is output, information such as "exception occurred" is set in execution status 2983 for that line number.

[0060] 14 is a flow diagram illustrating an example of the correction candidate checking process according to the second embodiment. The process of s1141 by the correction candidate checking part 230 is similar to s1131 in the first embodiment.

[0061] Then, for each correction candidate extracted in s1131, the correction candidate inspection unit 230 refers to the test execution time information 298 to identify the processing (execution path) executed by the test code in the correction candidate, and determines whether the execution presence / absence patterns in the identified execution paths are the same or similar between the test units 2921. If the execution presence / absence patterns are the same or similar, the correction candidate inspection unit 230 excludes the correction candidate from the final correction candidates.

[0062] The degree of similarity between the execution / non-execution patterns is determined, for example, by the ratio of lines with the same execution / non-execution patterns to all lines of the correction candidates. If the ratio is equal to or greater than a predetermined value, the patterns are determined to be similar.

[0063] The next process in s1133 is similar to the process in s1133 in the first embodiment.

[0064] In this way, when the execution patterns of each process including the patch portion executed within the correction candidate are identical or similar to each other between the test units 2921 (input values), the correction candidate can be excluded from the final correction candidates, thereby identifying a patch in which the correction candidate follows an arbitrary processing path and is executed correctly, and identifying the corresponding correction candidate.

[0065] The present invention is not limited to the above-described embodiment, and includes various modified examples. The above-described embodiment has been described in detail for a better understanding of the present invention, and the present invention is not necessarily limited to the embodiment having all of the configurations described.

[0066] For example, some of the functions provided in each device in each embodiment may be provided in another device, and functions provided in another device may be provided in the same device. [Explanation of symbols]

[0067] 100 program correction device, 220 correction candidate execution unit, 230 correction candidate inspection unit

Claims

1. A processor and a memory, a correction candidate acquisition unit that acquires a correction candidate, which is a program that has been corrected from an original program; a correction candidate execution unit that sets a plurality of input value patterns for the portion corrected in the acquired correction candidate and executes the correction candidate; a correction candidate inspection unit that determines whether an output value of a portion where correction has been made in the executed correction candidate depends on the input value, and outputs the correction candidate as a correction proposal for the original program when it is determined that the output value of the portion where correction has been made depends on the input value; A program modification device comprising:

2. the correction candidate inspection unit determines that the output value of the corrected portion does not depend on the input value when the output values ​​of the corrected portion are identical to each other; The program correction device according to claim 1.

3. the correction candidate inspection unit determines that the output value of the corrected portion does not depend on the input value when at least one of the output values ​​of the corrected portion is an abnormal value; The program correction device according to claim 1.

4. the correction candidate execution unit generates information associating information on the portion of the correction candidate where the correction has been made with an output value of the portion where the correction has been made; the correction candidate inspection unit determines, based on the generated information, whether or not an output value of the portion where the correction has been made depends on the input value. The program correction device according to claim 1.

5. the correction candidate inspection unit identifies each process executed within the executed correction candidate, including the process of the portion where the correction was performed, determines whether the identified patterns are identical or similar to each other with respect to the multiple patterns of input values, and when it is determined that the patterns are identical or similar to each other with respect to the multiple patterns of input values, determines that the acquired multiple output values ​​do not depend on the variable. The program correction device according to claim 1.

6. the correction candidate inspection unit determines whether execution of the correction candidate is successful and whether an output value of the corrected portion of the correction candidate depends on the input value, and when it is determined that execution of the correction candidate is successful and that the output value of the corrected portion depends on the input value, outputs the correction candidate as a correction proposal for the original program. The program correction device according to claim 1.

7. An information processing device, A correction candidate acquisition process for acquiring a correction candidate, which is a program in which a correction has been made to the original program; a correction candidate execution process for setting a plurality of input values ​​for the portion corrected in the obtained correction candidate and executing the correction candidate; a correction candidate inspection process that determines whether an output value of a portion where a correction has been made in the executed correction candidate depends on the input value, and outputs the correction candidate as a correction proposal for the original program when it is determined that the output value of the portion where a correction has been made depends on the input value; How to fix a program.

8. In the information processing device, A correction candidate acquisition process for acquiring a correction candidate, which is a program in which a correction has been made to the original program; a correction candidate execution process for setting a plurality of input values ​​for the portion corrected in the obtained correction candidate and executing the correction candidate; a correction candidate inspection process that determines whether an output value of a portion where a correction has been made in the executed correction candidate depends on the input value, and outputs the correction candidate as a correction proposal for the original program when it is determined that the output value of the portion where a correction has been made depends on the input value; A program fix that allows you to run.

Citation Information

Patent Citations

  • Program simulator

    JP1995129434A

  • Computer program, test support method and test support device

    JP2012159952A

  • Program creation support device and method

    JP2014016929A

  • Test case generation method, test case generation device and program

    JP2014186407A

  • Method for repairing software program, storage medium and system

    JP2017045446A