JP2020009271A - Verification information generator, verification information generation method, and verification information generation program - Google Patents

Abstract

To provide a verification information generator, a verification information generation method and a verification information generation program, with which calculation resources in the system are reduced.SOLUTION: Provided is a verification information generator 1, comprising: a state transition detection unit 2 for detecting one or more transitions executable from a target state extracted from the state elements of state model corresponding to a system; a state transition pair management unit 3 for managing a plurality of state transition pair information pieces in which states and transitions are associated; a transition selection unit 4 for selecting a transition the quantity of state transition pair information pieces of which that are detected when a transition not selected yet is executed is largest from among the transitions detected by the state transition detection unit 2; and a test case generation unit 5 for generating a test case on the basis of the transition selected by the transition selection unit 4.SELECTED DRAWING: Figure 3

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.

  2. Description of the Related Art In recent years, information communication technology systems (ICT (Information and Communication Technology) systems) and the like have become one of the infrastructures that support society, and their importance is increasing. On the other hand, the scale and complexity of the ICT system are increasing, and it is difficult to construct or change the ICT system. Therefore, a configuration management technique for efficiently constructing or changing an ICT system has been receiving attention.

  For example, the configuration management technology of the ICT system generally develops a model of the ICT system and builds or changes the ICT system using the developed model. As one of the configuration management techniques of an ICT system involving model development, a technique of automatically generating a procedure for constructing or changing a component (state element) of the ICT system is known.

  Patent Literature 1 and Non-Patent Literature 1 describe the current state of the system and the state after the system is built or changed using information in which the state of the system after building or change is declaratively described as a model. A technique has been disclosed for calculating the difference between the two and automatically calculating the procedure for building or changing the system.

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

  The state model is a data model representing information necessary for calculating the procedure in the procedure for changing the system, and is composed of state elements and dependencies between the state elements.

  The state element represents a part in the system configuration having an independent state, and is a minimum constituent unit considered in the calculation of the procedure. A state element is defined by a plurality of exclusive states and a state transition (transition) between the plurality of states. The status represents a possible status of the system. The state can define a plurality of states, and includes one current state (current state) and an arbitrary number of states (request states) that change from the current state upon request.

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

  Next, dependencies are defined from transitions in one state element to states in other state elements. That is, in order for the former state element to make the transition, the latter state element must be in that state.

  The state elements correspond to parts in the system configuration. The transition performed by the state element is synonymous with a single step performed by a component in the entire procedure of system construction or change.

The state model will be specifically described with reference to FIG. FIG. 1 is a diagram for explaining a state model. In FIG. 1, the state elements TC and UV (for example, components such as software) are represented by rectangles, and the 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 request state t is represented by a black ellipse. The current state f indicates, for example, a state in which software is not installed, and the request state t indicates, for example, a state in which software is installed.

  Further, the state transition is represented by a solid arrow line, and the dependency is represented by a broken arrow line. In FIG. 1, the dependency is represented by an arrow line from the state element TC to the request state t. This indicates that the state transition in the state element TC depends on the request state t. In other words, if one state element TC includes a state transition that depends on the state of another state element UV, the state element TC depends on the state element UV. Alternatively, the state element TC has a dependency on the state element UV.

  Next, a test technique related to verification of model development will be described. In model development in system configuration management, as in software development, it is necessary to verify that the development is as expected, in order to confirm the validity of the model. However, there is no de facto test technology for verification of model development at present, so model developers simply use software testing technology to perform their own tests.

  In general, test cases (verification information) are created so as to cover many combinations of these parameters in order to confirm that the software operates properly with various input contents and usage environments. However, since the number of such combinations is enormous, it is necessary to select combinations in order to reduce the number of test steps to a realistic one.

  Then, there is a pairwise method as one of the software test technologies that can be applied to model development. The pairwise method is a technique that can reduce the number of combinations used in a test case without significantly impairing the quality of a test (for example, the accuracy with which a bug can be found). Specifically, instead of creating a test case that covers all combinations of values between all parameters, when focusing on any two parameters, the combination of all values between those two parameters Create test cases to be created.

  An example of creating a test case for a website will be described. FIG. 2 is a diagram for explaining the pairwise method. Specifically, FIG. 2 shows a test case combining an operating system, a browser, and a search engine used when a user accesses a website. That is, a test case is shown assuming OS_W or OS_L in the operating system, BR_C or BR_F in the browser, and SE_G or SE_Y in the search engine as candidates for parameters used by the user.

  In this case, there are two types of values that can be taken by each parameter. Therefore, when a test case that covers all combinations of values among all parameters is created, eight (2 3) test cases are created. Is done.

  However, in the pairwise method, only four test cases are created as shown in FIG. The reason is that even if attention is paid to any two parameters (columns) in FIG. 2, four types (square of 2) in which all values are combined between those parameters are covered. As described above, when focusing on any two parameters, the pair-wise method creates a test case in which all combinations of values are covered between the two parameters.

The pairwise method is based on an empirical rule that a software defect is often caused by a problem of a combination between a small number of elements (for example, two or three elements). Therefore, in the pair-wise method, the number of test cases can be reduced without significantly deteriorating the test quality described above.

  Furthermore, the general pairwise method is a test technique using an input and an environment as parameters, and is not suitable for testing a state model. On the other hand, in the pairwise method for the state transition system, since the basic concept of the state model is the same as that of the state transition system, it is considered that the state model test has affinity.

  As a related technology, Non-Patent Document 2 discloses a technology in which all paths satisfying a specific condition are enumerated using a state as a parameter and a transition as a value, and all the enumerated paths are used as test cases. .

  Non-Patent Document 3 lists an event sequence passing through a state transition system path that models a test target, classifies values of parameters of events included in each event sequence into classes, and, for each event sequence, There is disclosed a technique for generating a test case using a pairwise method using an event as a parameter and a class as a value.

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 Testing Tool-Modeling Constraints in Combination in Tabular Format-", 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 disclosed in Non-Patent Documents 2 and 3 related to the above-described verification of model development, for example, although the number of states that the ICT system can take is enormous, After preparing everything, it is necessary to perform test processing. In addition, since the actual system is very large, enormous computational resources are required to process it in a realistic time.

  For example, a storage unit having a size capable of storing all possible states of the ICT system is required, but it is usually difficult to satisfy such conditions. Even if such a condition can be satisfied, the processing speed of the processing related to the construction or the change is significantly reduced.

  Also, in the test techniques disclosed in Non-Patent Literatures 2 and 3 related to the verification of model development described above, when the state of the system as a whole is different, parts are treated as different parameters in the pairwise method. Therefore, even if the state of most of the components constituting the ICT system is the same, if even some of the components have different states, verification is performed to cover all combinations of parameter values (operations for the ICT system) among the parameters.

  Considering that the failure of the ICT system in the pairwise method often occurs due to a combination of operations and a state between a small number of parts, the above-described verification in the test technique has too small a granularity, and thus the test case is too small. Becomes huge. 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 computation 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 the target state, extracted from the state element 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 a state and a transition are associated,
Among the transitions detected by the state transition detection unit, a transition selection unit that selects the transition with the largest number of the state transition pair information detected when executing a transition that has not been selected,
A test case generation unit that generates a test case based on the transition selected by the transition selection unit,
It is characterized by having.

In order to achieve the above object, a verification information generating method according to one aspect of the present invention includes:
(A) detecting one or more transitions executable from a target state, 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 with each other; and (c) executing a transition that has not been selected among the transitions detected in the step (a). Selecting the transition with the largest number of state transition pair information detected in the case,
(D) generating a test case based on the transition selected in the step (c);
It is characterized by having.

Further, in order to achieve the above object, a verification information generation program according to one aspect of the present invention includes:
Detecting (a) one or more transitions executable 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 with each other; and (c) executing a transition that has not been selected among the transitions detected in the step (a). Selecting the transition with the largest number of state transition pair information detected in the case,
(D) generating a test case based on the transition selected in the step (c);
Is executed.

  As described above, according to the present invention, it is possible to reduce computation resources in a system.

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 the verification information generation device. FIG. 4 is a diagram illustrating a system having a verification information generation device. FIG. 5 is a diagram illustrating an example of the state model. FIG. 6 is a diagram illustrating an example of the state model. FIG. 7 is a diagram illustrating an example of a test case (transition sequence). FIG. 8 is a diagram illustrating an example of an operation of the verification information generation device. FIG. 9 is a diagram showing an example of the pseudo code in step A3. FIG. 10 is a diagram illustrating 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)
Hereinafter, embodiments of the present invention will be described with reference to FIGS.

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

  As shown in FIG. 3, the verification information generation device 1 is a device for reducing computation resources in a system (for example, an ICT system). The verification information generation device 1 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.

  Among them, 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. The transition selection unit 4 selects, from among the transitions detected by the state transition detection unit 2, a transition having the largest number of state transition pair information detected when a transition that has not been selected is executed. The test case generator 5 generates a test case based on the transition selected by the transition selector 4.

  As described above, in the present embodiment, test cases in a necessary range are generated using state transition pair information generated in advance in accordance with the idea of the pair-wise method. Therefore, unlike the related art, it is not necessary to prepare a huge number of states that can be taken by the system beforehand and then perform the processing related to the construction or change of the system, so that the computational resources required for the processing can be reduced. Further, since the computational resources can be reduced, a larger-scale system can be verified. Further, since the number of test cases can be reduced, the number of steps for verification can also be reduced.

  Subsequently, the configuration of the verification information generation device 1 in the present embodiment will be described more specifically with reference to FIG. FIG. 4 is a diagram illustrating 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 a transition 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 detects the current state CS1 of the entire system using the acquired state model. Subsequently, the state transition detection unit 2 stores the detected state CS1 as a detected state in the state collection unit ES1 that stores the detected state. 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 detection unit 2 acquires all executable transitions from the state CS1.

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

  The state transition pair management unit 3 manages a state transition pair storage unit MI1 provided in advance in the storage unit inside the state transition pair management unit 3 or the storage unit 8 described above. The state transition pair storage unit MI1 has a plurality of pieces of state transition pair information in which the state of a state element different from the subject of the transition and the transition of the state element that is the subject of the transition are associated with each other when the state element transits the state. .

  Specifically, when the state transition detecting unit 2 causes the state CS1 to transition, the state transition pair management unit 3 refers to the state transition pair storage unit MI1 before transitioning each state element different from the subject of the transition. And 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 detecting the state transition pair information, the state transition pair management unit 3 associates (checks) the check information indicating the 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 are diagrams illustrating an example of the state model. The system shown in FIG. 5 has state elements (parts) A and B. Each of the components A and B has a state f and a state t. The states f and t of the parts A and B transition from the state f to the state t (f → t). Further, the state transits from the state t to the state f (t → f).

  5 and 6, state elements A, B, and C (for example, components such as software) 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 required state t is represented by a black ellipse. For example, the current state f indicates, for example, a state in which software is not installed, and the request state t indicates, for example, a state in which software is installed. The state transition is indicated by a solid arrow line, and the dependency is indicated by a broken arrow line.

  For example, it is assumed that when the initial state of each of the parts A and B is the state f, the part A transitions from the state f to the state t (A: f → t). In this case, the state transition pair management unit 3 stores the state f of the part B and the transition of the part A (A: f → t) in the state transition pair storage unit MI1 as state transition pair information.

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

  As described above, all combinations of the state transition pair information are stored in the state transition pair storage unit MI1 in advance. However, the state transition pair management unit 3 does not store the state transition pair information that does not hold due to the dependency in the state transition pair storage unit MI1. In FIG. 5, combinations of state transition pair information stored in the state transition pair storage unit 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)

  Since the state transition pair information (A: t, B: t → f) has a dependency relationship as shown in FIG. 5, when the part A is in the state t, the part B executes the transition t → f. Because you can't.

  Further, even if the number of components constituting 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. When the initial state of each of the parts A, B, and C is the state f, it is assumed that the part A has transitioned from the state f to the state t (A: f → t). In this case, the state f of the component B and the transition (A: f → t) of the component A are associated and stored as state transition pair information in the state transition pair storage unit MI1.

  When the initial state of each of the components A, B, and C of the system in FIG. 6 is the state f, when the part A transitions from the initial state f to the state t (f → t is executed), it is checked. The state transition pair information is (B: f, A: f → t) and (C: f, A: f → t).

  The state detected by the state transition detection unit 2 and the state stored by the state collection unit ES1 and the state stored as the state transition pair information are not the same granularity. That is, the state detected by the state transition detection unit 2 and the state stored by the state collection unit ES1 are the states of the entire system. In the example of FIG. 6, the information is information indicating that the component A is in the state t, the component B is in the state f, and the component C is in the state f. On the other hand, the 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 states of one state element and combinations of transitions of the other state element are generated. However, state transition pair information that cannot be realized due to the dependency is excluded.

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

  This lists 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, exceptions that cannot be realized due to the dependency (A: t, B: t → f) are excluded. This is created for all pairs of arbitrary parts. For example, the pair of parts in the system of FIG. 5 is only A and B, but the pair of parts in the system of FIG. 6 are A and B, A and C, and B and C.

  It should be noted that the pairwise method does not test for all combinations of parameters but tests for 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 the transitions not yet selected among the transitions extracted by the state transition detection unit 2. More specifically, the transition selection unit 4 executes a checked state managed by the state transition pair management unit 3 by executing the candidate among the candidates to which each component (state element) can transition from the current target state CS1. Select the transition with the most transition pairs.

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

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

  The input device 6 is a device that is connected to the verification information generation device 1 and outputs a 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 a test case 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 described with reference to FIG. FIG. 8 is a diagram illustrating an example of an operation of the verification information generation device. In the following description, FIGS. 3 to 7 are appropriately referred to. In the present embodiment, the verification information generation method is performed by operating the verification information generation device 1. Therefore, the description of the verification information generation method according to the present embodiment is replaced with the following description of the operation of the verification information generation device.

  First, the verification information generation device 1 acquires a state model M1 of the system to be verified (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).

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

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

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

  The test case generation unit 5 determines whether the current search target state CS1 is stored in the state collection unit ES1 or all 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 that stores the transition at that time is stored in the storage unit 8 or the like as a test case (step A132).

  After that, the state transition detection unit 2 ends the current recursive processing in step A3.

  Step A3 represents the processing of one stage of recursion in the above-described recursive depth-first search in the entire step. In step A141 described later, the process proceeds to the recursion of the next stage. In addition, the step A132 does not end the entire recursive process, but ends one recursive stage (one step A3). Therefore, the next processing is step A141 of the recursion of the immediately preceding stage. In step A141, if it is the first stage recursion, the entire recursion process ends.

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

More specifically, when the target state CS1 first visits the initial state, the state CS1 to be currently searched is not included in the state collection unit ES1, and all the state transition pair information has not been checked. The unit 2 executes the process of Step A133. On the other hand, when the current search target state CS1 returns to the initial state (visits the second and subsequent times), since the initial state is always searched first, it is included in the state set ES1 and the recursion is terminated one step.

  The state transition detection unit 2 stores the detected state in the storage unit 8 when searching for the current search target state CS1. For example, the target state CS1 is added to the state collection unit ES1.

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

  Subsequently, when there is a non-selected transition, the state transition detection unit 2 determines whether there is state transition pair information to be newly checked in the remaining transitions (step A136).

  When there is state transition pair information to be newly checked in the remaining transitions (step A136: Yes), the state transition detection unit 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), the state transition detection unit 2 executes the processing of step A142.

  In step A137, the transition selection unit 4 executes the transition extracted by the state transition detection unit 2 in step A134 from a transition that has not been selected, so that the number of state transition pair information to be checked is the largest. Select transition T1. Specifically, the transition selection unit 4 executes, among the candidates whose components can transition from the current target state CS1, the checked state transition pair managed by the state transition pair management unit 3 by executing the component. Select more transitions.

  Subsequently, the state transition detection unit 2, for example, pushes the selected transition T1 to the transition stack TS1 (Step A138). Subsequently, the state transition detection unit 2 detects the state NS1 obtained by the 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 of the state of the component and the transition T1 (step A139). Specifically, the state transition pair management unit 3 enumerates the state of each component different from the component that is the subject of the transition of the transition T1, and any one of the states and the state transition pair information that matches the transition T1. Are all detected. Then, the state transition pair management unit 3 associates the check information indicating the detection with the state transition pair information.

  Subsequently, the state transition detection unit 2 performs a depth-first search recursively with the state NS1 obtained by the transition T1 of the current search target state CS1 as a search target (step A140). However, when the recursive depth-first search is completed (when the recursive processing returns to this point), the state transition detection unit 2 pops the transition T1 from the transition stack TS1 (step A141).

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

  Then, the state transition detection unit 2 repeatedly executes the processing of steps A135 to A141 until there are no more transitions not selected in step A137 (step A135: Yes). Further, when selecting a transition in step A137, if there is only a transition having no state transition pair information to be newly checked, the process exits from the repetition of steps A135 to A141 (step A136: No).

  Further, when the process exits the repetition processing in step A135 or step A136 and no transition is selected in step A137, the test case generation unit 5 stores the contents of the transition stack TS1 at that time as a test case. It is stored in the unit 8 or the like. That is, when 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 time 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 process for one recursive stage).

[Effects of the present embodiment]
As described above, according to the present embodiment, a required range of test cases is generated using state transition pair information generated in advance, based on the idea of the pair-wise method. Therefore, unlike the related art, it is not necessary to prepare a huge number of states that can be taken by the system beforehand and then perform the processing related to the construction or change of the system, thereby reducing the computational resources required for the processing. Further, since the computational resources can be reduced, a larger-scale system can be verified. Further, since the number of test cases can be reduced, the number of steps for verification can also be reduced.

  For example, when searching for a state transition system of an ICT system composed of a plurality of components, the state transition detection unit 2 performs a search while determining the next transition to be executed according to the output of the transition selection unit 4. In addition, when the state transition detecting unit 2 executes the transition of the state transition system, the state transition pair management unit 3 determines, for each ICT system component different from the subject of the transition, the state of the ICT system component before the transition is executed and the execution state. Check the pair with the transition to be performed (state transition pair). In addition, the transition selection unit 4 manages the state transition pair management unit 3 by executing the transition candidates among the transition candidates when the state transition detection unit 2 determines the transition to be executed from the current state of the state transition system under search. The transition that has the largest number of checked state transition pairs is selected. Then, the test case generation unit 5 generates a test case covering the range in which the state transition detection unit 2 has searched for the state transition system.

  By doing so, there is no need to prepare a huge number of states that can be taken by the ICT system in advance and then perform the processing related to the construction or change of the ICT system, so that the computational resources required for the processing can be reduced. . Further, since the computational resources can be reduced, a larger-scale system can be verified. Further, since the number of test cases can be reduced, the number of steps 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 and executing this program on a computer, 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 the state transition detection unit 2, the state transition pair management unit 3, the transition selection unit 4, and the test case generation unit 5, and performs processing.

  Further, the program according to the present 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 detection unit 2, the state transition pair management unit 3, the transition selection unit 4, and the test case generation unit 5, respectively.

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

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

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

  Specific examples of the storage device 113 include a semiconductor storage device such as a flash memory in addition to a hard disk drive. The input interface 114 mediates data transmission between the CPU 111 and an input device 118 such as a keyboard and a mouse. The display controller 115 is connected to the display device 119 and controls display on the display device 119.

  The data reader / writer 116 mediates data transmission between the CPU 111 and the recording medium 120, reads a program from the recording medium 120, and writes a processing result in the computer 110 to the recording medium 120. The communication interface 117 mediates data transmission between the CPU 111 and another computer.

  Further, specific examples of the recording medium 120 include a general-purpose semiconductor storage device such as CF (Compact Flash (registered trademark)) and SD (Secure Digital), a magnetic recording medium such as a flexible disk (Flexible Disk), or a CD-ROM. An optical recording medium such as a ROM (Compact Disk Read Only Memory) can be used.

[Appendix]
Regarding the above embodiment, the following supplementary notes are further disclosed. Some or all of the above-described embodiments 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 the target state, extracted from the state element 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 a state and a transition are associated,
Among the detected transitions, a transition selection unit that selects a transition having the largest number of the state transition pair information detected when executing a transition that has not been selected,
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, comprising:

(Appendix 2)
The verification information generation device according to Supplementary Note 1, wherein
The state transition detection unit sets the next state in which the transition selected by the transition selection unit has been executed as the new target state,
A verification information generation device, characterized in that:

(Appendix 3)
The verification information generating device according to claim 1 or 2, wherein
The state transition pair information is information associated with the state of the state element different from the state element and the transition,
A verification information generation device, characterized in that:

(Appendix 4)
The verification information generation device according to any one of supplementary notes 1 to 3, wherein
The state transition pair management unit, when executing the transition, associates check information with the detected state transition pair information,
A verification information generation device, characterized in that:

(Appendix 5)
(A) detecting one or more transitions executable from a target state, 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 with each other; and (c) executing a transition that has not been selected among the transitions detected in the step (a). Selecting the transition with the largest number of state transition pair information detected in the case,
(D) generating a test case based on the transition selected in the step (c);
A verification information generation method, comprising:

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

(Appendix 7)
The verification information generation method according to attachment 5 or 6, wherein
The state transition pair information is information relating the state of the state element different from the state element and the transition.
A method for generating verification information, characterized in that:

(Appendix 8)
The verification information generation method according to any one of appendices 5 to 7, wherein
In the step (b), when the transition is performed, check information is associated with the detected state transition pair information;
A method for generating verification information, characterized in that:

(Appendix 9)
Detecting (a) one or more transitions executable 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 with each other; and (c) executing a transition that has not been selected among the transitions detected in the step (a). Selecting the transition with the largest number of state transition pair information detected in the case,
(D) generating a test case based on the transition selected in the step (c);
And a verification information generation program.

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

(Appendix 11)
The verification information generation program according to attachment 9 or 10, wherein
The state transition pair information is information relating the state of the state element different from the state element and the transition.
A verification information generating program characterized in that:

(Appendix 12)
The verification information generation program according to any one of supplementary notes 9 to 11, wherein
In the step (b), when the transition is performed, check information is associated with the detected state transition pair information;
A verification information generating program characterized in that:

  As described above, according to the present invention, it is possible to reduce computation resources in a system. The present invention is useful in the field of verifying a state model.

REFERENCE SIGNS LIST 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)

A state transition detecting unit that detects one or more transitions that can be executed from the target state, extracted from the state element 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 a state and a transition are associated with each other,
Among the transitions detected by the state transition detection unit, a transition selection unit that selects the transition with the largest number of the state transition pair information detected when a transition that has not been selected is executed,
A test case generating unit that generates a test case based on the transition selected by the transition selecting unit,
A verification information generation device, comprising: The verification information generation device according to claim 1, wherein
The state transition detection unit sets the next state after executing the transition selected by the transition selection unit as a new target state.
A verification information generation device, characterized in that: The verification information generating device according to claim 1 or 2,
The verification information generation device, wherein 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. The verification information generation device according to claim 1, wherein:
The state transition pair management means, when executing the transition, associates check information with the detected state transition pair information,
A verification information generation device, characterized in that: (A) detecting one or more transitions executable from a target state, 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 with each other; and (c) executing a transition that has not been selected among the transitions detected in the step (a). Selecting the transition with the largest number of state transition pair information detected in the case,
(D) generating a test case based on the transition selected in the step (c);
A verification information generation method, comprising: Detecting (a) one or more transitions executable 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 with each other; and (c) executing a transition that has not been selected among the transitions detected in the step (a). Selecting the transition with the largest number of state transition pair information detected in the case,
(D) generating a test case based on the transition selected in the step (c);
And a verification information generation program.

Images