Data processing: software development – installation – and managem – Software program development tool – Testing or debugging
Reexamination Certificate
2003-12-24
2008-08-12
An, Meng-Al T. (Department: 2193)
Data processing: software development, installation, and managem
Software program development tool
Testing or debugging
C717S127000, C717S130000
Reexamination Certificate
active
07412692
ABSTRACT:
A method for determining a required solution subset from a set of solutions for eliminating a computer program execution error is provided. The method includes selecting a first candidate solution subset from a set of solutions for a computer program that produces an error when executed, wherein each of the solutions represents a different proposed modification of the program for eliminating the execution error, applying the first candidate solution subset to the computer program, thereby creating a first version of the program, selecting a second candidate solution subset from the set of solutions, applying the second candidate solution subset to the program, thereby creating a second version of the program, executing the first and second program versions to determine whether either of the executed program versions produces the error, adding the difference between the first and second candidate solution subsets to a required solution subset, when one of the executed program versions produces the error, and the other of the executed program versions does not produce the error, applying the required solution subset to the program, thereby creating a third version of the program, executing the third program version to determine whether the executed third version of the program produces the error and, if the third version of the program produces the error, repeating the above steps for different candidate solution subsets until the third version of the program does not produce the error.
REFERENCES:
Y. Gueheneuc and H. Albin-Amiot, “Using design patterns and constraints to automate the detection and correction of inter-class design defects”, 2001, Proceedings of TOOLS USA, 2001.
D. Heuzeroth and T. Holl and W. Lowe, “Combining static and dynamic analyses to detect interaction patterns”, 2002, in IDPT, 2002.
Dauzere-Peres and Sevaux “Using Lagrangean Relaxation to Minimize the (Weighted) Number of Late Jobs on a Single Machine” Jun. 28, 1999.
Albin-Amiot Cointe Gueheneuc and Jussien “Instantiating and detecting design patterns: putting bits and pieces together” 2001, Proceedings. 16th Annual International Conference on Automated Software Engineering, 2001. (ASE 2001). □□.
Narendra Jussien and Vincent Barichard, “The PaLM system: explanation-based constraint programming”, 2000, Proceedings of TRICS: Techniques foR Implementing Constraint programming Systems, pp. 1-13.
Biberstein Marina
Bushinsky Shay
Farchi Eitan
Ur Shmuel
An Meng-Al T.
International Business Machines - Corporation
Mitchell Jason
LandOfFree
Determining minimal sets of bug solutions for a computer... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Determining minimal sets of bug solutions for a computer..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determining minimal sets of bug solutions for a computer... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4006849