JP2010026810A - Path management method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide path data for uniquely specifying a path with small amount of data. <P>SOLUTION: An operation to be performed by a test bench to an inspection object in computer simulation is defined as a task. A path management method includes steps of: when a plurality of paths configured of a series of tasks are applied as an execution flow of the tasks, calculating the total number of paths to each of a plurality of branches branched from one node in the execution flow by the computer, and storing it in a memory; when a first integer value for specifying the n-th (n: integer) branch among the plurality of branches arranged in order is m, calculating the sum of the total number of paths for the n-th branch and m as the first integer value for specifying the (n+1)th branch by the computer, and storing it in a memory; and uniquely specifying each of the plurality of branches by the computer on using a second integer value on the basis of the first integer value. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present disclosure generally relates to computer-based design, and more particularly to operation verification of a design object such as a circuit.

  In designing an integrated circuit, generally, first, hardware is described with an RTL (Register Transfer Level) abstraction level. At this level, a desired logic is expressed as a register and a logic function and signal transmission between them. When the RTL description is completed, the validity of the logical operation of the circuit described in the RTL is verified by computer simulation. Thereafter, a gate level description is generated from the RTL description by a logic synthesis tool. At this level, a desired circuit diagram is expressed by various logic gates and connections between them. Also in the gate level description, the validity of the logical operation of the circuit described in the gate level is verified by computer simulation.

  In such verification by computer simulation, a test bench is used. A test bench is a description on a simulation for observing the output of a circuit that appears as a result of applying an input signal to a circuit to be verified. More generally speaking, the test bench performs some operation on the verification target that affects the operation of the verification target such as an LSI (Large Scale Integrated circuit). For example, if the verification target is LSI, operations such as writing data to the register (setting parity to an even number, enabling interrupt operation, etc.), inputting an interrupt signal, resetting, etc. I do. The operation that the test bench performs on the verification target is hereinafter referred to as a task. The verification operation for the verification target can be expressed as an execution flow including a series of tasks.

  FIG. 1 is a diagram conceptually illustrating an example of an execution flow including a series of tasks. In FIG. 1, each node A, B, C, D,..., J represents one task. A path connecting the start point Start to the end point End with a series of nodes and arrows between the nodes represents an execution flow of a task that can be executed on the verification target when the verification target is actually operated. This execution flow is created by a person in charge of verification in consideration of the specification of the verification target (LSI circuit or the like). Verification is performed by executing all paths from the start point Start to the end point End in FIG. 1 and confirming that the verification target operates according to the specification through any path. To determine whether the operation to be verified is in accordance with the specification, the data output from the verification target is compared with the expected value data obtained from the reference model indicating the desired logic. If the output data and the expected value data are equal, it can be determined that the operation to be verified is valid.

  FIG. 2 is a flowchart showing an example of a conventional route execution method. In step S1, a route is randomly generated. For example, in the example of the execution flow shown in FIG. 1, one of a plurality of paths from the start point Start to the end point End is randomly generated. For example, assume that the generated path is ACDHI. That is, it is assumed that a path for executing tasks A, C, D, H, and I in this order is generated.

  In step S2, it is determined whether or not the path generated in step S1 exists in the storage area. That is, it is determined whether or not data indicating the generated route is stored in the storage area. In the initial state, there is no route data stored in this storage area. In addition, in the state after several routes have already been executed, data indicating the routes executed so far are stored in this storage area. If the data indicating the generated route has already been stored in the storage area, this route has already been executed, so the process returns to step S1 and a route is randomly generated again. If the data indicating the generated route is not stored in the storage area, the process proceeds to step S3.

  In step S3, the generated route is executed. In other words, the task specified by the route is executed on the verification target in the order specified by the test bench. In the case of the above example, tasks A, C, D, H, and I are executed in this order on the verification target by the test bench. In step S4, the executed generation path is stored in the storage area. That is, data indicating the executed path is stored in the storage area. In the case of the above example, data “ACDHI” in which the identifiers of the tasks executed on the route are arranged in a line in order is stored in the storage area.

  In step S5, it is determined whether or not all routes have been executed. For example, in the example of the execution flow shown in FIG. 1, it is determined whether or not all of a plurality of paths from the start point Start to the end point End have been executed. If all the routes have not been executed, that is, if there are still unexecuted routes, the process returns to step S1 to randomly generate routes again, and the subsequent processing is repeated. If all the routes have been executed, the route execution method processing is terminated. Normally, if a mismatch between the output data and the expected value data is detected during the execution of the paths that are randomly generated in sequence, it is assumed that there is a problem with the circuit design, and the path execution and test operations are performed by computer simulation. Cancel.

  In the conventional route execution method as described above, the identifiers of the tasks included in the executed route are sequentially arranged in a line and stored in a storage area, thereby recording data indicating the executed route. Then, by referring to the data in which the task identifiers stored in the storage area are arranged in a line, it is determined whether the randomly generated route is an already executed route.

  FIG. 3 is a diagram showing the contents of data stored in the storage area. FIG. 3 shows data indicating a route stored in the storage area after the route “ACDHI”, the route “ABHJ”, the route “AEFGHHI”, the route “ABHI”, and the route “AEFGHJ” are executed in this order. It is. When the data indicating the route is recorded in the storage area in this way and the newly generated route is “ABHJ”, by comparing “ABHJ” with the data of each route in the storage region, It can be determined whether the generated route is a route that has already been executed.

As described above, in the verification operation, if the route that has been executed once is not executed again, and if the execution route is determined so that the route with high importance is preferentially executed, efficient verification becomes possible. . However, in the management method as described above in which the identifiers of all tasks included in the route are stored as means for managing the route, an amount of storage area corresponding to the total number of tasks included in all the routes is required. Further, since the storage area becomes large, there is a problem that it takes time to search for route information from the storage area.
JP-A-9-128266 Japanese Patent Laid-Open No. 11-232137 JP-A-10-320190

  In view of the above, it is desired to provide route data that uniquely specifies a route with a small amount of data.

  In the route management method, an operation performed by a test bench on a verification target in a computer simulation is a task, and when a plurality of routes composed of a series of tasks are given as an execution flow of the task, For each of a plurality of branches branched from one node, the total number of paths existing ahead of each branch is obtained by a computer and stored in a memory, and n (n: integer) when the plurality of branches are arranged in order. ) When the first integer value specifying the nth branch is m, the computer calculates the sum of the total number of paths and m for the nth branch as the first integer value specifying the n + 1th branch. Each step of storing in a memory and uniquely specifying each of the plurality of paths by a computer by a second integer value based on the first integer value is included.

  According to at least one embodiment, since each route is uniquely specified by an integer value, it is possible to provide route data that uniquely specifies a route with a small amount of data.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

FIG. 4 is a diagram illustrating an environment in which the operation to be verified is verified by computer simulation. In FIG. 4, the test bench 10 verifies the operation of the verification target 11 such as an LSI.
For example, if the verification target 11 is an LSI, data is written to the register (parity is set to an even number, interrupt operation is permitted, etc.), an interrupt signal is input, a reset is performed, etc. Perform the operation. In such a computer simulation, an operation performed on the verification target 11 by the test bench 10 is used as a task, and a plurality of paths composed of a series of tasks are given as a task execution flow. Specifically, for example, an execution flow as shown in FIG. 1 is created so that the person in charge of verification verifies a desired operation in consideration of the specification of the verification target 11 (LSI circuit or the like).

  In the embodiment described below, one route is uniquely specified by one integer value. At this time, for example, even if one integer value is assigned so as to uniquely identify one route as shown as “No.” in FIG. 3, the integer value and the data indicating the route (task identifiers are arranged in a line). It is meaningless to store the data in the memory in a one-to-one correspondence. This is because the size of data in which task identifiers are arranged in a row is large, and a large memory storage area is required. Data specifying the configuration of the execution flow as shown in FIG. 1, that is, data specifying the configuration of a tree in which the task execution order is indicated as an edge (branch or edge) with the task as a node (node or vertex) is the object to be verified 11 is necessary for verifying 11. Therefore, by using such execution flow data, one route is uniquely specified by one integer value.

  Specifically, for each of a plurality of branches branched from one node in the execution flow, the total number of paths existing at the end of each branch is obtained. The sum of the total number of the paths for the nth branch and m, where m is the first integer value that identifies the nth (n: integer) th branch when a plurality of branches are arranged in order. As the first integer value that identifies the n + 1 th branch. The process for obtaining the first integer value is executed for all branches of all branches in the execution flow. Further, each of the plurality of paths is uniquely specified by a second integer value obtained based on the first integer value. Hereinafter, these processes will be described in detail.

  FIG. 5 is a flowchart showing a flow of processing for assigning the total number of routes. By executing this flowchart by a computer, the total number of paths existing ahead of each branch is obtained for each of a plurality of branches branched from one node. The total number of paths obtained is stored in the memory.

  In step S1, a total path value 1 is assigned to the end point End of the execution flow. In step S2, a task is searched for which the route total value is not assigned and the route total value of all the connection destination tasks is assigned. In the example of the execution flow shown in FIG. 1, the total number of routes is not assigned to task I and task J, and the total number of routes (1) of all the connection destination tasks (that is, end point End) has been assigned. Accordingly, in step S2, task I and task J are first extracted as search results.

  In step S3, the total of the route total values of the connection destination tasks of the searched task is set as its own route total value. In the example of the execution flow shown in FIG. 1, the total of the total route values (that is, 1) of the task I connection destination task (that is, the end point End) is the total route value of the task I. Similarly, the total (that is, 1) of the total number of paths of the connection destination task of Task J (that is, end point End) is set as the total number of paths of Task J.

  In step S4, it is determined whether route total values have been assigned to all tasks. If the total route value has been assigned to all tasks, the process is terminated. If there is a task to which the total number of routes is not yet assigned, the process returns to step S2. In the case of the above example, since the total number of routes is not assigned to tasks other than task I and task J, the process returns to step S2.

  In step S2, a task is searched for which the route total value is not assigned and the route total value of all the connection destination tasks is assigned. In the case of the above example, the task H has an unassigned route total value, and has already been assigned a route total value (1) of all the connection destination tasks (that is, tasks I and J). Therefore, task H is extracted as a search result.

  In step S3, the total of the route total values of the connection destination tasks of the searched task is set as its own route total value. In the above example, the total of the route total values of the task H connection destination tasks (namely, tasks I and J) (ie, 2) is set as the task H route total value. Thereafter, as a result of the determination in step S4, the process returns to step S2.

  In step S2 to be executed again, tasks B, D, and G have unassigned route total values and have already been assigned route total values (2) of all the connected tasks (ie, task H). Therefore, tasks B, D, and G are extracted as search results. In step S <b> 3, the total of the route total values of the task B connection destination task (i.e., task H) (i.e., 2) is set as the task B route total value. The same applies to tasks D and G. Thereafter, as a result of the determination in step S4, the process returns to step S2. In the same manner, the total number of routes for each task is obtained by searching the execution flow upstream (starting point Start).

  FIG. 6 is a diagram showing the total number of routes obtained for each task. As shown in FIG. 6, in each of a plurality of branches that branch from one node in the execution flow, the total number of paths of tasks included in the branch is the same. That is, for example, in the branch of A → C → D → H branched from the task A, the total number of paths of the tasks C and D included in the branch is the same. In other words, it can be said that the total path value is a value assigned to each of a plurality of branches branched from one node in the execution flow. Further, as can be seen from FIG. 6, the total number of paths corresponds to the total number of paths existing ahead of each branch for each of a plurality of branches branched from one node in the execution flow. That is, for example, in the branch including the task B (the branch of A → B → H), there are two paths that exist ahead of this branch, that is, H → I → End and H → J → End. Therefore, the total number of paths of the branch including this task B is 2. Further, for example, even in a branch including the task C (A → C → D → H branch), there are two paths existing at the tip of this branch, that is, H → I → End and H → J → End. Accordingly, the total path value of the branch including the task C is also 2.

  FIG. 7 is a flowchart showing a flow of processing for assigning route configuration values. By executing this flowchart by the computer, m is the total number of the paths for the n-th branch, where m is the first integer value that identifies the n-th branch when a plurality of branches are arranged in order. As a first integer value (path configuration value) that identifies the (n + 1) th branch. The obtained path configuration value is stored in the memory.

  In step S1, a task to which no route configuration value is assigned is searched. The search order of the tasks may be arbitrary. For example, in the example of the execution flow shown in FIG. 1 and FIG. 6, each task may be checked in a predetermined order from upstream (start point Start side) to downstream (end point End side).

  In step S2, it is determined whether or not the task extracted in step S1 is a task immediately after branching. For example, in the example of the execution flow shown in FIGS. 1 and 6, tasks B, C, E, I, and J correspond to tasks immediately after branching. If it is not a task immediately after branching, the process proceeds to step S4 and 0 is assigned as a route configuration value. That is, when the extracted task is not any of B, C, E, I, and J, the path configuration value of this task is 0.

  As a result of the determination in step S2, if the extracted task is a task immediately after branching, the process proceeds to step S3. In step S3, the total of the total route values of branch tasks existing on the left side of itself is assigned as a route configuration value. For example, in the case of task B, there is no branch task to the left of itself, so the total route total value of the branch task existing to the left of itself is zero. Therefore, the route configuration value 0 is assigned to task B. For example, in the case of task C, the total of the total number of routes of branch task B existing on the left side of itself is 2. Therefore, the route configuration value 2 is assigned to task C. For example, in the case of task E, the total of the total number of paths of branch tasks B and C existing on the left side of itself is 4. Therefore, the route configuration value 4 is assigned to the task E.

  Thereafter, in step S5, it is determined whether route configuration values have been assigned to all tasks. If route configuration values have been assigned to all tasks, the process is terminated. If there is still a task to which no route configuration value is assigned, the process returns to step S1. Through the above processing, a path configuration value for each task is obtained.

  FIG. 8 is a diagram showing route configuration values obtained for each task. As shown in FIG. 6, a route configuration value is assigned to a task immediately after branching from one node in the execution flow. This is because of a plurality of branches branching from one node in the execution flow. It is the same even if it is considered that a path configuration value is assigned to each. That is, for example, it may be considered that the path configuration value 2 is assigned to the branch of A → C → D → H branching from the task A. In this example, the route configuration values are assigned so as to increase sequentially from the left, but may be assigned sequentially from the right. That is, for example, task B (or branch branch A → B → H) is 0, task C (or branch branch A → C → D → H) is 2, task E (or branch branch A → E → F → G → H). ) May be assigned to task B, 2 to task C, and 0 to task E. In this case, since the total number of paths of each task (each branch branch) is the same value 2 (see FIG. 6), 0, 2, and 4 are assigned in order from the left and in order from the right. However, for example, if the total number of paths of task B is 4, it should be noted that 0, 4, and 6 are assigned in order from the left, and 4, 2, and 0 are assigned in order from the right.

  Instead of assigning in order from the left or in order from the right, if there is an order for specifying each task (or branch branch), the above 0, 2, and 4 may be assigned in that order. If this is formulated, the sum of the total number of the paths for the nth branch and m is defined as n + 1, where m is the path configuration value that identifies the nth branch when a plurality of branches are arranged in order. It is obtained as a path configuration value that identifies the th branch. In addition, the order here may be an order selected and arranged one by one at random.

  Each of the plurality of routes can be uniquely specified by the integer value obtained from the route configuration value obtained as described above. For example, the route Start → A → B → H → J → End is obtained by adding all the route configuration values on the route (that is, by obtaining the sum of the route configuration values specifying the branches included in the route). ) It can be specified by the obtained value 1 (= 0 + 1). Further, for example, the route Start → A → E → F → G → H → I → End can be specified by a value 4 (= 4 + 0) obtained by adding all the route configuration values on the route.

  As described above, it can be understood that one route can be uniquely specified by the sum of all route configuration values on the route as follows. Consider a case in which two adjacent branch branches (nth and n + 1th) are focused and all paths derived from these two branch branches (paths downstream from the start points of the two branch branches) are identified. No consideration is given to the upstream of the two branch branches. Let s be the total number of paths existing ahead of the nth branch branch, and m be the path configuration value that identifies the nth branch branch. If all the routes existing ahead of the nth branch branch are specified by s consecutive integer values, the sum of the route configuration values on the route is used as described above, and the nth branch branch is obtained. Can be identified by integer values m to m + s−1. At this time, if an integer value m + s is assigned to the (n + 1) th branch branch, all paths passing through the (n + 1) th branch branch are specified by an integer value equal to or greater than m + s. Therefore, a continuous integer value that specifies a route passing through the nth branch branch and a continuous integer value that specifies a route passing through the (n + 1) th branch branch are continuous integer values that do not overlap each other.

  FIG. 9 is a diagram showing integer values uniquely assigned to the respective routes shown in FIG. These integer values are values obtained by adding all route configuration values on each route as described above. In this example, the six paths shown in FIG. 1 are uniquely specified by six integers of 0 to 5.

  Based on the integer values shown in FIG. 9, one of the plurality of paths in FIG. 1 can be identified. That is, when one integer value of 0 to 5 is given, a path uniquely corresponding to this integer value can be specified. In this specific operation, a given integer value and a route configuration value as shown in FIG. 8 are used. It is assumed that the path configuration value as shown in FIG. 8 is stored in the memory.

  When an integer value k (0 or more and 5 or less) is given, the process proceeds downstream from the start point Start in FIG. 8 to the first branch point. When the branch point is reached (that is, when the branch point of task A is reached), the branch branch having the largest path configuration value of k or less is selected, and the selected branch branch is advanced. For example, when k is 4, the process proceeds to the rightmost branch branch (the branch branch of task E). For example, when k is 3, the process proceeds to the middle branch (the branch of task C). After that, the selected branch branch is advanced downstream. When the branch point is further reached (that is, when the branch point of task H is reached), the branch branch having the maximum path configuration value of k−M or less is selected, and the selected branch branch is advanced. Here, the integer value M is the total sum of the path configuration values of the branch branches selected and advanced so far. For example, when k is 4, the rightmost branch branch of the path configuration value 4 is selected. In this case, the branch branch having the maximum path configuration value of 0 (= 4-4) or less, that is, Go to Task I branch. For example, when k is 3, the middle branch branch of route configuration value 2 is selected. In this case, the branch branch having the largest route configuration value of 1 (= 3-2) or less, that is, a task. Go to J branch. In this way, for example, when the integer value k is 4, the path Start → A → E → F → G → H → I → End can be specified. When the integer value k is 3, the path Start → A → C → D → H → J → End can be specified.

  Note that the start value of the integer value for path identification shown in FIG. 9 is not necessarily 0. If the algorithm shown in FIG. 5 and FIG. 7 is used for calculation, the start value of the integer value is 0. For example, it corresponds to the two branch branches (task I and task J) at the bottom of the execution flow shown in FIG. Two branches may be assigned 1 and 2, respectively. In this case, the integer value for specifying the route is six integers of 1 to 6. However, in this case, when one integer value of 1 to 6 is given, the work of specifying a path uniquely corresponding to this integer value is slightly complicated. Specifically, a branch having the largest path configuration value smaller than k-M is selected at a branch point other than the last branch point, and the maximum is selected at a path configuration value equal to or less than k-M at the last branch point. The branch branch having the above may be selected. Similarly, the starting point may be set to 100, for example, and the route may be specified by an integer value of 100 to 105. In this case, the task of specifying a route uniquely corresponding to the integer value is further complicated, but the route can be easily specified as long as the rules for assigning the route configuration value are known. A configuration in which the start value of the integer value is 0 is the simplest and simplest, but is not limited to such a configuration.

  In the above embodiment, the total number of routes is assigned while going back from the downstream to the upstream (that is, returning from the end point End to the start point Start) according to the algorithm of FIG. 5, but the present invention is not limited to this configuration. . For example, the total number of paths may be assigned while proceeding from upstream to downstream (that is, proceeding from the start point Start to the end point End).

  FIG. 10 is a diagram illustrating an example of the total route value when the total route value is assigned so as to proceed from the start point Start to the end point End. In this case, the total number of paths existing ahead of each branch is obtained for each of a plurality of branches branching from one node from downstream to upstream. That is, for the branch of task B that branches from the node of task E, the total number of paths existing ahead (upstream) is 1, so 1 is assigned as the total number of paths. The same applies to the branch of task D and the branch of task G. For the branch of task I branching from the node at the end point End, the total number of paths existing ahead (upstream side) is 3, so 3 is assigned as the total number of paths. The same applies to the branch of task J.

  FIG. 11 is a diagram illustrating an example of route configuration values obtained for the total number of routes in FIG. Even in this case, when m is a path configuration value that identifies the nth branch when a plurality of branches are arranged in order, the total number of paths (total path value) for the nth branch and m Is obtained as a path configuration value for specifying the (n + 1) th branch.

  In the algorithm shown in FIG. 7, the route configuration value is assigned to the task immediately after the branch, but the route configuration value may be assigned to the task immediately before the branch. FIG. 12 is a diagram illustrating a result when a route configuration value is assigned to a task immediately before branching based on the total number of routes in FIG. FIG. 13 is a diagram showing a result when a route configuration value is assigned to a task immediately before branching based on the total number of routes in FIG. In other words, the task immediately before branching is the task immediately before joining.

  In the case shown above, a route configuration value is assigned to the task immediately before branching from one node in the execution flow, and this is assigned to each of a plurality of branches branching from one node in the execution flow. It is the same even if the route configuration value is considered to be assigned. In other words, even in this case, if it is formulated, the total number of the routes for the n-th branch and m, where m is the path configuration value that identifies the n-th branch when a plurality of branches are arranged in order. Is obtained as a path configuration value that specifies the (n + 1) th branch.

  FIG. 14 is a diagram illustrating an example of an array indicating priorities. When verifying the verification target 11 shown in FIG. 4, it may be preferable to set a priority for each execution route and execute the route according to the priority order. By executing the routes according to the priorities in this way, important task execution patterns can be preferentially verified, and design defects for important task execution patterns can be detected and corrected at an early stage. In the example shown in FIG. 14, the array 20 is prepared on the memory. The array index is made to correspond to an integer value that uniquely identifies a plurality of paths, and the stored value of the array is used as the priority of the path indicated by the corresponding index. That is, for example, the stored value 3 of the array index 3 indicates that the priority of the path specified by the integer value 3 (for example, Start → A → C → D → H → J → End shown in FIG. 9) is 3. In this example, for example, the higher the priority value, the higher the priority.

  FIG. 15 is a flowchart of processing for executing a route according to the order of priority. By executing the processing of this flowchart by a computer, verification according to priority can be performed.

  In step S1, the maximum value of the priority stored in the array is obtained. In the example of FIG. 14, the maximum priority is 3 in the initial state. In step S2, a route value is randomly generated. That is, an integer value that uniquely identifies the path (for example, one of six integer values from 0 to 5) is randomly generated. In step S3, it is determined whether the priority of the generated route value is the maximum value. For example, when the generated route value is 2, it can be seen that the priority of the generated route is 2 and not the maximum value 3 with reference to the array 20 in FIG. If the priority of the generated route value is not the maximum value, the process returns to step S2 and repeats random generation of the route value. When the priority of the generated route value is the maximum value, the process proceeds to step S4.

  In step S4, a route corresponding to the route value is generated and the route is executed. That is, for example, in the case of route value 3 corresponding to priority 3, route Start → A → C → D → H → J → End is generated (specified) based on this route value 3 and verified by test bench 10. This route is executed for the target 11. In step S5, the stored value of the array corresponding to the route value is set to zero. For example, when the route value of the executed route is 3, the array storage value 3 corresponding to the index 3 of the array 20 in FIG.

  In step S6, it is determined whether all the array storage values are 0 or not. That is, for example, it is determined whether or not all six array storage values of the array 20 are zero. If all the values are 0, all the routes have been executed, and the process is terminated. If there is a non-zero array storage value, the process returns to step S1 and the subsequent processing is repeated.

  FIG. 16 is a diagram illustrating how the array storage value changes as a result of path execution. (A) shows the processing state of the input value 20, and the array storage value is the same as the value shown in FIG. In this state, the route corresponding to the route value 3 corresponding to the maximum priority 3 is executed, and the array storage value of this route value 3 is changed to 0. (B) shows the state of the array 20 after the array storage value of the route value 3 is set to zero. In this state, there are a route value 0 and a route value 2 corresponding to the maximum priority 2, a route corresponding to the route value 2 selected at random is executed, and the array storage value of this route value 2 is set to 0. Change to (C) shows the state of the array 20 after the array storage value of the route value 2 is set to zero. In this state, the route corresponding to the route value 0 corresponding to the maximum priority 2 is executed, and the array storage value of the route value 0 is changed to 0. (D) shows the state of the array 20 after the array stored value of the route value 0 is set to 0. In this state, there are route values 1, 4, and 5 corresponding to the maximum priority 1, and a route corresponding to the route value 4 selected at random is executed, and the array storage value of this route value 4 is set to 0. Change to (E) shows the state of the array 20 after the array storage value of the route value 4 is set to zero. In this state, there are route values 1 and 5 corresponding to the maximum priority 1, and a route corresponding to the route value 1 selected at random is executed, and the array storage value of this route value 1 is changed to 0. . (F) shows the state of the array 20 after the array stored value of the route value 1 is set to zero. In this state, the route corresponding to the route value 5 corresponding to the maximum priority 1 is executed, and the array storage value of this route value 5 is changed to 0. (G) shows the state of the array 20 after the array storage value of the route value 5 is set to zero. As shown in (g), when all the array storage values of the array 20 become 0, the execution of all the paths has been completed, so the path execution process ends.

  FIG. 17 is a diagram showing the configuration of an apparatus for executing the route management method according to the present invention.

  As shown in FIG. 17, the apparatus for executing the route management method according to the present invention is realized by a computer such as a personal computer or an engineering workstation. 17 includes a computer (computer) 510, a display device 520 connected to the computer 510, a communication device 523, and an input device. The input device includes a keyboard 521 and a mouse 522, for example. The computer 510 includes a CPU 511, a RAM 512, a ROM 513, a secondary storage device 514 such as a hard disk, a replaceable medium storage device 515, and an interface 516.

  The keyboard 521 and the mouse 522 provide an interface with the user, and various commands for operating the computer 510, user responses to requested data, and the like are input. The display device 520 displays the results processed by the computer 510 and displays various data to enable interaction with the user when operating the computer 510. The communication device 523 is for performing communication with a remote place, and includes, for example, a modem or a network interface.

  The route management method according to the present invention is provided as a computer program executable by the computer 510. This computer program is stored in the storage medium M that can be mounted on the replaceable medium storage device 515, and is loaded from the storage medium M to the RAM 512 or the secondary storage device 514 via the replaceable medium storage device 515. Alternatively, the computer program is stored in a remote storage medium (not shown), and is loaded from the storage medium to the RAM 512 or the secondary storage device 514 via the communication device 523 and the interface 516.

  When there is a program execution instruction from the user via the keyboard 521 and / or the mouse 522, the CPU 511 loads the program from the storage medium M, the remote storage medium, or the secondary storage device 514 to the RAM 512. The CPU 511 uses the free storage space of the RAM 512 as a work area, executes the program loaded in the RAM 512, and advances the process while appropriately interacting with the user. The ROM 513 stores a control program for controlling basic operations of the computer 510.

  By executing the computer program, the computer 510 executes the route management method as described in the above embodiments. Specifically, by executing a computer simulation by the computer 510, the verification operation for the verification target 11 by the test bench 10 is executed as shown in FIG. When executing the verification operation, the route to be executed is managed in such a manner that one route is uniquely specified by one route value.

  As mentioned above, although this invention was demonstrated based on the Example, this invention is not limited to the said Example, A various deformation | transformation is possible within the range as described in a claim.

The present invention includes the following contents.
(Appendix 1)
In the computer simulation, when the test bench performs an operation on the verification target as a task and a plurality of paths composed of a series of tasks are given as the task execution flow,
For each of a plurality of branches branched from one node in the execution flow, the total number of paths existing ahead of each branch is obtained by a computer and stored in a memory;
When the first integer value that identifies the nth (n: integer) th branch when the plurality of branches are arranged in order is m, the sum of the total number of the paths for the nth branch and m is obtained by a computer as a first integer value that identifies the (n + 1) th branch and stored in memory;
A route management method comprising the steps of uniquely identifying each of the plurality of routes by a computer using a second integer value based on the first integer value.
(Appendix 2)
The route management method according to claim 1, wherein the step of obtaining the first integer value obtains the first integer value for all branches of all branches in the execution flow.
(Appendix 3)
In the step of uniquely specifying, the sum of the first integer values that specify branches included in one route is obtained as the second integer value, and the one route is uniquely specified by the sum. The route management method according to Supplementary Note 1 or 2, which is characterized by
(Appendix 4)
In the step of uniquely specifying, when one integer is given as the second integer value, 1 of the plurality of paths is determined based on the one integer and the first integer value stored in the memory. 4. The route management method according to any one of appendices 1 to 3, wherein one is specified.
(Appendix 5)
Storing the priority assigned to each of the plurality of paths in a memory;
In accordance with the priority order stored in the memory, the test bench executes the plurality of paths with respect to the verification target,
The route management method according to any one of appendices 1 to 4, further comprising: each step of specifying an executed route by the second integer value and recording it in a memory.
(Appendix 6)
Memory that stores data describing a verification target, a test bench that executes a task on the verification target in a computer simulation, and data that defines a task execution flow indicating a plurality of paths composed of a series of tasks When,
An arithmetic processing unit that executes a computer simulation for verifying the operation of the verification target, based on data describing the verification target stored in the memory, the test bench, and data defining the execution flow The arithmetic processing unit is:
For each of a plurality of branches branching from one node in the execution flow, the total number of paths existing ahead of each branch is obtained and stored in the memory,
When the first integer value that identifies the nth (n: integer) th branch when the plurality of branches are arranged in order is m, the sum of the total number of the paths for the nth branch and m is obtaining the first integer value identifying the n + 1 th branch and storing it in the memory;
A verification apparatus that executes each step of uniquely identifying each of the plurality of paths by a second integer value based on the first integer value.

It is a figure which shows notionally an example of the execution flow which consists of a series of tasks. It is a flowchart which shows an example of the conventional path | route execution method. It is a figure which shows the content of the data memorize | stored in a memory area. It is a figure which shows the environment which verifies operation | movement of verification object by computer simulation. It is a flowchart which shows the flow of the process which allocates a route total value. It is a figure which shows the path | route total value calculated | required about each task. It is a flowchart which shows the flow of the process which allocates a route | root structure value. It is a figure which shows the path | route structure value calculated | required about each task. It is a figure which shows the integer value allocated uniquely with respect to each path | route shown in FIG. It is a figure which shows an example of a route total value at the time of assigning a route total value so that it may progress to an end point from a starting point. It is a figure which shows an example of the path | route structure value calculated | required with respect to the path | route total value of FIG. It is a figure which shows the result at the time of assigning a path | route structure value to the task just before a branch based on the total number value of a path | route of FIG. It is a figure which shows the result at the time of assigning a path | route structure value to the task just before a branch based on the total number value of a path | route of FIG. It is a figure which shows an example of the arrangement | sequence which shows a priority. It is a flowchart of the process which performs a path | route according to the order of a priority. It is a figure which shows the mode of the change of the array storage value accompanying path | route execution. It is a figure which shows the structure of the apparatus which performs the path | route management method by this invention.

Explanation of symbols

10 Test bench 11 Verification target 20 Array 510 Computer 511 CPU
512 RAM
513 ROM
514 Secondary storage device 515 Exchangeable media storage device 516 Interface 520 Display device 521 Keyboard 522 Mouse 523 Communication device

Claims (5)

In the computer simulation, when the test bench performs an operation on the verification target as a task and a plurality of paths composed of a series of tasks are given as the task execution flow,
For each of a plurality of branches branched from one node in the execution flow, the total number of paths existing ahead of each branch is obtained by a computer and stored in a memory;
When the first integer value that identifies the nth (n: integer) th branch when the plurality of branches are arranged in order is m, the sum of the total number of the paths for the nth branch and m is obtained by a computer as a first integer value that identifies the (n + 1) th branch and stored in memory;
A route management method comprising the steps of uniquely identifying each of the plurality of routes by a computer using a second integer value based on the first integer value.   2. The path management method according to claim 1, wherein the step of obtaining the first integer value obtains the first integer value for all branches of all branches in the execution flow.   In the step of uniquely specifying, the sum of the first integer values that specify branches included in one route is obtained as the second integer value, and the one route is uniquely specified by the sum. The route management method according to claim 1 or 2, characterized in that   In the step of uniquely specifying, when one integer is given as the second integer value, 1 of the plurality of paths is determined based on the one integer and the first integer value stored in the memory. The route management method according to any one of claims 1 to 3, wherein one is specified. Storing the priority assigned to each of the plurality of paths in a memory;
In accordance with the priority order stored in the memory, the test bench executes the plurality of paths with respect to the verification target,
5. The route management method according to claim 1, further comprising: each step of specifying an executed route by the second integer value and recording it in a memory.

Images