JP2006018477A - Sequence information generation system, sequence information generation method, program, and recording medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To solve problems of conventional method for generating sequence diagrams from source codes of a program such that no sequence diagrams can be generated regarding a program having no source code and vague sequences is generated due to branch of conditions when visualizing actual execution processes of programs as sequence diagrams to improve development efficiency such as efficiency of debugging works and indication to inconsistent designs. <P>SOLUTION: Trace information is generated by tracing the program executed by a trace information generation function 11 when executing the program, and the sequence information of the program is generated by a model information generation function 12 and a sequence information generation function 13 on the basis of the generated trace information. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention automates reverse engineering work in the maintenance process of system development. For example, in an object-oriented program, sequence information for creating a sequence diagram showing a change in the state of a program or an object is generated. The present invention relates to a sequence information generation device, a sequence information generation method, a program, and a recording medium.

  Conventionally, Patent Document 1 proposes a state transition diagram creation device for obtaining a desired state transition diagram based on an input event sequence.

Further, Patent Document 2 proposes a sequence diagram creation device for obtaining a desired sequence diagram from source code.
Japanese Patent Laid-Open No. 11-24900 JP 2004-94496 A

  However, the state transition diagram creation apparatus described in Patent Document 1 has a problem that an event sequence of a program must be input. For example, in a situation where the source code of the program does not exist (for example, the source code is deleted accidentally) In such a situation, there was a problem that it was not applicable.

  Further, since the sequence diagram creating apparatus described in Patent Document 2 uses source code for creating a sequence diagram, there is a problem similar to that of the state transition diagram creating apparatus described in Patent Document 1.

  Furthermore, when the sequence diagram is generated from the source code of the program as in Patent Documents 1 and 2, the actual execution state of the program is not traced, so the sequence is ambiguous in terms of conditional branching and the like. As a result, it was difficult to find inconsistencies in the program sequence.

  The present invention has been made to solve the above-described problems, and an object of the present invention is to trace a program to be executed to generate trace information at the time of execution of the program, and to generate the trace information. On the basis of this, by generating the sequence information of the program, the actual execution process of the program can be visualized as a sequence diagram. As in the conventional method of generating the sequence diagram from the source code of the program, the source code is A nonexistent program cannot create a sequence diagram, and the sequence does not become ambiguous in terms of conditional branching, etc., and it is possible to improve development efficiency such as improving the efficiency of debugging work and pointing out design contradictions. Sequence information generating apparatus, sequence information generating method, program, and recording medium It is to provide.

  According to the present invention, trace information generating means for tracing a program to be executed to generate trace information at the time of executing the program, and sequence information of the program based on the trace information generated by the trace information generating means And sequence information generating means for generating.

  According to the present invention, a program to be executed is traced to generate trace information at the time of execution of the program, and based on the generated trace information, sequence information of the program is generated, whereby the actual program The execution process can be visualized as a sequence diagram, and the sequence does not become ambiguous in terms of conditional branching and the like, unlike the conventional method of generating a sequence diagram from the program source code. It is possible to improve development efficiency, such as design and design contradictions.

  Also, since the program execution status is traced and the program sequence information is automatically generated, the program execution status is traced and the source code does not exist (the source code has been deleted by mistake) Sequence information regarding program applications (for which no code is available) can be acquired, and sequence information of existing software can be acquired without modifying the existing software.

  Hereinafter, embodiments of the present invention will be described in detail with reference to embodiments of an automatic sequence diagram generation apparatus.

  The present embodiment assumes a stand-alone information processing apparatus, but is not limited to this, and can be applied to a system configuration configured by a network.

[First Embodiment]
FIG. 1 is a functional block diagram showing a functional configuration of the sequence information automatic generation apparatus showing the first embodiment of the present invention.

  In FIG. 1, 31 is an input function. The input function 31 is for inputting program information for which sequence information is to be created. Reference numeral 10 denotes a program execution monitoring function. The program execution monitoring function 10 executes a program in accordance with the program information input by the input function 31 to monitor the program to be executed, and an event (actually transmitted / received between objects when the program is executed) (Method start, method end, etc.) information is output.

  Reference numeral 11 denotes a trace information generation function. The trace information generation device 11 generates trace information obtained by tracing the execution state of the program from the event information output from the program execution monitoring function 10 and stores the trace information in the trace information storage unit 21.

  Reference numeral 12 denotes a model information generation function. The model information generation function 12 generates model information of sequence information using the trace information stored in the trace information storage unit 21 and stores the model information in the model information storage unit 22.

  Reference numeral 13 denotes a sequence information output function. The sequence information output function 13 creates sequence information from the model information of the sequence information stored in the model information storage unit 22 and stores the sequence information in the sequence information storage unit 23. Reference numeral 32 denotes a sequence diagram display function. This sequence diagram display function 32 displays a sequence diagram based on sequence information stored in the sequence information storage unit 23. The sequence diagram display function 32 corresponds to a general sequence diagram display tool, for example, “Rose” (product name) from Rational, “EA” (product name) from Sparks System, etc. This general sequence diagram display tool can print a sequence diagram to be displayed. Further, a sequence diagram printing function or the like may be provided instead of the sequence diagram display function 32. That is, any function that generates a sequence diagram visually based on sequence information may be used, and may be a display function or a printing function.

  In the present embodiment, a case where the target program is a Java (registered trademark) program will be described as an example. However, the present invention does not depend on a program written in a specific language, and can be realized as long as it is a program written in a language capable of tracing an execution state, such as a Java (registered trademark) program.

  FIG. 2 is a block diagram showing an example of a hardware configuration of the sequence information automatic generation apparatus of the present invention.

  In FIG. 2, reference numeral 40 denotes a computer as the sequence information automatic generation apparatus of the present invention. Reference numeral 41 denotes a CPU. The CPU 41 loads a program stored in the ROM 43 or the hard disk (HD) 44 or other recording medium (not shown) (for example, a flexible disk, a CD-ROM, a DVD-ROM, etc.) onto the RAM 42 and executes it. The entire computer 40 is controlled. The RAM 42 is used as a work area for the CPU 41.

  Reference numeral 45 denotes a DB, which stores an XMI code component (XMI code corresponding to an object, XMI code corresponding to a message, etc.) and other information for generating sequence information described later.

  An input device 47 corresponds to a pointing device such as a keyboard or a mouse. A display device 46 is composed of a CRT, LCD, or the like.

  Hereinafter, the sequence information automatic generation processing in the sequence information automatic generation apparatus shown in FIGS. 1 and 2 will be described with reference to FIGS.

  FIG. 3 is a flowchart showing an example of a first control processing procedure in the sequence information automatic generation apparatus of the present invention, and corresponds to the sequence information automatic generation processing. Note that the processing of this flowchart is realized by the CPU 41 shown in FIG. 2 loading a program stored in the HD 44 or the like into the RAM 42 and executing it. In the figure, S101 to S105 indicate steps. Furthermore, by executing this processing, sequence information corresponding to the input program can be automatically generated.

  First, in step S101, the CPU 41 creates information on the target program using the function of the user interface. Specifically, display control of the user interface shown in FIG. 4 is performed on the display device 46 to allow the user to input program information (corresponding to the input function 31 shown in FIG. 1).

  FIG. 4 is a schematic diagram showing an example of a user interface for inputting information of a sequence information creation target program.

  In FIG. 4, U101 is an output file name input field for designating the file name of a file (XMI format) for outputting sequence information created by sequence information creation processing.

  U102 is a root folder input field for designating the root folder of the Java (registered trademark) program as the sequence information creation processing target of the present embodiment.

  U103 is a main class input field for specifying the class name of the main class necessary for starting the Java (registered trademark) program specified in the root folder input field 102.

  U104 is an execution button. When this button is pressed, the input on the user interface is validated, and the target program information specified in the output file name input field U101, the root folder input field U102, and the main class input field 103 is displayed. The sequence information creation process is started.

  The description returns to the flowchart of FIG.

  When the target program information is input in step S101 (when the OK button U104 is pressed), in step S102, the CPU 41 can trace the execution state of the target program based on the target program information input in step S101. Is started (corresponding to the program execution monitoring function 10 shown in FIG. 1). For example, a Java (registered trademark) language development environment is provided with an environment for debugging a program execution state called JPDA (Java (registered trademark) Platform Debugger Architecture). In this embodiment, a program is started through the JPDA. To do. This JPDA monitors the execution state of a program to be executed, and enables output of information such as method start and end in time series. Note that methods provided as standard in the Java (registered trademark) execution environment and methods that are not desired to be sequenced can be omitted from the sequence information created by the sequence information creation process. Thereby, generation of redundant sequence information including all method calls of the program can be avoided. For example, a method such as “System.out.println ()” included in a “java (registered trademark) .lang” package provided as a standard package in the Java (registered trademark) language needs to be expressed on a sequence diagram. Often not. At that time, it can be declared that the tracing of the “java (registered trademark). If this function is used, it is possible to realize a function of omitting, from the sequence information, methods and the like that are not desired to be sequenced.

  Next, in step S103, the CPU 41 traces the activated program via the JPDA and generates trace information (corresponding to the program execution monitoring function 10 and the trace information generation function 11 shown in FIG. 1). The detailed description of step S103 is shown in FIG. In step S103, the generated trace information is stored as a trace information file (corresponding to the trace information storage unit 21 shown in FIG. 1) in the HD 44 shown in FIG.

  Next, in step S104, the CPU 41 generates model information of the target program based on the trace information generated in step S103 (corresponding to the model information generation function 12 shown in FIG. 1). A detailed description of step S104 is shown in FIG. In step S104, the generated model information is stored as a model information file (corresponding to the model information storage unit 22 shown in FIG. 1) in the HD 44 shown in FIG.

  Next, in step S105, the CPU 41 outputs sequence information based on the model information generated in step S104 (corresponding to the sequence information output function 13 shown in FIG. 1). In the present embodiment, XMI (XML Metadata Interchange) is used for outputting the sequence information. Therefore, in step S105, sequence information in the XMI format is output. In step S103, the sequence information is stored in the HD 44 shown in FIG. 2 as an output file name file (corresponding to the sequence information storage unit 23 shown in FIG. 1) specified in the output file name input field U101 in FIG. Store.

  FIG. 5 is a flowchart showing an example of a second control processing procedure in the sequence information automatic generation apparatus of the present invention. The trace information generation process (traces the target program to generate trace information) in step S103 of FIG. Processing). Note that the processing of this flowchart is realized by the CPU 41 shown in FIG. 2 loading a program stored in the HD 44 or the like into the RAM 42 and executing it. In the figure, S204 to S209 indicate steps.

  First, in step S204, the trace information generation function 11 (executed by the CPU 41) receives a “method start” event (time series) from the program execution monitoring function 10 (corresponding to the aforementioned JPDA (executed by the CPU 41)). In step S205, the trace information generation function 11 generates trace information (for example, TR001 to TR004 shown in FIG. 6 described later) in the memory space of the RAM 42 based on the received “method start” event. In S206, the trace information generation function 11 adds the trace information generated in the memory space to the file (FIG. 6) (trace information storage unit 21) that stores the trace information of the program.

  In step S207, when the trace information generation function 11 receives the “method end” event from the program execution monitoring function 10, in step S208, the trace information generation function 11 receives the received “method end” event. Based on the above, trace information (for example, TR005 to TR008 shown in FIG. 6) is generated in the memory space of the RAM 42, and in step S209, the trace information generation function 11 uses the generated trace information to represent the program trace information. (FIG. 6) Additional information is added to the (trace information storage unit 21).

  By repeating these processes during the program trace, program trace information is generated.

  As described above, in the present embodiment, a case where the target program is a Java (registered trademark) program is described as an example. However, the present invention does not depend on a program written in a specific language, and can be realized as long as it is a program written in a language capable of tracing an execution state, such as a Java (registered trademark) program. For example, as in the above JPDA, if the program has an execution monitoring environment such as a debugger that can monitor the execution state of the program to be executed and output information such as the start and end of the method in time series, Any program may be used. In this case, the debugger becomes the program execution monitoring function 10.

  FIG. 6 is a schematic diagram showing an example of the contents of a trace information file generated and output by the trace information generation process shown in FIG.

  In FIG. 6, TR001 represents that a method has been started in the program, and the following TR002, TR003, and TR004 represent information of one method. Specifically, TR002 corresponds to a method name. TR003 is the class name of the object whose method has been called. Further, TR003 is a message reception object identification key value indicating the object identification key value of the object whose method has been called. This object identification key value is a key value that uniquely identifies an object (instance) in the target program. Even if multiple instances are generated in the same class by managing the appearance object by this value, these object identification key values It is possible to generate sequence information that identifies the.

  TR005 represents that the method has been completed in the program, and the following TR006, TR007, and TR008 represent information of one method. Specifically, TR006 corresponds to a method name. TR007 is the class name of the object whose method has been called. Furthermore, TR008 is a key value for uniquely identifying the object for which the method is called.

  FIG. 7 is a flowchart showing an example of a third control processing procedure in the sequence information automatic generation apparatus of the present invention. The model information generation processing in step S104 in FIG. 3 (the model in which the trace information file shown in FIG. Corresponding to the process of generating information). Note that the processing of this flowchart is realized by the CPU 41 shown in FIG. 2 loading a program stored in the HD 44 or the like into the RAM 42 and executing it. In the figure, S301 to S316 indicate each step.

  First, in step S301, the CPU 41 reads one line from the trace information file (FIG. 6) and stores it in a variable line reserved on the RAM.

  Next, in step S302, the CPU 41 determines whether or not the value of the variable “line” is equal to “[ENTRY]”.

  In step S302, when the CPU 41 determines that the value of the variable “line” is equal to “[ENTRY]”, the process proceeds to step S303, and the subsequent processing is processing for acquiring method start information. When the CPU 41 determines that the value of the variable “line” is not equal to “[ENTRY]”, the process proceeds to step S313, and the subsequent processing is processing for acquiring method end information. First, the former case will be described.

  In step S <b> 303, the CPU 41 reads one line from the trace information file and stores the data of the read line in a variable “method name” secured on the RAM 42.

  Next, in step S304, the CPU 41 determines whether or not the value of the variable “message recipient” secured on the RAM 42 is NULL. When the process of step S304 is performed first, the value of the variable “message recipient” is NULL. In this flowchart, the variable “message receiver” is a variable for storing the object whose method is called, and the variable “message sender” reserved on the RAM 42 is the object whose method is called. Is a variable for storing

  In step S304, if the CPU 41 determines that the value of the variable “message recipient” is NULL, in step S305, the CPU 41 reads one line from the trace information file, and reads the line of the read line. Store the data in the variable “message recipient”. If it is determined that the value of the variable “message receiver” is NULL, it is the case where the process of step S304 is performed first, so the CPU 41 has the same message receiver as the message sender of this method. Judge. In step S306, the CPU 41 stores the value of the variable “message receiver” in the variable “message sender”, and proceeds to step S307.

  On the other hand, if the CPU 41 determines in step S304 that the value of the variable “message recipient” is not NULL, in step S311, the CPU 41 sets the variable “message sender” to the value of the variable “message receiver” ( That is, the message recipient value of the previous method) is stored.

  Next, in step S312, the CPU 41 reads one line from the trace information file, stores the data of the read line in the variable “message recipient”, and proceeds to step S307.

  Next, in step S307, the CPU 41 reads one line from the trace information file and stores the data of the read line in a variable “message receiving object identification key value” secured on the RAM.

  Next, in step S308, the CPU 41 sets the value of the variable “method name”, the value of the variable “message sender”, the value of the variable “message receiver”, and the value of the variable “message reception object identification key value”. The method information is registered in the map (FIG. 8A) on the RAM 42.

  Next, in step S309, the CPU 41 uses the method information including the value of the variable “method name”, the value of the variable “message sender”, and the value of the variable “message receiver” as model information in the HD 44. The model information file (FIG. 8B described later) (model information storage unit 22 in FIG. 1) is added (added in time series), and the process proceeds to step S310.

  On the other hand, if the CPU 41 determines in step S302 that the value of the variable “line” is not equal to “[ENTRY]” (that is, “[EXIT]”), the process proceeds to step S313, and the CPU 41 determines the trace information. One line is read from the file, and the data of the read line is stored in a variable “method name” secured on the RAM 42.

  Next, in step S <b> 314, the CPU 41 reads one line from the trace information file and stores the data of the read line in the variable “message sender” secured on the RAM 42.

  Next, in step S315, the CPU 41 reads one line from the trace information file and stores the data of the read line in the variable “message receiving object identification key value”.

  Next, in step S316, the CPU 41 maps message information corresponding to the combination of the value of the variable “method name” set in step S314 and the value of the variable “message reception object identification key value” set in step S315 (FIG. 8 (a)) from the back (from new information), the value of “message sender” in the searched message information is stored in the variable “message receiver”, and the process proceeds to step S309, where the CPU 41 The value of the variable “method name”, the value of the variable “message sender”, and the value of the variable “message receiver” are added as model information to the model information file in the HD 44 (FIG. 8B), The process proceeds to step S309.

  Next, in step S310, the CPU 41 determines whether or not the next line exists in the trace information file. If it is determined that the next line exists, the process returns to step S301.

  On the other hand, if the CPU 41 determines in step S310 that the next line does not exist in the trace information file (EOF), the process of this flowchart ends.

  FIG. 8 is a schematic diagram showing an example of the content of information generated by the model information generation process shown in FIG. 8A corresponds to the map registered in step S308 in FIG. 7, and FIG. 8B corresponds to the model information file output in step S309 in FIG.

  Here, how the model information file of FIG. 8B is generated by the processing shown in the flowchart of FIG. 7 using the trace information file of FIG. 6 will be described.

  First, in step S301, the CPU 41 reads the first line “[ENTRY]” of the trace information file and stores it in the variable line.

  Next, in step S302, the CPU 41 determines that the value of the variable “line” is equivalent to “[ENTRY]”. In step S303, the CPU 41 reads the second line “main” of the trace information file, Store it in the variable "method name".

  Next, in step S304, the CPU 41 determines that the value of the variable “message recipient” is NULL, and in step S305, the CPU 41 reads the third line “Object1” from the trace information file, and sets the variable “message”. Store in "Recipient".

  Next, in step S306, the CPU 41 stores the value of the variable “message receiver” (ie, “Object1”) in the variable “message sender”.

  Next, in step S307, the CPU 41 reads the fourth line “10082904” from the trace information file and stores it in “object identification key value”.

  Next, in step S308, the CPU 41 sets the value “main” of the variable “method name”, the value “Object1” of the variable “message sender”, the value “Object1” of the variable “message receiver”, and the variable “message reception”. The value “10082904” of “object identification key value” is registered in the map as method information (MP001 in FIG. 8A).

  Next, in step S309, the CPU 41 uses the value “main” of the variable “method name”, the value “Object1” of the variable “message sender”, and the value “Object1” of the variable “message receiver” as model information. It is added to the model information file in the HD 44 (MD001 in FIG. 8B).

  Next, in step S310, the CPU 41 returns to the process of step S301 because the trace information file is not yet an EOF.

  In step S301, the CPU 41 reads the fifth line “[ENTRY]” from the trace information file and stores it in the variable line.

  Next, in step S302, since the value of the variable “line” is equal to “[ENTRY]”, the CPU 41 reads the sixth line “<init>” of the trace information file in step S303, Store it in the variable "method name".

  Next, in step S304, since the value “Object1” of the variable “message receiver” is not NULL, in step S311, the CPU 41 sets the value “Object1” of the variable “message receiver” to the variable “message sender”. To store.

  Next, in step S312, the CPU 41 reads the seventh line “Object2” of the trace information file and stores it in the variable “message recipient”.

  Next, in step S307, the CPU 41 reads “10084080” on the eighth line from the trace information file and stores it in “object identification key value”.

  Next, in step S308, the CPU 41 sets the value “<init>” of the variable “method name”, the value “Object1” of the variable “message sender”, the value “Object2” of the variable “message receiver”, and the variable “ The value “10084080” of “message reception object identification key value” is registered in the map as method information (MP002 in FIG. 8A).

  Next, in step S309, the CPU 41 sets the value “<init>” of the variable “method name”, the value “Object1” of the variable “message sender”, and the value “Object2” of the variable “message receiver” as model information. Are added to the model information file in the HD 44 (MD002 in FIG. 8B).

  Next, in step S310, the CPU 41 returns to the process of step S301 because the trace information file is not yet an EOF.

  Then, again in step S301, the CPU 41 reads "[EXIT]" on the ninth line from the trace information file and stores it in the variable line.

  Next, in step S302, since the value of the variable “line” is “[EXIT]”, the CPU 41 reads “<init>” on the 10th line of the trace information file in step S313, and sets the variable “line”. Stored in Method Name.

  Next, in step S314, the CPU 41 reads the eleventh line “Object2” from the trace information file, and stores the data of the read line in the variable “message sender”.

  Next, in step S315, the CPU 41 reads “10084080” on the 12th line from the trace information file and stores it in the variable “message reception object identification key value”.

  Next, in step S316, the CPU Y41 maps message information corresponding to the combination of the value “<init>” of the variable “method name” and the value “10084080” of the variable “message reception object identification key value” (FIG. 8 ( Search from the back of a)), and store the value “Object1” of “message sender” in the searched message information MP002 in the variable “message receiver”.

  Next, in step S309, the CPU 41 sets the value “<init>” of the variable “method name”, the value “Object2” of the variable “message sender”, and the value “Object1” of the variable “message receiver” as model information. Are added to the model information file in the HD 44 (MD003 in FIG. 8B).

  Next, in step S310, the CPU 41 returns to the process of step S301 because the trace information file is not yet an EOF.

  Thereafter, the processing is repeated in the same manner, and when the CPU 41 determines in step S310 that the trace information file is EOF, the processing ends.

  With the above processing, the model information file shown in FIG. 8B is generated from the trace information file shown in FIG.

  FIG. 9 is a flowchart showing an example of a fourth control processing procedure in the sequence information automatic generation apparatus of the present invention, and the sequence information generation processing in step S105 of FIG. 3 (the model information file shown in FIG. 8B). To read sequence information and output sequence information. Note that the processing of this flowchart is realized by the CPU 41 shown in FIG. 2 loading a program stored in the HD 44 or the like into the RAM 42 and executing it. In the figure, S601 to S605 indicate steps.

First, in step S601, the CPU 41 reads a model information file (FIG. 8B) on the RAM 42, acquires information on all objects and messages appearing in a sequence diagram shown in FIG. Store in order of appearance in the corresponding program. In the example shown in FIG. 8B, “Object1” and “Object1” are acquired as objects, and “main”, “<init>”, and “update” are acquired as messages. Next, in step S602, the CPU 41 performs step S602. The object information acquired in step S601 is extracted in the order of appearance in the corresponding program, and XMI codes (XMI001 and XMI002 in FIG. 10) corresponding to the objects (for example, SQ001 and SQ002 in FIG. 11 to be described later) are generated. It outputs to the information file (FIG. 10 mentioned later).

  In the XMI code creation process corresponding to the object in step S602 and the XMI code creation process corresponding to the message shown in step S604, which will be described later, for example, the XMI code stored in the DB 45 in the HD 44 shown in FIG. Read parts (XMI code of header part, XMI code corresponding to object, XMI code corresponding to message) and edit to correspond to each object and message corresponding to the information read from model information file (For example, name, sender, receiver, etc. are edited) and an XMI code corresponding to the object and message read from the model information file is generated.

  Next, in step S603, the CPU 41 determines whether or not there is an object for which an XMI code has not yet been generated. If it is determined that there is an object, the CPU 41 returns to step S602 to perform processing for the next object.

  On the other hand, if the CPU 41 determines in step S603 that there is no object for which no XMI code has been generated, the process proceeds to step S604.

  Next, in step S604, the CPU 41 extracts one piece of information of the message acquired in step S601 in the order of appearance in the corresponding program, and the XMI code (SQ003, SQ004, SQ005 in FIG. 11) corresponding to the message (FIG. 10). XMI0003, XMI0004, XMI0005) are generated and output to a sequence information file (FIG. 10 described later).

  Next, in step S605, the CPU 41 determines whether there is a message for which an XMI code has not yet been generated. If it is determined that there is a message, the CPU 41 returns to step S604 and performs processing for the next message.

  On the other hand, if the CPU 41 determines in step S605 that there is no message for which no XMI code has been generated, the processing of this flowchart ends.

  FIG. 10 is a schematic diagram illustrating an example of sequence information generated in the sequence information generation process (step S105 in FIG. 3) illustrated in FIG.

  As shown in FIG. 10, the sequence information is output as a file described in the XMI format, and can be displayed as a sequence diagram as shown in FIG. 11 by the sequence diagram display function 32 of FIG.

  FIG. 11 is a schematic diagram showing an example of a sequence diagram displayed on the display device 46 by the sequence diagram display function 32 of FIG. 1 based on the sequence information file shown in FIG.

  In FIG. 11, SQ001 and SQ002 indicate objects. SQ003 to SQ005 indicate messages transmitted and received between the objects SQ001 and SQ002.

  Reference numeral 801 denotes an object lifeline, and reference numeral 802 denotes an object active section.

  FIG. 12 is a diagram illustrating a correspondence relationship between the XMI format code in the sequence information illustrated in FIG. 10 and the sequence diagram illustrated in FIG. 11.

  As shown in FIG. 12, the XMI format code XM001 shown in FIG. 10 and the SQ001 in the sequence diagram shown in FIG. 11 correspond to the object “Object1”.

  Also, the XMI format code XM002 shown in FIG. 10 and the SQ002 in the sequence diagram shown in FIG. 11 correspond to the object “Object2”.

  Further, the XMI format code XM003 shown in FIG. 10 and the SQ003 in the sequence diagram shown in FIG. 11 correspond to the message “main”.

  Further, the code XM004 in the XMI format shown in FIG. 10 and SQ004 in the sequence diagram shown in FIG. 11 correspond to the message “<init>”.

  Further, the XMI format code XM005 shown in FIG. 10 and the SQ005 in the sequence diagram shown in FIG. 11 correspond to the message “update”.

  In this embodiment, the sequence diagram shown in FIG. 11 is displayed after the generation of the sequence information file (XMI file) shown in FIG. 10 is completed. The sequence diagram may be displayed by the sequence diagram display function 32 in real time.

  As described above, according to the present embodiment, it is possible to visualize the actual execution process of the program, and from the viewpoint of conditional branching and the like as in the conventional method of generating a sequence diagram from the source code of the program. The sequence does not become ambiguous, and development efficiency can be improved, such as improving the efficiency of debugging and pointing out design contradictions.

  Further, it is possible to create a sequence diagram even in a situation where the source code of the program does not exist (for example, a situation where the source code is deleted by mistake).

[Second Embodiment]
In the first embodiment, the configuration corresponding only to the case where the program configuration is the single thread configuration has been described. However, the program configuration may be configured to be compatible with a multi-thread configuration program. Hereinafter, an embodiment in that case will be described.

  In order to apply the present invention to the generation of sequence information of a multi-thread program, the trace information (format shown in FIG. 6) generated by the trace information generation function in the first embodiment is shown in FIG. It becomes possible by changing to the format and further changing the model information output processing shown in FIG. 7 in the first embodiment to the processing shown in the flowchart shown in FIG.

  Hereinafter, the configuration of the second embodiment will be described with reference to FIGS. 13 and 14 focusing on the differences from the configuration of the first embodiment.

  FIG. 13 is a schematic diagram showing an example of the contents of a trace information file generated and output by the trace information generation process shown in FIG.

  The trace information file shown in FIG. 13 is different from the trace information file shown in FIG. 6 in that the message sender (the object that called the method) is stored as information.

  Although the flowchart of the new trace generation process is not shown, the trace information generation process of the first embodiment shown in FIG. 5 is changed, and the information output by the processes in steps S206 and S209 in FIG. The format has been changed. In addition to the information output in the first embodiment, the message sender information is also changed to be output as trace information.

  In the example shown in FIG. 13, TR 103 corresponds to the message sender (the class name of the object that called the method), and TR 106 uniquely identifies the message transmission object (that is, the message transmission object identification key value). It becomes.

  Similarly to TR001 shown in FIG. 6, TR101 represents that a method has been started in the program, and the following TR102, TR103, TR104, TR105, and TR106 each represent information of one method. Specifically, TR102 corresponds to a method name, similar to TR002 shown in FIG. In addition, as described above, TR103 and TR104 indicate a message sender and a message transmission object identification key value. Further, TR105 and TR106 indicate a message receiver and a message reception object identification key value in the same manner as TR003 and TR004 shown in FIG.

  FIG. 14 is a flowchart showing an example of a fifth control processing procedure in the sequence information automatic generation apparatus of the present invention. The model information generation processing (model information generation corresponding to a multi-thread configuration program) in step S104 in FIG. Processing). Note that the processing of this flowchart is realized by the CPU 41 shown in FIG. 2 loading a program stored in the HD 44 or the like into the RAM 42 and executing it. In the figure, S401 to S414 indicate steps.

  The process of this flowchart differs from the process of the flowchart shown in FIG. 7 in that a variable “message sender” is set from the trace information file. In the process of the flowchart shown in FIG. 7, the previous message receiver in the program is set to the variable “message sender” because this is for a single-threaded program.

  The model information generation process corresponding to the multithreaded program of the present invention will be described in detail below.

  First, in step S401, the CPU 41 reads one line from the trace information file (FIG. 13) and stores it in a variable line reserved on the RAM.

  Next, in step S402, the CPU 41 determines whether or not the value of the variable “line” is equal to “[ENTRY]”.

  In step S402, when the CPU 41 determines that the value of the variable “line” is equal to “[ENTRY]”, the process proceeds to step S403, and the subsequent processing is processing for acquiring method start information. If the CPU 41 determines that the value of the variable “line” is not equal to “[ENTRY]”, the process proceeds to step S414, and the subsequent processing is processing for acquiring method end information. First, the former case will be described.

  In step S <b> 403, the CPU 41 reads one line from the trace information file and stores the data of the read line in a variable “method name” secured on the RAM 42.

  Next, in step S404, the CPU 41 reads one line from the trace information file and stores the data of the read line in a variable “message sender” secured in the RAM. Next, in step S405, the CPU 41 reads the next line from the trace information file, and stores the data of the read line in a variable “message transmission object identification key value” secured in the RAM.

  Next, in step S406, the CPU 41 reads the next line from the trace information file, and stores the data of the read line in the variable “message receiver” secured in the RAM. Next, in step S407, the CPU 41 reads the next line from the trace information file, and stores the data of the read line in a variable “message receiving object identification key value” secured on the RAM.

  Next, in step S408, the CPU 41 sets the value of the variable “method name”, the value of the variable “message sender”, the value of the variable “message transmission object identification key value”, the value of the variable “message receiver”, The value of the variable “message receiving object identification key value” is registered in the map (FIG. 15A) on the RAM 42 as method information.

  Next, in step S409, the CPU 41 uses the value of the variable “method name”, the value of the variable “message sender”, and the value of the variable “message receiver” as model information in the model information file (described later). 15 (b)) (the model information storage unit 22 in FIG. 1), and the process proceeds to step S410.

  On the other hand, if the CPU 41 determines in step S402 that the value of the variable “line” is not equal to “[ENTRY]” (ie, “[EXIT]”), the process proceeds to step S411, and the CPU 41 determines the trace information. One line is read from the file, and the data of the read line is stored in a variable “method name” secured on the RAM 42.

  Next, in step S 412, the CPU 41 reads one line from the trace information file and stores the data of the read line in a variable “message sender” secured on the RAM 42.

  Next, in step S413, the CPU 41 reads the next line from the trace information file, and stores the data of the read line in the variable “message receiving object identification key value”.

  Next, in step S414, the CPU 41 maps message information corresponding to the combination of the value of the variable “method name” set in step S311 and the value of the variable “message receiving object identification key value” set in step S413 (FIG. 15 (a)) from the back (from new information), the value of “message sender” in the searched message information is stored in the variable “message receiver”, the process proceeds to step S409, and the CPU 41 The value of the variable “method name”, the value of the variable “message sender”, and the value of the variable “message receiver” are added as model information to the model information file (FIG. 15B) in the HD 44, Proceed to step S410.

  Next, in step S410, the CPU 41 determines whether or not the next line exists in the trace information file. If it is determined that the next line exists, the process returns to step S401.

  On the other hand, if the CPU 41 determines in step S410 that the next line does not exist in the trace information file (EOF), the process of this flowchart ends.

  FIG. 15 is a schematic diagram illustrating an example of the content of information generated by the model information generation process corresponding to the multi-thread configuration program illustrated in FIG. 15A corresponds to the map registered in step S408 in FIG. 14, and FIG. 15B corresponds to the model information file output in step S409 in FIG.

  As described above, according to the present embodiment, even a multi-red program can visualize the actual execution process of the program as a sequence diagram, and generates a sequence diagram from the source code of the program. Unlike the conventional method, the sequence does not become ambiguous in terms of conditional branching and the like, and it is possible to improve the development efficiency such as the efficiency of debugging work and the indication of design contradiction.

  Even in a situation where the source code of the program does not exist (for example, a situation where the source code is accidentally deleted), it is possible to create a sequence diagram of a program having a multi-red configuration. .

[Third Embodiment]
In the first embodiment and the second embodiment, information about display (information such as object arrangement order and position) is not set in the sequence information file. Since the display is performed by a general display tool (sequence diagram display function 32) that can display an XMI format file, the display may vary depending on the display tool. However, it is also possible to unify the display among the display tools with the configuration shown in the present embodiment. A method for this will be described below.

  In order to unify the display of the sequence diagram between external tools according to the present invention, a diagram (components of sequence diagram (object, active section) is added to the model information file obtained in step S104 (generation of model information) in FIG. , Messages, etc.)) display information (information such as object arrangement order, position, etc.) may be added. Hereinafter, a method of calculating the display information of the diagram showing this configuration will be described with reference to the flowchart of FIG.

  FIG. 16 is a flowchart showing an example of a sixth control processing procedure in the sequence information automatic generation apparatus of the present invention. Between the model information generation processing in step S104 and the sequence information output processing in step S105 in FIG. This corresponds to the calculation processing of the display information of the diagram executed in. Note that the processing of this flowchart is realized by the CPU 41 shown in FIG. 2 loading a program stored in the HD 44 or the like into the RAM 42 and executing it. In the figure, S501 to S511 denote steps.

  First, in step S501, the CPU 41 acquires a drawing start position. This drawing start position should be held as a static value in the program, and a method of reading from a file stored in the DB 45 or HD 44 in advance and holding it in the RAM 42 is conceivable.

  Next, in step S502, the CPU 41 obtains information for an object, a message, and an active section, which are constituent elements constituting the sequence diagram. As in the case of the drawing start position, such information can be read from a file or the like stored in the DB 45 or HD 44. The value read in step S502 is held in the RAM 42 and is used for calculation of diagram display information in the following steps.

  In step S503, the CPU 41 uses the model information file (FIG. 8 (b) or FIG. 15 (b)) obtained in step S104 (generation of model information) in FIG. Get information. The display information of the diagram is added by performing the arrangement process in the subsequent process for all the objects and messages obtained here. Note that the object and message information obtained here are arranged in the order of appearance in the program and held in the RAM 42.

  Next, in step S504, the CPU 41 extracts one of all objects acquired in step S503 in the order of appearance, and sets the arrangement coordinates for the object. Specifically, “drawing start position + (order × object arrangement interval)” is set as a variable “object arrangement coordinate” secured for each object in the RAM 42.

  Next, in step S505, the CPU 41 determines whether or not there is an object that has not yet been arranged. If it is determined that there is an object, the CPU 41 returns to the process of step S504 to arrange the next object.

  On the other hand, if the CPU 41 determines in step S505 that there is no object that has not been arranged (all objects have been arranged), the process proceeds to step S506. As described above, the objects (SQ001 and SQ002 in FIG. 11) can be arranged on the sequence diagram in the form along the order of appearance in the corresponding program by steps S504 and S505.

  Next, in step S506, the CPU 41 extracts one from the arrangement coordinates of all the objects set in step S504 in the order of appearance, and uses the reference for arranging the active section of the corresponding object based on the arrangement coordinates of the object. As a point (x, y), a variable x and a variable y secured on the RAM 42 for each active section are represented by “variable x = (object arrangement coordinate X + object drawing width) / 2”, “variable y = (object The arrangement coordinates Y + the drawing height of the object / 2) ”.

  Next, in step S507, the CPU 41 arranges active sections of the corresponding object. This active section is, for example, 802 in FIG. 11 and represents a section in which the object is executing a method (action).

  Specifically, with respect to the active section start point X, active section start point Y, active section end point X, and active section end point Y secured in the RAM 42 for each active section, “active section start point X = variable x” − (Active section width / 2) ”,“ active section start point Y = variable y + message arrangement interval ”),“ active section end point X = active section start point X + active section width ”,“ active section end point ” “Y = variable y + order of appearance of last transmitted / received message × message arrangement interval” is set.

  Although not shown in the flowchart, for an object having a plurality of active sections, the variable y is set as “variable y = variable y + active section end point Y” for each active section, and the process of step S506 is performed. Repeat.

  Next, in step S508, the CPU 41 determines whether or not there is an object for which an active section has not yet been arranged. If it is determined that there is an object, the process returns to step S506, and the active section of the next object is determined. Do the placement of.

  On the other hand, if the CPU 41 determines in step S508 that there is no object for which no active section has been placed (the active section of all objects has been placed), the process proceeds to step S509. As described above, by steps S506 to S508, the active section (802 in FIG. 11) can be arranged on the sequence diagram in a form along the order of appearance in the corresponding program.

  Next, in step S509, the CPU 41 extracts one message in the order of appearance from all the messages acquired in step S503, and sets the arrangement coordinates in the message. Specifically, with respect to the message start point X, message start point Y, message end point X, and message end point Y secured in the RAM 42 for each message, “message start point X = active section start point X + of message transmission object” (Active section width / 2) "," message start point Y = variable y + message appearance order * message arrangement interval ")," message end point X = active section start point X + of message receiving object (active section width) / 2) "," message end point Y = message start point Y ".

  Next, in step S510, the CPU 41 determines whether or not there is a message that has not yet been arranged. If it is determined that there is a message, the CPU 41 returns to the process of step S509 and arranges the next message.

  On the other hand, if the CPU 41 determines in step S510 that there is no message that has not been arranged (all messages have been arranged), the process proceeds to step S511. As described above, the messages (S003, SQ004, SQ004 in FIG. 11) can be arranged on the sequence diagram in the form along the order of appearance in the corresponding program by steps S509 and S510.

  Next, in step S511, the CPU 41 models the arrangement information of each diagram (information such as the arrangement order, arrangement position, and arrangement size of each diagram (component) (each diagram display information)) set through steps S504 to S509. The information is added to the information file, and the display information calculation flowchart of this diagram is terminated.

  Hereinafter, a process for generating a sequence information file from a model information file to which diagram display information has been added will be described with reference to the flowchart of FIG.

  FIG. 17 is a flowchart showing an example of a seventh control processing procedure in the sequence information automatic generation apparatus of the present invention. The sequence information generation processing (dialog display information added in step S105 in FIG. 3 adds model information). Corresponding to the process of outputting read sequence information). Note that the processing of this flowchart is realized by the CPU 41 shown in FIG. 2 loading a program stored in the HD 44 or the like into the RAM 42 and executing it. In the figure, S601 to S605, S701 to S703 denote steps, and the same steps as those in FIG. 9 are denoted by the same step numbers.

  In FIG. 17, steps S601 to S1605 are the same as those in FIG.

  In step S701, the CPU 41 reads the model information file onto the RAM 42 and acquires all the display information of the diagram.

  In step S702, the CPU 41 extracts one diagram display information acquired in step S701, generates an XMI code (XMI01 in FIG. 18) corresponding to the diagram display information, and generates a sequence information file (a diagram to be described later). 18).

  In the process of creating the XMI code corresponding to the diagram display information in step S702, for example, the XMI code component stored in the DB 45 in the HD 44 shown in FIG. XMI code) corresponding to the information read from the model information file and edited so as to correspond to the display information of each diagram (for example, edit the display position, start position, end position) ), An XMI code corresponding to the display position of the diagram read from the model information file is generated.

  Next, in step S703, the CPU 41 determines whether there is display information of a diagram for which an XMI code has not yet been generated. If it is determined that the display information exists, the CPU 41 returns to step S702 and performs processing for the next object. I do.

  On the other hand, if the CPU 41 determines in step S703 that there is no display information of a diagram for which no XMI code has been generated, the process of this flowchart ends.

  FIG. 18 shows an example of a sequence information file generated from the model information file to which the diagram display information is added by the processing of FIGS.

  FIG. 18 is a diagram showing an example of a sequence information file generated in the third embodiment of the present invention.

  This sequence information file is obtained by adding display information such as object coordinate information to the model information file by the processing of the flowchart shown in FIG.

  In FIG. 18, for example, XM 101 is an element that defines one object in the sequence diagram. XM102 and XM103 indicate the drawing width and height of the object, respectively.

  In this way, the display among various sequence diagram display tools can be unified by setting the coordinates, width, height and the like for all the drawing elements constituting the sequence diagram.

  As described above, according to the third embodiment of the present invention, it is possible to unify the display among general display tools corresponding to the sequence diagram display function 32 by setting the calculation of the display information of the diagram. All developers / users can obtain a common sequence diagram.

  As described above, according to each embodiment, the trace information is output from the trace state of the program actually executed by the trace information generation function 11 (in cooperation with the program execution monitoring unit 10), and the trace output by the trace information generation function 11 is output. The model information generation function 12 outputs information as model information that can be converted into sequence information, and the model information generated by the model information generation function 12 uses the meta language (in this embodiment, XMI). It is possible to visualize the actual execution process of the program as a sequence diagram by converting it into the sequence information that has been generated, and, as in the conventional method of generating a sequence diagram from the program source code, such as conditional branching The sequence does not become ambiguous from the point, and Efficiency of grayed work, such as pointing out the design of contradiction, it is possible to improve the development efficiency.

  In addition, it is possible to create a sequence diagram of a program even in a situation where the source code of the program does not exist (for example, a situation where the source code is deleted by mistake).

  Therefore, by tracing the execution state of the program and automatically generating the sequence information of the program, the sequence information of the existing software can be acquired without modifying the existing software.

  In addition, the structure which combined the said 1st Embodiment-3rd Embodiment is also contained in this invention.

  It should be noted that the configuration and contents of the various data shown in the above embodiment are not limited to this, and it goes without saying that the various data are configured with various configurations and contents depending on the application and purpose.

  Although the embodiment has been described above, the present invention can take an embodiment as a system, apparatus, method, program, recording medium, or the like, and specifically includes a plurality of devices. The present invention may be applied to a system or may be applied to an apparatus composed of one device.

  Therefore, the actual execution process of the program is visualized as a sequence diagram, and in a program without source code, a sequence diagram cannot be created, or the sequence becomes ambiguous in terms of conditional branching etc. It is possible to solve the problems of the conventional method for generating the sequence diagram, and to improve the development efficiency such as the efficiency of debugging work and the indication of design contradiction.

  The configuration of a data processing program that can be read by the sequence information generating apparatus according to the present invention will be described below with reference to the memory map shown in FIG.

  FIG. 19 is a diagram for explaining a memory map of a recording medium (storage medium) that stores various data processing programs that can be read (read out) by the sequence information generating apparatus according to the present invention.

  Although not specifically shown, information for managing a program group stored in the recording medium, for example, version information, creator, etc. is also stored, and information depending on the OS on the program reading side, for example, a program is identified and displayed. Icons may also be stored.

  Further, data depending on various programs is also managed in the directory. In addition, when a program or data to be installed is compressed, a program to be decompressed may be stored.

  The functions shown in FIGS. 3, 5, 7, 9, 14, 16, and 17 in this embodiment may be performed by a host computer by a program installed from the outside. In this case, the present invention is applied even when an information group including a program is supplied to the output device from a recording medium such as a CD-ROM, a flash memory, or an FD, or from an external recording medium via a network. Is.

  As described above, a recording medium recording software program codes for realizing the functions of the above-described embodiments is supplied to a system or apparatus, and a computer (or CPU or MPU) of the system or apparatus stores the recording medium in the recording medium. It goes without saying that the object of the present invention can also be achieved by reading and executing the programmed program code.

  In this case, the program code itself read from the recording medium realizes the novel function of the present invention, and the recording medium storing the program code constitutes the present invention.

  As a recording medium for supplying the program code, for example, a flexible disk, hard disk, optical disk, magneto-optical disk, CD-ROM, CD-R, DVD-ROM, magnetic tape, nonvolatile memory card, ROM, EEPROM, A silicon disk or the like can be used.

  Further, by executing the program code read by the computer, not only the functions of the above-described embodiments are realized, but also an OS (operating system) or the like running on the computer based on the instruction of the program code. It goes without saying that a case where the function of the above-described embodiment is realized by performing part or all of the actual processing and the processing is included.

  Furthermore, after the program code read from the recording medium is written in a memory provided in a function expansion board inserted in the computer or a function expansion unit connected to the computer, the function expansion is performed based on the instruction of the program code. It goes without saying that the case where the CPU or the like provided in the board or the function expansion unit performs part or all of the actual processing and the functions of the above-described embodiments are realized by the processing.

  Further, the present invention may be applied to a system composed of a plurality of devices or an apparatus composed of a single device. Needless to say, the present invention can be applied to a case where the present invention is achieved by supplying a program to a system or apparatus. In this case, by reading a recording medium storing a program represented by software for achieving the present invention into the system or apparatus, the system or apparatus can enjoy the effects of the present invention. .

  Furthermore, by downloading and reading out a program represented by software for achieving the present invention from a server, database, etc. on a network using a communication program, the system or apparatus can enjoy the effects of the present invention. It becomes.

It is a functional block diagram which shows the function structure of the sequence information automatic generation apparatus which shows 1st Embodiment of this invention. It is a block diagram which shows an example of the hardware constitutions of the sequence information automatic generation apparatus of this invention. It is a flowchart which shows an example of the 1st control processing procedure in the sequence information automatic generation apparatus of this invention. It is a schematic diagram which shows an example of the user interface for inputting the information of a sequence information creation object program. It is a flowchart which shows an example of the 2nd control processing procedure in the sequence information automatic generation apparatus of this invention. FIG. 5 is a schematic diagram illustrating an example of contents of a trace information file generated and output by the trace information generation process illustrated in FIG. 4. It is a flowchart which shows an example of the 3rd control processing procedure in the sequence information automatic generation apparatus of this invention. It is a schematic diagram which shows an example of the content of the information produced | generated by the model information production | generation process shown in FIG. It is a flowchart which shows an example of the 4th control processing procedure in the sequence information automatic generation apparatus of this invention. It is a schematic diagram which shows an example of the sequence information produced | generated by the production | generation process (step S105 of FIG. 3) of the sequence information shown in FIG. FIG. 11 is a sequence diagram displayed on the display device by the display function of FIG. 1 based on the sequence information file shown in FIG. 10. FIG. 12 is a diagram illustrating a correspondence relationship between codes in the XMI format in the sequence information illustrated in FIG. 10 and the sequence diagram illustrated in FIG. 11. FIG. 5 is a schematic diagram illustrating an example of contents of a trace information file generated and output by the trace information generation process illustrated in FIG. 4. It is a flowchart which shows an example of the 5th control processing procedure in the sequence information automatic generation apparatus of this invention. It is a schematic diagram which shows an example of the content of the information produced | generated by the model information production | generation process corresponding to the program of the multithread structure shown in FIG. It is a flowchart which shows an example of the 6th control processing procedure in the sequence information automatic generation apparatus of this invention. It is a flowchart which shows an example of the 7th control processing procedure in the sequence information automatic generation apparatus of this invention. It is a figure which shows an example of the sequence information file produced | generated in 3rd Embodiment of this invention. It is a figure explaining the memory map of the recording medium (storage medium) which stores the various data processing program which can be read (read) with the sequence information creation apparatus which concerns on this invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 Program execution monitoring function 11 Trace information generation function 12 Model information generation function 13 Sequence information output function 21 Trace information storage part 22 Model information storage part 23 Sequence information storage part 31 Input function 32 Sequence diagram display function 41 CPU
42 RAM
43 ROM
44 HD
45 DB
46 Display device 47 Input device

Claims (9)

Trace information generating means for tracing a program to be executed and generating trace information during execution of the program;
Sequence information generating means for generating sequence information of the program based on the trace information generated by the trace information generating means;
A sequence information generating apparatus characterized by comprising:   The sequence information generation unit according to claim 1, wherein the trace information generation unit acquires and outputs method start and end information in a time series from a program execution environment for monitoring a program execution state. apparatus.   The sequence information generation means is capable of converting the trace information generated by the trace information generation means into sequence information, information indicating a method name, a message transmission object corresponding to the method, and a message reception object corresponding to the method The sequence information according to claim 1 or 2, wherein the information is generated as model information having a configuration added in time series, and the generated model information is converted into sequence information using a predetermined meta language. Generator.   The trace information generation unit can generate trace information of the multi-threaded program by tracing the execution state of the multi-threaded program to be executed. Sequence information generation device.   5. The sequence information generating apparatus according to claim 1, further comprising sequence diagram generating means for generating a sequence diagram based on the sequence information generated by the sequence information generating means.   The sequence information generation unit generates sequence information including arrangement information of each component of the sequence diagram generated by the sequence diagram generation unit based on the trace information generated by the trace information generation unit. 6. The sequence information generating apparatus according to claim 1, wherein In a sequence information generation method in an information processing apparatus capable of executing a program,
A trace information generating step for generating a trace information when the program is executed by tracing the program to be executed;
A sequence information generation step for generating sequence information of the program based on the trace information generated by the trace information generation step;
A sequence information generation method characterized by comprising:   A program for executing the sequence information generation method according to claim 7.   A recording medium storing a computer-readable program for executing the sequence information generating method according to claim 7.

Images