JP7210917B2 - Verification information generation device, verification information generation method, and verification information generation program - Google Patents

Description

The present invention relates to a verification information generation device, a verification information generation method, and a verification information generation program for generating verification information used for system verification.

In recent years, information and communication technology systems (ICT (Information and Communication Technology) systems) have become one of the infrastructures that support society, and their importance is increasing. On the other hand, ICT systems are becoming larger and more complex, making it difficult to construct or change them. Therefore, a configuration management technique for the purpose of efficiently constructing or modifying an ICT system is attracting attention.

For example, configuration management techniques for ICT systems generally involve developing a model of the ICT system and using the developed model to build or modify the ICT system. As one of configuration management techniques for an ICT system that involves model development, a technique for automatically generating a procedure for building or changing components (state elements) of the ICT system is known.

Patent Literature 1 and Non-Patent Literature 1 describe the current state of the system and the state of the system after construction or after modification using information declaratively describing the state after construction or modification of the system as a model. and automatically calculate a procedure for building or changing a system.

A state model that declaratively describes the state of a system as a model disclosed in Patent Document 1 and Non-Patent Document 1 will be described. In addition, in Patent Document 1, a "state model" is called a "state machine group", and a "state element" is called a "state machine".

A state model is a data model that represents the information necessary to calculate a procedure for changing a system, and is composed of state elements and dependencies between the state elements.

A state element represents a component in the system configuration that has an independent state and is the smallest building block considered in the computation of procedures. A state element is defined by a plurality of exclusive states and state transitions (transitions) between the plurality of states. A state represents a possible state of the system. In addition, a state can define a plurality of states, and always includes one current state (current state) and any number of states (requested states) that change from the current state according to requests.

A transition represents from which state the system can change to which state, and can be defined as a change between arbitrary states in the same state element.

Dependencies are then defined from the transitions in one state element to the states of other state elements. That is, it expresses the condition that the latter state element must be in that state in order for the former state element to make that transition.

Note that the state elements correspond to parts in the system configuration. A transition performed by a state element is synonymous with a single step performed by a component in the overall procedure of building or modifying a system.

The state model will be specifically described with reference to FIG. FIG. 1 is a diagram for explaining a state model. In FIG. 1, state elements TC and UV (for example, components such as software) are represented by rectangles, and states f and t are represented by ellipses. The state elements TC and UV are identification information for identifying each state element.

In FIG. 1, the current state f is represented by a double-lined ellipse, and the desired state t is represented by a black ellipse. The current state f represents, for example, a state in which software is not installed, and the desired state t represents, for example, a state in which software is installed.

Furthermore, state transitions are represented by solid arrow lines, and dependencies are represented by dashed arrow lines. In FIG. 1, the dependency is represented by an arrow line leading from the state element TC to the required state t. This indicates that the state transition in the state element TC depends on the desired state t. In other words, a state element TC depends on a state element UV if the state element TC includes a state transition that depends on the state of another state element UV. Alternatively, state element TC has a dependency on state element UV.

Next, test technology for model development verification will be explained. In model development in system configuration management, in order to confirm the validity of the model, it is necessary to verify whether the developed product is as expected, as in software development. However, since there is currently no de facto test technology for model development verification, model developers use software test technology to conduct their own tests.

Test cases (verification information) are generally created to cover a large number of combinations of parameters in order to confirm that the software operates properly with various input contents and usage environments. However, since the number of combinations is enormous, it is necessary to select combinations in order to reduce the number of test man-hours to a realistic level.

Therefore, the pairwise method is one of the software testing techniques that can be expected to be applied to model development. The pairwise method is a technique that can reduce the number of combinations adopted for test cases without greatly impairing the quality of the test (for example, the accuracy with which bugs can be found). Specifically, instead of creating a test case that covers all combinations of values between all parameters, when you focus on any two parameters, all combinations of values between those two parameters are covered. create a test case that

Let's take the creation of test cases for a website as an example. FIG. 2 is a diagram for explaining the pairwise method. Specifically, Figure 2 shows a test case that combines the operating system, browser, and search engine that a user uses to access a website. That is, test cases are shown assuming OS_W or OS_L for the operating system, BR_C or BR_F for the browser, and SE_G or SE_Y for the search engine as candidates for the parameter used by the user.

In this case, since each parameter can take two values, if test cases are created that cover all combinations of values between all parameters, 8 (2 3 ) test cases will be created. be done.

However, in the pairwise method, only four test cases are created, as shown in FIG. The reason is that no matter which two parameters (columns) in FIG. 2 are focused on, four types (2 squared) are covered by combining all values between those parameters. In this way, when attention is paid to two arbitrary parameters, the pairwise method creates test cases that cover all combinations of values between the two parameters.

Pairwise methods are also based on the rule of thumb that software failures are often caused by combinatorial problems between a small number of factors (eg, two or three factors). Therefore, the pairwise method can reduce the number of test cases without greatly impairing the test quality described above.

Furthermore, the general pairwise method is a testing technique with input and environment as parameters, so it is not suitable for state model testing. On the other hand, the pairwise method for state transition systems is considered to have affinity for testing state models because the basic concept of state models is the same as that of state transition systems.

As a related technique, Non-Patent Document 2 discloses a technique in which states are parameters, transitions are values, all paths that satisfy a specific condition are listed, and all the listed paths are used as test cases. .

In addition, Non-Patent Document 3 lists event sequences that pass through the path of a state transition system that models a test target, classifies the values of each parameter of the event included in each event sequence, and classifies each event sequence, A technique for generating test cases using a pairwise method with events as parameters and classes as values is disclosed.

JP 2015-215885 A

Kuroda T, et al., “Model-based IT Change Management for Large System Definitions with State-related Dependencies,” Proc. of EDOC 2014, 2014. Toshiro Tsurumaki, "Development of Open Source Combination Test Tool - Tabular Modeling of Constraints in Combination -", JaSST 2009, 2009. Cu D. Nguyen, et al., “Combining Model-Based and Combinatorial Testing for Effective Test Case Generation,” Proc. of ISSTA 2012, 2012.

However, in the test techniques related to verification of model development disclosed in Non-Patent Documents 2 and 3, for example, although the number of possible states of an ICT system is enormous, the enormous number of states can be determined in advance. After preparing everything, it is necessary to perform test processing. In addition, since the actual system is very large scale, a huge amount of computational resources is required to process it in a realistic amount of time.

For example, a storage unit with a size that can store all possible states of the ICT system is required, but normally it is difficult to satisfy such a condition. Even if such a condition could be satisfied, the processing speed of the construction or change process would be greatly reduced.

In addition, in the above-described test techniques related to verification of model development disclosed in Non-Patent Documents 2 and 3, when the states of the entire system are different, the parts are treated as different parameters in the pairwise method. Therefore, even if the states of most of the parts that make up the ICT system are the same, if even some of the parts are in different states, verification covering all combinations of parameter values (operations on the ICT system) is performed between parameters.

In the pairwise method, failures in ICT systems are often caused by combinations of states and operations between a small number of parts. becomes enormous. Therefore, enormous computational resources are required.

An example of an object of the present invention is to provide a verification information generation device, a verification information generation method, and a verification information generation program that reduce computational resources in a system.

In order to achieve the above object, a verification information generation device according to one aspect of the present invention includes:
a state transition detection unit that detects one or more transitions that can be executed from a target state extracted from the state elements of the state model corresponding to the system;
a state transition pair management unit that manages a plurality of state transition pair information in which states and transitions are associated;
a transition selection unit that selects, from among the transitions detected by the state transition detection unit, a transition having the largest number of state transition pair information detected when a transition that has not yet been selected is executed;
a test case generation unit that generates a test case based on the transition selected by the transition selection unit;
characterized by having

Further, in order to achieve the above object, a verification information generation method according to one aspect of the present invention includes:
(a) detecting one or more transitions that can be executed from a state of interest extracted from state elements of a state model corresponding to the system;
(b) managing a plurality of state transition pair information in which states and transitions are associated; and (c) executing transitions not yet selected among the transitions detected in step (a) selecting the transition with the highest number of said state transition pair information detected in the case;
(d) generating test cases based on the transitions selected in step (c);
characterized by having

Furthermore, in order to achieve the above object, the verification information generation program in one aspect of the present invention
(a) detecting one or more transitions that can be executed from a state of interest extracted from state elements of a state model corresponding to a system;
(b) managing a plurality of state transition pair information in which states and transitions are associated; and (c) executing transitions not yet selected among the transitions detected in step (a) selecting the transition with the highest number of said state transition pair information detected in the case;
(d) generating test cases based on the transitions selected in step (c);
is characterized by executing

As described above, according to the present invention, computational resources in the system can be reduced.

FIG. 1 is a diagram for explaining a state model. FIG. 2 is a diagram for explaining the pairwise method. FIG. 3 is a diagram illustrating an example of a verification information generation device; FIG. 4 is a diagram showing a system having a verification information generation device. FIG. 5 is a diagram showing an example of a state model. FIG. 6 is a diagram showing an example of a state model. FIG. 7 is a diagram showing an example of a test case (transition sequence). FIG. 8 is a diagram illustrating an example of the operation of the verification information generation device; FIG. 9 is a diagram showing an example of pseudo code for step A3. FIG. 10 is a diagram showing an example of the operation of step A3. FIG. 11 is a diagram illustrating an example of a computer that implements the verification information generation device.

(Embodiment)
Embodiments of the present invention will be described below with reference to FIGS. 3 to 11. FIG.

[Device configuration]
First, with reference to FIG. 3, the configuration of the verification information generation device according to this embodiment will be described. FIG. 3 is a diagram illustrating an example of a verification information generation device;

As shown in FIG. 3, the verification information generation device 1 is a device for reducing computational resources in a system (such as an ICT system, for example). The verification information generation device 1 has a state transition detection unit 2 , a state transition pair management unit 3 , a transition selection unit 4 and a test case generation unit 5 .

Of these, the state transition detection unit 2 detects one or more transitions that can be executed from the target state, extracted from the state elements of the state model corresponding to the system. The state transition pair management unit 3 manages a plurality of state transition pair information in which states and transitions are associated with each other. The transition selection unit 4 selects the transition having the largest number of state transition pair information detected when the unselected transitions are executed among the transitions detected by the state transition detection unit 2 . The test case generator 5 generates test cases based on the transitions selected by the transition selector 4 .

As described above, in accordance with the concept of the pairwise method, the present embodiment uses state transition pair information generated in advance to generate test cases within a necessary range. Therefore, unlike the conventional system, there is no need to prepare in advance all of the huge number of possible states that the system can take before performing processing related to building or changing the system, so that computational resources required for processing can be reduced. In addition, since computational resources can be reduced, it is possible to verify a larger-scale system. Furthermore, since the number of test cases can be reduced, the man-hours for verification can also be reduced.

Next, with reference to FIG. 4, the configuration of the verification information generation device 1 according to this embodiment will be described more specifically. FIG. 4 is a diagram showing a system having a verification information generation device.

As shown in FIG. 4, the verification information generation device 1 according to the present embodiment includes a state transition detection unit 2, a state transition pair management unit 3, a transition selection unit 4, and a test case generation unit 5. It has an input device 6 , an output device 7 and a storage unit 8 .

The state transition detection unit 2 detects transitions to which the target state CS1 can transition. Specifically, the state transition detection unit 2 acquires a state model having a plurality of state elements corresponding to the system, and uses the acquired state model to detect the current state CS1 of the entire system. Subsequently, the state transition detection unit 2 stores the detected state CS1 as a detected state in the state aggregation unit ES1 that stores detected states. The state collection unit ES1 is provided in the storage unit 8 provided inside the verification information generation device 1 or in a storage unit (not shown) provided outside thereof. Subsequently, the state transition detector 2 acquires all executable transitions from the state CS1.

Further, the state transition detection unit 2 detects the state NS1 obtained by transition of the target state CS1, and sets the detected state NS1 as the next target state CS1.

The state transition pair management unit 3 manages the storage unit inside the state transition pair management unit 3 or the state transition pair storage unit MI1 provided in advance in the storage unit 8 or the like described above. The state transition pair storage unit MI1 has a plurality of pieces of state transition pair information that associate the state of a state element that is different from the subject of the transition and the transition of the state element that is the subject of the transition when the state element makes a state transition. .

Specifically, when the state transition detection unit 2 causes the state CS1 to transition, the state transition pair management unit 3 refers to the state transition pair storage unit MI1 and stores each state element different from the subject of the transition before making the transition. and the state transition pair information that matches the state of the state element and the transition of the state element that is the subject of the transition. When the state transition pair information is detected, the state transition pair management unit 3 associates (checks) check information indicating detection with the state transition pair information.

Further, a method of generating state transition pair information will be specifically described with reference to FIGS. 5 and 6. FIG. 5 and 6 are diagrams showing examples of state models. The system shown in FIG. 5 has state elements (parts) A and B. In FIG. Parts A and B each have a state f and a state t. Also, the states f and t of the parts A and B transition from the state f to the state t (f→t). Also, the state t transits to the state f (t→f).

In FIGS. 5 and 6, state elements A, B, and C (for example, software components) are represented by rectangles, and states f and t are represented by ellipses. 5 and 6, the current state f is represented by a double-lined ellipse, and the desired state t is represented by a black ellipse. For example, the current state f represents, for example, a state in which software is not installed, and the desired state t represents, for example, a state in which software is installed. State transitions are indicated by solid arrow lines, and dependencies are indicated by broken arrow lines.

For example, when the initial states of parts A and B are state f, part A transitions from state f to state t (A: f→t). In this case, the state transition pair management unit 3 associates the state f of the component B with the transition of the component A (A: f→t) and stores them as state transition pair information in the state transition pair storage unit MI1.

Next, when part A is in state t and part B is in state f, it is assumed that part B transitions from state f to state t (B: f→t). In this case, the state transition pair management unit 3 associates the state f of the component A with the transition of the component B (B: f→t) and stores them as state transition pair information in the state transition pair storage unit MI1.

In this way, all combinations of state transition pair information are stored in advance in the state transition pair storage section MI1. However, the state transition pair management unit 3 does not store state transition pair information that does not hold in the state transition pair storage unit MI1 due to the dependency relationship. In FIG. 5, combinations of state transition pair information stored in the state transition pair storage section MI1 in advance are shown below.

(A: f, B: f→t)
(A: f, B: t→f)
(A: t, B: f→t)
(B: f, A: f→t)
(B: f, A: t→f)
(B: t, A: f→t)
(B: t, A: t→f)

Note that state transition pair information (A: t, B: t→f) has a dependency relationship as shown in FIG. Because you can't.

Also, even if the number of components that make up the entire system increases, the format of the state transition pair information does not change. The system shown in FIG. 6 has state elements (parts) A, B, and C; Assume that the initial state of parts A, B, and C is state f, and part A transitions from state f to state t (A: f→t). In this case, the state f of the component B and the transition of the component A (A: f→t) are associated and stored as state transition pair information in the state transition pair storage section MI1.

When the initial state of each of the components A, B, and C in the system of FIG. State transition pair information is (B: f, A: f→t) and (C: f, A: f→t).

The states detected by the state transition detection unit 2 and the states stored by the state collection unit ES1 described above do not have the same granularity as the states stored as the state transition pair information. That is, the states detected by the state transition detection unit 2 and the states stored by the state collection unit ES1 are the states of the entire system. In the example of FIG. 6, the information indicates that part A is in state t, part B is in state f, and part C is in state f. On the other hand, a state held as a state transition pair indicates the state of any one component.

Next, a method of generating state transition pair information generated in advance by the state transition pair management unit 3 will be described. For any pair of state elements (parts) included in the system, all combinations of states of one state element and transitions of the other state element are generated. However, state transition pair information that cannot be realized due to dependencies is excluded.

For example, in the case of a pair of parts A and B as an example of the state transition pair information of an arbitrary part in FIG. 5, the state transition pair information to be generated is as described above.

This enumerates all pairs of states f and t of part A and transitions f→t and t→f of part B, and states f and t of part B and transitions f→t and t→f of part A. ing. However, (A: t, B: t→f), which cannot be realized due to dependencies, is excluded. This is created for all pairs of arbitrary parts. For example, the only component pairs in the system of FIG. 5 are A and B, whereas the component pairs in the system of FIG. 6 are A and B, A and C, and B and C.

Note that the pairwise method tests not all combinations of parameters, but any combination of two parameters.

The transition selection unit 4 selects the transition T1 with the largest number of state transition pair information to be checked by executing transitions that have not yet been selected among the transitions extracted by the state transition detection unit 2 . Specifically, the transition selection unit 4 selects the checked state managed by the state transition pair management unit 3 by executing among the candidates to which each component (state element) can transition from the current target state CS1. Select the transition with the highest number of transition pairs.

The test case generation unit 5 generates test cases (verification information) for verifying the system within the range where the state transition detection unit 2 has searched for the state transition system. A test case is, for example, a sequence of transitions executed for each part from the initial state of the system to a certain state. A component transition is synonymous with a single step performed by a component in the overall procedure of system construction or modification, and a sequence of transitions is synonymous with the overall procedure of system construction or modification.

In the system of FIG. 3, a transition sequence in which part A executes transition (A: f→t) and then part B executes transition (B: f→t) is one of the test cases. FIG. 7 is a diagram showing an example of a test case (transition sequence). Note that FIG. 7 is an image, and is not limited to the format of FIG.

The input device 6 is a device that is connected to the verification information generation device 1 and outputs the state model to the verification information generation device 1 . The output device 7 is a device that is connected to the verification information generation device 1 and acquires test cases output from the verification information generation device 1 .

[Device operation]
Next, the operation of the verification information generation device 1 according to the embodiment of the present invention will be explained using FIG. FIG. 8 is a diagram illustrating an example of the operation of the verification information generation device; 3 to 7 will be appropriately referred to in the following description. Further, in the present embodiment, the verification information generation method is implemented by operating the verification information generation device 1 . Therefore, the description of the verification information generation method in this embodiment is replaced with the description of the operation of the verification information generation device below.

First, the verification information generation device 1 acquires the state model M1 of the verification target system (step A1). Specifically, the verification information generation device 1 acquires the state model M1 output from the input device 6 . Subsequently, the verification information generation device 1 detects the initial state IS1 of the entire system from the state model M1 (step A2).

After that, the verification information generation device 1 sets the initial state IS1 as the initial search target, and recursively performs a depth-first search (step A3). The processing of step A3 will be described later. Subsequently, the verification information generation device 1 outputs all test cases stored in step A3 (step A4). Specifically, the verification information generation device 1 outputs test cases to the output device 7 .

Next, the operation of step A3 will be described in detail with reference to FIGS. 9 and 10. FIG. FIG. 9 is a diagram showing an example of pseudo code for step A3. FIG. 10 is a diagram showing an example of the operation of step A3.

First, the state transition detector 2 determines whether the current target state CS1 has been detected or whether all the state transition pair information has been checked (step A131).

If the state CS1 to be searched currently is stored in the state collection unit ES1, or if all of the state transition pair information managed by the state transition pair management unit 3 has been checked (step A131 : Yes), the content of the transition stack TS1 storing transitions at that time is stored as a test case in the above-described storage unit 8 or the like (step A132).

After that, the state transition detection unit 2 terminates the current recursive process of step A3.

It should be noted that step A3 as a whole represents processing for one step of recursion in the above-described recursive depth-first search. In step A141, which will be described later, the recursion proceeds to the next stage. Further, step A132 does not end the entire recursive process, but ends one recursive step (one step A3). Therefore, the next process is the recursive step A141 of the previous stage. It should be noted that in step A141, if the recursion is the first stage, the entire recursive process ends.

Next, the state transition detection unit 2 detects whether the state CS1 currently being searched for is included in the state collection unit ES1, or if all of the state transition pair information managed by the state transition pair management unit 3 has not been checked ( Step A131: No), the state CS1 is stored in the state collection unit ES1 (step A133).

Specifically, when the target state CS1 first visits the initial state, the current search target state CS1 is not included in the state collection unit ES1 and all of the state transition pair information has not been checked. Unit 2 executes the process of step A133. On the other hand, when the state CS1 to be searched now returns to the initial state (visited from the second time onwards), the initial state has always been searched first, so it is included in the state set part ES1, and the recursion ends.

Note that the state transition detection unit 2 stores in the storage unit 8 that the detected state has been detected when the state CS1 currently being searched for is searched. For example, the target state CS1 is added to the state aggregation unit ES1.

Subsequently, the state transition detector 2 extracts all executable transitions from the target state CS1 (step A134). Subsequently, state transition detection unit 2 determines whether or not there is a transition that has not yet been selected among the extracted transitions (step A135). If there is a transition that has not been selected (step A135: Yes), state transition detector 2 executes the process of step A136. If there is no unselected transition (step A135: No), state transition detector 2 executes the process of step A142.

Subsequently, if there is an unselected transition, state transition detector 2 determines whether or not there is state transition pair information to be newly checked in the remaining transitions (step A136).

If there is state transition pair information to be newly checked in the remaining transitions (step A136: Yes), the state transition detector 2 executes the process of step A137. If there is no state transition pair information to be newly checked in the remaining transitions (step A136: No), state transition detector 2 executes the process of step A142.

At step A137, the transition selection unit 4 executes the transitions that have not yet been selected among the transitions extracted by the state transition detection unit 2 at step A134, so that the number of state transition pair information to be checked is the largest. Select transition T1. Specifically, the transition selection unit 4 selects the checked state transition pair managed by the state transition pair management unit 3 most among the candidates to which each component can transition from the current target state CS1. Select more transitions.

Subsequently, the state transition detector 2 pushes the selected transition T1 to the transition stack TS1, for example (step A138). Subsequently, the state transition detection unit 2 detects the state NS1 obtained by transition of the target state CS1, and sets the detected state NS1 as the next target state CS1.

Subsequently, the state transition pair management unit 3 checks the state transition pair information between the state of the component and the transition T1 (step A139). Specifically, the state transition pair management unit 3 enumerates the states of each of the parts that are different from the part that causes the transition T1 to transition, and states transition pair information that matches any one of the states and the transition T1. detect all Then, the state transition pair management unit 3 associates check information indicating detection with the state transition pair information.

Subsequently, the state transition detection unit 2 recursively performs a depth-first search for the state NS1 obtained by transition T1 of the state CS1 currently being searched for as a search target (step A140). However, when the recursive depth-first search is completed (when the recursive process has returned to this point), state transition detector 2 pops transition T1 from transition stack TS1 (step A141).

Subsequently, state transition detection unit 2 determines whether or not a transition has been selected even once in step A137 (step A142). If a transition has never been selected in step A137 (step A142: Yes), state transition detector 2 executes the process of step A132. If a transition has been selected even once in step A137 (step A142: No), the state transition detection unit 2 ends the processing of step A3 (ends the recursive one-stage processing).

Then, the state transition detection unit 2 repeatedly executes the processing from steps A135 to A141 until there is no transition that has not been selected in step A137 (step A135: Yes). Further, when selecting a transition at step A137, if there are only transitions for which there is no state transition pair information to be newly checked, the repeated processing from steps A135 to A141 is exited (step A136: No).

Furthermore, when the iterative process is exited in step A135 or step A136, if no transition is selected in step A137, the test case generator 5 stores the content of the transition stack TS1 at that time as a test case. Store in part 8 or the like. That is, if there is no state transition pair information to be newly checked for all the transitions acquired in step A134, the test case generation unit 5 stores the contents of the transition stack TS1 at that point in the storage unit 8 or the like as a test case. Remember. Then, the state transition detection unit 2 ends the process of step A3 (ends the recursive one-stage process).

[Effects of this embodiment]
As described above, according to the present embodiment, in accordance with the idea of the pairwise method, test cases within a necessary range are generated using state transition pair information generated in advance. Therefore, unlike the conventional system, there is no need to prepare in advance all of the huge number of possible states that the system can take before performing processing related to building or changing the system, so that computational resources required for processing can be reduced. In addition, since computational resources can be reduced, it is possible to verify a larger-scale system. Furthermore, since the number of test cases can be reduced, the man-hours for verification can also be reduced.

For example, the state transition detection unit 2 searches for the state transition system of an ICT system composed of a plurality of parts while determining the next transition to be executed according to the output of the transition selection unit 4 . Further, when the state transition detection unit 2 executes a transition of the state transition system, the state transition pair management unit 3 stores the state of the ICT system component before executing the transition and the execution Check the pair with the transition (state transition pair). The transition selection unit 4 determines the transition to be executed from the current state of the state transition system being searched by the state transition detection unit 2. The state transition pair management unit 3 manages the state transition pair management unit 3 by executing among the transition candidates. Choose the transition with the most checked state transition pairs that Then, the test case generator 5 generates a test case covering the range in which the state transition detector 2 searched for the state transition system.

By doing so, it is not necessary to prepare in advance all of the huge number of states that the ICT system can take before performing processing related to construction or modification of the ICT system, so it is possible to reduce the computational resources required for processing. . In addition, since computational resources can be reduced, it is possible to verify a larger-scale system. Furthermore, since the number of test cases can be reduced, the man-hours for verification can also be reduced.

[program]
The program according to the embodiment of the present invention may be any program that causes a computer to execute steps A1 to A4 shown in FIG. 8 and steps A131 to A142 shown in FIGS. By installing this program in a computer and executing it, the verification information generation device and the verification information generation method according to the present embodiment can be realized. In this case, the processor of the computer functions as a state transition detector 2, a state transition pair manager 3, a transition selector 4, and a test case generator 5 to perform processing.

Also, the program in this embodiment may be executed by a computer system constructed by a plurality of computers. In this case, for example, each computer may function as one of the state transition detector 2, the state transition pair manager 3, the transition selector 4, and the test case generator 5, respectively.

[Physical configuration]
Here, a computer that implements the verification information generation device by executing the program in the embodiment will be described with reference to FIG. 11 . FIG. 11 is a diagram illustrating an example of a computer that implements the verification information generation device.

As shown in FIG. 11 , computer 110 includes CPU 111 , main memory 112 , storage device 113 , input interface 114 , display controller 115 , data reader/writer 116 and communication interface 117 . These units are connected to each other via a bus 121 so as to be able to communicate with each other. The computer 110 may include a GPU (Graphics Processing Unit) or an FPGA (Field-Programmable Gate Array) in addition to the CPU 111 or instead of the CPU 111 .

The CPU 111 expands the programs (codes) of the present embodiment stored in the storage device 113 into the main memory 112 and executes them in a predetermined order to perform various calculations. The main memory 112 is typically a volatile storage device such as a DRAM (Dynamic Random Access Memory). Also, the program in the present embodiment is provided in a state stored in computer-readable recording medium 120 . It should be noted that the program in this embodiment may be distributed on the Internet connected via communication interface 117 .

Further, as a specific example of the storage device 113, in addition to a hard disk drive, a semiconductor storage device such as a flash memory can be mentioned. Input interface 114 mediates data transmission between CPU 111 and input devices 118 such as a keyboard and mouse. The display controller 115 is connected to the display device 119 and controls display on the display device 119 .

Data reader/writer 116 mediates data transmission between CPU 111 and recording medium 120 , reads programs from recording medium 120 , and writes processing results in computer 110 to recording medium 120 . Communication interface 117 mediates data transmission between CPU 111 and other computers.

Specific examples of the recording medium 120 include general-purpose semiconductor storage devices such as CF (Compact Flash (registered trademark)) and SD (Secure Digital); magnetic recording media such as flexible disks; An optical recording medium such as a ROM (Compact Disk Read Only Memory) can be mentioned.

[Appendix]
Further, the following additional remarks are disclosed with respect to the above embodiment. Some or all of the embodiments described above can be expressed by the following (Appendix 1) to (Appendix 12), but are not limited to the following description.

(Appendix 1)
a state transition detection unit that detects one or more transitions that can be executed from a target state extracted from the state elements of the state model corresponding to the system;
a state transition pair management unit that manages a plurality of state transition pair information in which states and transitions are associated;
a transition selection unit that selects a transition having the largest number of state transition pair information detected when a transition that has not yet been selected is executed from among the detected transitions;
a test case generation unit that generates a test case based on the transition selected by the transition selection unit;
A verification information generation device characterized by comprising:

(Appendix 2)
The verification information generating device according to Supplementary Note 1,
The state transition detection unit sets the next state after executing the transition selected by the transition selection unit as the new target state,
A verification information generation device characterized by:

(Appendix 3)
The verification information generation device according to appendix 1 or 2,
The state transition pair information is information in which a state of a state element different from the state element is associated with the transition,
A verification information generation device characterized by:

(Appendix 4)
The verification information generation device according to any one of Appendices 1 to 3,
The state transition pair management unit associates check information with detected state transition pair information when the transition is executed.
A verification information generation device characterized by:

(Appendix 5)
(a) detecting one or more transitions that can be executed from a state of interest extracted from state elements of a state model corresponding to the system;
(b) managing a plurality of state transition pair information in which states and transitions are associated; and (c) executing transitions not yet selected among the transitions detected in step (a) selecting the transition with the highest number of said state transition pair information detected in the case;
(d) generating test cases based on the transitions selected in step (c);
A verification information generating method, characterized by comprising:

(Appendix 6)
The verification information generation method according to appendix 5,
In the step (a), the next state after executing the transition selected in the step (c) is set as the new target state.
A verification information generation method characterized by:

(Appendix 7)
The verification information generation method according to appendix 5 or 6,
The state transition pair information is information that associates a state of a state element different from the state element with the transition,
A verification information generation method characterized by:

(Appendix 8)
The verification information generation method according to any one of Appendices 5 to 7,
In step (b), when the transition is executed, the detected state transition pair information is associated with check information;
A verification information generation method characterized by:

(Appendix 9)
(a) detecting one or more transitions that can be executed from a state of interest extracted from state elements of a state model corresponding to a system;
(b) managing a plurality of state transition pair information in which states and transitions are associated; and (c) executing transitions not yet selected among the transitions detected in step (a) selecting the transition with the highest number of said state transition pair information detected in the case;
(d) generating test cases based on the transitions selected in step (c);
A verification information generation program characterized by executing

(Appendix 10)
The verification information generation program according to appendix 9,
In the step (a), the next state after executing the transition selected in the step (c) is set as the new target state.
A verification information generation program characterized by:

(Appendix 11)
The verification information generating program according to appendix 9 or 10,
The state transition pair information is information that associates a state of a state element different from the state element with the transition,
A verification information generation program characterized by:

(Appendix 12)
The verification information generation program according to any one of Appendices 9 to 11,
In step (b), when the transition is executed, the detected state transition pair information is associated with check information;
A verification information generation program characterized by:

As described above, according to the present invention, computational resources in the system can be reduced. INDUSTRIAL APPLICABILITY The present invention is useful in the field of verifying state models.

1 verification information generation device 2 state transition detection unit 3 state transition pair management unit 4 transition selection unit 5 test case generation unit 6 input device 7 output device 8 storage unit 110 computer 111 CPU
112 Main memory 113 Storage device 114 Input interface 115 Display controller 116 Data reader/writer 117 Communication interface 118 Input device 119 Display device 120 Recording medium 121 Bus

Claims (6)

State transition detection means for detecting one or more transitions that can be executed from a target state extracted from the state elements of the state model corresponding to the system;
state transition pair management means for managing a plurality of state transition pair information in which states and transitions are associated;
transition selection means for selecting, from among the transitions detected by the state transition detection means, a transition having the largest number of state transition pair information detected when a transition that has not yet been selected is executed;
test case generation means for generating a test case based on the transition selected by the transition selection means;
A verification information generation device characterized by comprising: The verification information generation device according to claim 1,
The state transition detection means sets the next state after executing the transition selected by the transition selection means as the new target state,
A verification information generation device characterized by: The verification information generation device according to claim 1 or 2,
The verification information generation device, wherein the state transition pair information is information that associates a state of a state element different from the state element with the transition. The verification information generation device according to any one of claims 1 to 3,
The state transition pair management means associates check information with state transition pair information detected when the transition is executed.
A verification information generation device characterized by: the computer
(a) detecting one or more transitions that can be executed from a state of interest extracted from state elements of a state model corresponding to the system;
(b) managing a plurality of state transition pair information with associated states and transitions;
(c) selecting, from among the transitions detected in step (a), a transition having the largest number of state transition pair information detected when a transition that has not yet been selected is executed;
(d) generating test cases based on the transitions selected in step (c);
Verification information generation method that performs (a) detecting one or more transitions that can be executed from a state of interest extracted from state elements of a state model corresponding to a system;
(b) managing a plurality of state transition pair information with associated states and transitions;
(c) selecting, from among the transitions detected in step (a), a transition having the largest number of state transition pair information detected when a transition that has not yet been selected is executed;
(d) generating test cases based on the transitions selected in step (c);
A verification information generation program characterized by executing

Images