Debugging method and computer program product
A method for debugging a computer program is proposed. The method includes a step of running at least part of the computer program on a computer, thereby prompting the computer to execute a sequence of instructions and to generate a trace corresponding to the executed sequence of instructions. When the program has generated an exception, selecting a set of one or more exception strings on the basis of the trace, so that each of the exception strings is a unique substring of the trace. The exception strings are indicated to a user or to a debugging tool. The set of exception strings may notably include the ultimate shortest unique substring of the trace. A computer program product is also described.
1. A method for debugging a computer program, comprising:
running at least part of said computer program on a computer, thereby prompting said computer to execute a sequence of instructions and to generate a trace corresponding to said executed sequence of instructions; and,
when said program has generated an exception, selecting by said computer a set of one or more exception strings among one or more candidate strings wherein each candidate string is a substring of said trace by successively determining whether each of the candidate strings is unique in an order so that any first candidate string which is a substring of a second candidate string is examined for uniqueness only after determining that the second candidate string is unique, wherein the candidate strings are denoted, the candidate string starting with a I-th literal and ending with a J-th literal of said trace, wherein the order is defined by an outer loop over J from an initial value JMAX down to a final value JMIN and an inner loop over I from an initial value IMIN up to J, where I and J represent integers, so that each of said exception strings is a unique substring of said trace; and
indicating said exception strings to a user or to a debugging tool.
2. The method of claim 1 , wherein said set of exception strings includes one or more of the shortest unique substrings of said trace or all shortest unique substrings of said trace.
3. The method of claim 1 , wherein said set of exception strings includes the ultimate shortest unique substring of said trace.
4. The method of claim 1 , wherein said selecting said set of one or more exception strings is performed on the basis of said trace and on the basis of one or more additional strings, so that none of said exception strings is a substring of any one of said additional strings.
5. The method of claim 1 , further comprising:
indicating the order in which said exception strings appear in said trace.
6. The method of claim 1 , further comprising:
selecting, for each of said exception strings, a context string, so that the respective exception string is a true substring of the respective context string and the context string is a true substring of said trace; and
indicating said context strings to said user or to said debugging tool.
7. The method of claim 1 , wherein said trace comprises a succession of one or more principal substrings, each of said principal substrings starting with an initial literal which is the same for all said principal substrings and which appears in each of said principal substrings only at the beginning of the respective principal substring, wherein each of said one or more exception strings is a substring of one of said principal substrings.
8. The method of claim 7 , wherein said computer program comprises a loop and said initial literal identifies an initial instruction in said loop.
9. A method for debugging a computer program, comprising:
running at least part of the computer program on a computer, thereby prompting the computer to execute a sequence of instructions and to generate a trace corresponding to the executed sequence of instructions;
generating an exception in response to detecting an error in the computer program, when the program has generated an exception, selecting by the computer a set of one or more subsequences of instructions of the trace, so that each of the subsequences of instructions is a unique subsequence instruction of the trace by successively determining whether candidate strings are unique in an order so that any first candidate string which is a substring of a second candidate string is examined for uniqueness only after determining that the second candidate string is unique, wherein the candidate strings are denoted, the candidate string starting with a I-th literal and ending with a J-th literal of said trace, wherein the order is defined by an outer loop over J from an initial value JMAX down to a final value JMIN and an inner loop over I from an initial value IMIN up to J, where I and J represent integers; and
indicating the set of one or more subsequences of instructions to a user or to a debugging tool.
10. The method of claim 9 , further comprising communicating the set of one or more subsequences of instructions to a debugging tool.
11. The method of claim 9 , wherein each of the one or more subsequences of instructions comprises one or more shortest unique subsequences of instructions.
12. The method of claim 11 , wherein when there are more than one shortest unique subsequences of instructions, indicating an order in which the subsequences of instructions appear in the trace by numbering the more than one shortest unique subsequences of instructions.
13. The method of claim 11 , further comprising a context subsequence of instructions, wherein the context subsequence of instructions comprises a shortest unique subsequence of instructions, a preceding literal, and a succeeding literal.
14. The method of claim 9 , wherein portions of the program are repetitive, wherein the trace further comprises a succession of one or more principle subsequences, wherein each of the one or more principle subsequences begins with a same literal, and wherein one or more subsequences of instructions that extend across more than one principle subsequence are excludes from the set of one or more subsequences of instructions.
15. The method of claim 9 , wherein the program includes one or more loops, and wherein the trace is searchable from either a beginning instruction or from an ending instruction.