WO2014125836A1 - Dispositif de génération de données de test - Google Patents

Dispositif de génération de données de test Download PDF

Info

Publication number
WO2014125836A1
WO2014125836A1 PCT/JP2014/000777 JP2014000777W WO2014125836A1 WO 2014125836 A1 WO2014125836 A1 WO 2014125836A1 JP 2014000777 W JP2014000777 W JP 2014000777W WO 2014125836 A1 WO2014125836 A1 WO 2014125836A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
target
child node
relationship
condition
Prior art date
Application number
PCT/JP2014/000777
Other languages
English (en)
Japanese (ja)
Inventor
崇師 北村
ティ ビッチ ゴック ドウ
大崎　人士
Original Assignee
独立行政法人産業技術総合研究所
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 独立行政法人産業技術総合研究所 filed Critical 独立行政法人産業技術総合研究所
Publication of WO2014125836A1 publication Critical patent/WO2014125836A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/36—Preventing errors by testing or debugging software
    • G06F11/3668—Software testing
    • G06F11/3672—Test management

Definitions

  • This invention relates to an apparatus for generating test data for testing whether a program or the like operates normally.
  • test data In order to test the operation of software, a combination of data that may be input is created, and the test data is input to determine whether or not a desired operation is achieved.
  • test data is created by generating a combination of data that may be input by an all-pair method (pair-wise method) or the like.
  • an all-pair method pair-wise method
  • Microsoft's PICT trademark
  • test data based on combinations of values can be generated.
  • a, b... M are parameters, and a1, a2... An are the values of the parameter a.
  • the parameter a takes one of the values a1, a2,..., An by a: a1, a2,. The same applies to the second and subsequent lines.
  • test data is generated and output.
  • Fig. 12 shows the logical structure of a certain event in a tree format. In this tree structure, input to a tool such as PICT is not possible.
  • an object of the present invention is to make it possible to use a test data generation tool without expressing parameters with a predetermined logical structure.
  • a test data generation device includes a node arranged in a plurality of layers having an upper node indicating a target feature and a lower node indicating a lower-order feature of the upper-node feature.
  • the upper node and the lower node are combined in an AND relationship in which all of the lower nodes must be established with respect to the upper node, or an OR relationship in which one of the lower nodes is established with respect to the upper node.
  • Feature data that defines at least one of a requirement condition that determines whether the establishment or non-establishment of one node in between determines the establishment or non-establishment of the other node, and an exclusive condition that determines the simultaneous establishment or non-establishment of both nodes between nodes At least one of the following: (a) and-and-level flattening means; (b) or-or-layer flattening means; and (c) lifting flattening means.
  • Test data generation comprising: flattening means for flattening a hierarchical structure of input feature data; and test data generating means for generating test data based on the combination of features based on the flattened feature data
  • the AND-and-level flattening means (a1) in the feature data the target node defines an AND relationship, the child node of the target node is set as a target child node, and the target child node has an AND relationship.
  • And-and-relation extraction means for finding a defined part; and (a2) if a required condition or an exclusion condition is attached to the target child node at the position found by the AND-and-relation extraction means, the request A request / exclusive condition allocating means for replacing a condition or an exclusive condition with the target node; and (a3) deleting the target child node at a location found by the AND-and-relation extracting means; A target child node deleting means for adding a target grandchild node as a child node to the AND relationship as a child node of the target node; (b) The or-or hierarchy flattening means (b1) in the feature data, the target node defines an OR relationship, a child node of the target node is a target child node, and the target child node has an OR relationship.
  • OR or OR relationship extraction means for finding a defined location, and (b2) if an exclusion condition is attached to the target child node in the location found by the OR or OR relationship extraction means, the exclusion condition is An exclusive condition allocating means for allocating to a target grandchild node that is a child node of the target child node, and (b3) a requirement condition is attached to the target child node at a location found by the or-or relationship extracting means.
  • the requirement condition allocating means for allocating the requirement condition to the target node, and (b4) the target child node at the location found by the OR-OR relationship extracting means.
  • an exclusion condition that sets an exclusion condition between a child node other than the target child node in the target node and the request source node of the request condition
  • the target child node is deleted at a location found by the OR-OR relationship extracting unit, and the target grandchild node that is a child node of the target child node is changed to a child node of the target node.
  • a target child node deletion means to be added to the OR relationship as (c)
  • the structure of the feature data given to the test data generating means can be flattened, and the processing in the test data generating means becomes easy.
  • a feature data processing apparatus includes nodes arranged in a plurality of hierarchies having a higher-level node indicating a target feature and a lower-level node indicating a lower-level feature of the higher-level node feature.
  • the upper node and the lower node are combined in an AND relationship in which all of the lower nodes must be established with respect to the upper node, or an OR relationship in which one of the lower nodes is established with respect to the upper node.
  • Feature data that defines at least one of a requirement condition that determines whether the establishment or non-establishment of one node in between determines the establishment or non-establishment of the other node, and an exclusive condition that determines the simultaneous establishment or non-establishment of both nodes
  • At least one of the following input means (a) and-and-level flattening means, (b) or-or-level flattening means, and (c) lifting flattening means
  • a characteristic data processing device and a flattening means for flattening the hierarchical structure of the input feature data (a) The AND-and-level flattening means (a1) in the feature data, the target node defines an AND relationship, the child node of the target node is set as a target child node, and the target child node has an AND relationship.
  • And-and-relation extraction means for finding a defined part; and (a2) if a required condition or an exclusion condition is attached to the target child node at the position found by the AND-and-relation extraction means, the request A request / exclusive condition allocating means for replacing a condition or an exclusive condition with the target node; and (a3) deleting the target child node at a location found by the AND-and-relation extracting means; A target child node deleting means for adding a target grandchild node as a child node to the AND relationship as a child node of the target node; (b) The or-or hierarchy flattening means (b1) in the feature data, the target node defines an OR relationship, a child node of the target node is a target child node, and the target child node has an OR relationship.
  • OR-OR relationship extraction means to find out the defined place, (b2) If an exclusion condition is attached to the target child node at a location found by the or-or relationship extraction means, an exclusion condition distribution means for replacing the exclusion condition with the target node; and (b3 ) If the request condition is attached to the target child node at the location found by the or-or-relation extracting means, the request condition is replaced with the target grandchild node that is a child node of the target child node.
  • the structure of the feature data given to the test data generating means can be flattened, and the processing in the test data generating means becomes easy.
  • a test data generation server device comprises a node arranged in a plurality of hierarchies having an upper node indicating a target feature and a lower node indicating a lower feature of the upper node feature.
  • the upper node and the lower node are combined in an AND relationship in which all of the lower nodes must be established with respect to the upper node, or an OR relationship in which one of the lower nodes is established with respect to the upper node.
  • Feature data in which at least one of a requirement condition that determines the establishment / non-establishment of one node and the exclusive condition that determines the simultaneous establishment / non-establishment of both nodes between nodes is defined as a terminal Receiving means for receiving from the apparatus; (a) and-and-level flattening means; (b) or-or-level flattening means; and (c) lifting flattening means.
  • And-and-relation extraction means for finding a defined part; and (a2) if a required condition or an exclusion condition is attached to the target child node at the position found by the AND-and-relation extraction means, the request A request / exclusive condition allocating means for replacing a condition or an exclusive condition with the target node; and (a3) deleting the target child node at a location found by the AND-and-relation extracting means; A target child node deleting means for adding a target grandchild node as a child node to the AND relationship as a child node of the target node; (b) The or-or hierarchy flattening means (b1) in the feature data, the target node defines an OR relationship, a child node of the target node is a target child node, and the target child node has an OR relationship.
  • OR or OR relationship extraction means for finding a defined location, and (b2) if an exclusion condition is attached to the target child node in the location found by the OR or OR relationship extraction means, the exclusion condition is An exclusive condition allocating means for allocating to the target node; and (b3) if a required condition is attached to the target child node at a location found by the or-or relationship extracting means, the required condition is set to the target (B4) In the location found by the or-or relationship extracting means, the target child node is assigned to the target child node at a location found by the target grandchild node that is a child node of the child node.
  • an exclusion condition that sets an exclusion condition between a child node other than the target child node in the target node and the request source node of the request condition
  • the target child node is deleted at a location found by the OR-OR relationship extracting unit, and the target grandchild node that is a child node of the target child node is changed to a child node of the target node.
  • a target child node deletion means to be added to the OR relationship as (c)
  • the structure of the feature data given to the test data generating means can be flattened, and the processing in the test data generating means becomes easy.
  • a feature data processing server device includes a node arranged in a plurality of hierarchies having an upper node indicating a target feature and a lower node indicating a lower feature of the upper node feature.
  • the upper node and the lower node are combined in an AND relationship in which all of the lower nodes must be established with respect to the upper node, or an OR relationship in which one of the lower nodes is established with respect to the upper node.
  • Feature data in which at least one of a requirement condition that determines the establishment / non-establishment of one node and the exclusive condition that determines the simultaneous establishment / non-establishment of both nodes between nodes is defined as a terminal
  • a feature data processing server device comprising at least one, flattening means for flattening a hierarchical structure of input feature data, and transmitting means for transmitting the flattened feature data to a terminal device.
  • And-and-relation extraction means for finding a defined part; and (a2) if a required condition or an exclusion condition is attached to the target child node at the position found by the AND-and-relation extraction means, the request
  • a request / exclusive condition allocating means for replacing a condition or an exclusive condition with the target node; and (a3) deleting the target child node at a location found by the AND-and-relation extracting means;
  • OR or OR relationship extraction means for finding a defined location, and (b2) if an exclusion condition is attached to the target child node in the location found by the OR or OR relationship extraction means, the exclusion condition is An exclusive condition allocating means for allocating to the target node; and (b3) if a required condition is attached to the target child node at a location found by the or-or relationship extracting means, the required condition is set to the target (B4) In the location found by the or-or relationship extracting means, the target child node is assigned to the target child node at a location found by the target grandchild node that is a child node of the child node.
  • an exclusion condition that sets an exclusion condition between a child node other than the target child node in the target node and the request source node of the request condition
  • the target child node is deleted at a location found by the OR-OR relationship extracting unit, and the target grandchild node that is a child node of the target child node is changed to a child node of the target node.
  • a target child node deletion means to be added to the OR relationship as (c)
  • the structure of the feature data given to the test data generating means can be flattened, and the processing in the test data generating means becomes easy.
  • the flattening means includes (a) the AND-and-hierarchy flattening means, (b) the or-or-hierarchy flattening means, and (c) the lifting A flattening means, wherein the lift flattening means processes the feature data processed by the and-and-hierarchical flattening means and the or-or-hierarchical flattening means. Yes.
  • the request condition is that the request destination node is also satisfied.
  • the exclusion condition is characterized in that when one node is established, the other node is not established.
  • test data generating apparatus (10) is characterized in that the AND relationship indicates that all nodes must be established.
  • test data generating device (11)
  • the test data generating device is characterized in that the OR relationship indicates that only one of the nodes is established.
  • a feature data processing method is a method of processing feature data by a computer, wherein the computer includes a higher-order node indicating a target feature and a lower-order feature indicating a lower-order feature of the higher-order node.
  • An AND relationship in which all the lower nodes must be established with respect to the upper node, and any one of the lower nodes with respect to the upper node may be established.
  • the upper node and lower node are connected in a relationship, and the establishment condition of one node between nodes establishes the requirement for determining the establishment / non-establishment of the other node, and the simultaneous establishment / non-establishment of both nodes between nodes
  • Input feature data that defines at least one of the exclusion conditions
  • the computer executes at least one of the following (a) and-and-level flattening processing, (b) or-or-level flattening processing, and (c) lifting flattening processing, and is input
  • a feature data processing method for flattening a hierarchical structure of feature data (a)
  • the AND-and-hierarchy flattening process is as follows: (a1) In the feature data, the target node defines an AND relationship, the child node of the target node is a target child node, and the target child node (A2) If a request condition or an exclusion condition is attached to the target child node, the request condition or the exclusion condition is replaced with the target node
  • a target grandchild node that is a child node of the target child node is added to the AND relationship as a child node of the target node, (b)
  • the or-or-layer flattening process is as follows: (b1) In the feature data, the target node defines an OR relationship, the child node of the target node is set as the target child node, and the target child node has an OR relationship. (B2) If an exclusive condition is attached to the target child node, the exclusive condition is replaced with the target node, and (b3) a required condition is attached to the target child node. For example, the request condition is replaced with a target grandchild node that is a child node of the target child node.
  • the structure of the feature data given to the test data generation process can be flattened, and the process in test data generation becomes easy.
  • step S3 “Or or hierarchical leveling means” corresponds to step S3.
  • the lifting flattening means corresponds to step S4.
  • Test data generation means corresponds to step S5.
  • Program is a concept that includes not only a program that can be directly executed by the CPU but also a source-format program, a compressed program, an encrypted program, and the like.
  • FIG. 1 is a functional block diagram of a test data generation device according to an embodiment of the present invention.
  • FIG. It is a hardware configuration of a test data generation device.
  • 4 is a flowchart of a test data generation program 44. It is a flowchart of flattening processing of an AND-AND hierarchy. It is a flowchart of flattening processing of an AND-AND hierarchy. It is a flowchart of the flattening process of a XOR-XOR hierarchy. It is a flowchart of the flattening process of a XOR-XOR hierarchy. It is a flowchart of the flattening process of a XOR-XOR hierarchy. It is a flowchart of the flattening process by lifting.
  • the input parameter data is illustrated. It is a figure which shows replacement of the requirement conditions in an AND-AND hierarchy. It is a figure which shows the parameter data planarized by the AND-AND hierarchy planarization process. It is a figure which shows replacement of the requirement conditions in a XOR-XOR hierarchy. It is a figure which shows replacement of the requirement condition in an XOR-XOR hierarchy, and the improper exclusion condition. It is a figure which shows the parameter data planarized by the XOR-XOR hierarchy planarization process. It is a figure which shows the parameter data planarized by the lifting planarization process.
  • FIG. 2 is a diagram showing a structure of standard parameter data in a conventional test data generation apparatus.
  • FIG. 12 shows the logical structure of a certain event in a tree format. In this tree structure, input to a tool such as PICT is not possible.
  • FIG. 21 the data defined for PICT shown in FIG. 21 is shown in a tree structure as shown in FIG.
  • Parameters a1, a2,... An are connected to a group by exclusive OR (XOR).
  • XOR exclusive OR
  • the parameters b1, b2,... Bn are coupled to the group of b by exclusive OR (XOR).
  • the parameters m1, m2,... Mn are connected to the group of m by exclusive OR (XOR).
  • A, b, c ... m are connected to group r by AND. That is, a, b, c... M are all in a “established” relationship.
  • the req line from parameter m1 to parameter an indicates that when parameter m1 is established, parameter an is also established.
  • a mutex line between the parameter a2 and the parameter b2 indicates that the parameter a2 and the parameter b2 are not simultaneously established.
  • a tool such as PICT can be used.
  • the input means 2 inputs parameter data 20 expressed in a logical structure.
  • the AND-and-layer flattening means 4 finds a portion in the logical structure of the input parameter data 20 where the AND relationship and the AND relationship are continuous as a layer from the target node.
  • the target node is AT, and a portion where the AND relationship and the AND relationship are continuous as a hierarchy is indicated by 30.
  • the AND-and-level flattening means 4 further sets the request condition or the exclusion condition. To the target node AT. In the example of FIG. 1, no request condition or exclusion condition is attached to the target child node Ta, so nothing is performed here. Subsequently, the AND and hierarchy leveling means 4 deletes the target child node Ta.
  • the AND-and-layer flattening means 4 executes the above-described processing for all the portions where the found AND relationship and the AND relationship are continuous as a layer. As a result, AND-and-level flattening parameter data 22 is obtained.
  • the or-or hierarchy flattening means 6 finds a portion in the logical structure of the AND-and-layer flattening parameter data 22 where the OR relationship and the OR relationship are continuous as a hierarchy from the target node.
  • the target node is El
  • a portion where the OR relationship and the OR relationship are continuous as a hierarchy is indicated by 32.
  • the OR-or-layer flattening means 6 replaces it with the target grandchild nodes ISR1, ISR2 (child nodes of the target child node).
  • the exclusion condition set between the target child node ISR and the node WA is replaced between each of the target grandchild nodes ISR1 and ISR2 and the node WA.
  • the required condition is attached to the target child node ISR, the required condition is replaced with the target node El.
  • the or-or hierarchy flattening means 6 deletes the target child node ISR.
  • the or-or hierarchy flattening means 6 performs the above-described processing for all the portions where the found OR relationship and the OR relationship are continuous as a hierarchy. As a result, OR-or-layer flattening parameter data 24 is obtained.
  • the lifting flattening means 8 finds a portion 34 in which the AND relationship and the OR relationship are continuous as a lower hierarchy from the target node Ta, and the OR relationship and the AND relationship are continued from the target node as an upper hierarchy.
  • the lifting flattening means 8 sets a request condition for the target node Ta from the target grandchild nodes Y and N. Further, a target grandchild node YN “None of the target grandchild nodes Y and N” is added, and an exclusion condition is set between the target node Ta and the target grandchild node YN.
  • the lifting flattening means 8 further moves to add the target child node Pre as a child node of the target parent-parent node AT (parent node El of the target node Ta) to the AND relationship. At this time, the structure below the target child node Pre is also moved. Thereby, the lifting flattening parameter data 26 shown in FIG. 1 is obtained.
  • the lifting flattening parameter data 26 is a parameter having a logical structure defined by a hierarchy of an AND relationship and an XOR relationship. Therefore, the test data can be obtained by giving this to the test data generating means 10 realized by PICT or the like.
  • FIG. 2 shows a hardware configuration of the test data generation apparatus.
  • a memory 32, a display 34, a hard disk 36, a DVD-ROM drive 38, and a keyboard / mouse 46 are connected to the CPU 30.
  • the hard disk 36 stores an operating system 42 such as WINDOWS (trademark) and a test data generation program 44.
  • the test data generation program 44 performs its function in cooperation with the operating system 42.
  • the operating system 42 and the test data generation program 44 are those recorded on the DVD-ROM 40 and installed on the hard disk 36 via the DVD-ROM drive 38.
  • FIG. 3 shows a flowchart of the test data generation program 44.
  • the CPU 30 inputs parameter data and records it on the hard disk 36 (step S1).
  • the parameter data may be input from the keyboard / mouse 46 or the DVD-ROM drive 38.
  • parameter data as shown in FIG. 11 is input.
  • the parameter data is input in a format as shown in FIG.
  • a tree structure as shown in FIG. 12 may be displayed on the display 34 and input while editing with the keyboard / mouse 46 or the like.
  • This parameter data shows the possible state of input data for the activateTask program in the operating system. For example, in FIG. 12, an AND relationship is connected from a node activateTask to a node Executionlevel (execution level) and a node Task (task to be activated). This indicates that both activatelevel and Task must be established for activateTask. That is, it is shown that activateTask needs to determine both Executionlevel and Task.
  • an XOR relationship is connected from the node execution level to the node ExTask (task execution level) and the node ISR (interrupt). This indicates that only one of ExTask and ISR must be established for Executionlevel. In other words, Executionlevel indicates that only one of ExTask and ISR needs to be determined.
  • Task needs to determine all of TaskID (task identification code), status (task status after activation execution), and priority (execution priority). It is indicated that TaskID must be determined as either valid (valid ID) or invalid (invalid ID). It is indicated that the status should be determined as one of suspended (running), run (operation), ready (ready), and wait (wait). It is indicated that the pariority must be determined as one of high, low, and equiv.
  • TaskID task identification code
  • status task status after activation execution
  • priority execution priority
  • TaskID must be determined as either valid (valid ID) or invalid (invalid ID). It is indicated that the status should be determined as one of suspended (running), run (operation), ready (ready), and wait (wait). It is indicated that the pariority must be determined as one of high, low, and equiv.
  • step S2 the CPU 30 performs an and-and-level flattening process on the input parameter data (step S2). As described above, flattening is performed by finding a portion where AND relationships are continuous as a hierarchy.
  • FIG. 4 shows details of the flattening process of the AND AND hierarchy.
  • step S201 it is determined whether or not a child node is defined in an AND relationship from the target node (step S202).
  • a child node Executionlevel and a child node Task are defined in an AND relationship from the target node activateTask. Therefore, the CPU 30 proceeds to step S203 and sets the first child node Executionlevel as the target child node.
  • step S204 the CPU 30 determines whether a grandchild node is defined in an AND relationship from the target child node.
  • the process proceeds to step S205.
  • step S205 it is determined whether all child nodes have been processed as target child nodes.
  • this is set as the target child node (step S206).
  • CPU30 judges whether the grandchild node is defined by AND relationship from an object child node (step S204).
  • grandchild node TaskID, status, and priority are defined in an AND relationship from the target child node Task. Therefore, since satisfied, it progresses to step S209.
  • step S209 the CPU 30 determines whether a condition is attached to the target child node Task.
  • step S211 is executed.
  • the CPU 30 deletes the target child node Task and sets the grandchild node TaskID, status, and priority as child nodes of the target node activateTask. Thereby, as shown in FIG. 14, the object child node Task is deleted.
  • step S205 the CPU 30 determines whether or not all child nodes have been processed as target child nodes.
  • step S207 the process proceeds to step S207.
  • step S207 the CPU 30 determines whether or not all nodes have been processed as target nodes.
  • the node Executionlevel is set to the target node (step S208).
  • the CPU 30 determines whether or not a child node is defined in an AND relationship from the target node Executionlevel (step S202).
  • the process proceeds to step S207. Since there are still unprocessed nodes, the node TaskID is set as the target node (step S208). Since the node Task has already been deleted and is in a state as shown in FIG. 14, the node TaskID is set as the target node.
  • step S202 judges whether the child node is defined by AND relationship from object node TaskID.
  • step S208 the node status is set as the target node.
  • step S202 the node priority is set as the target node (steps S202, S207, and S208).
  • step S207 If the above processing is repeated and all nodes are processed as target nodes, the AND-and-hierarchy flattening processing is terminated (step S207).
  • FIG. 14 shows the parameter data after performing the above-described AND-and-level flattening process.
  • step S209 if a condition is attached to the target child node that satisfies the AND-and-hierarchy condition, the CPU 30 replaces the condition with the target node. For example, as shown in FIG. 13A, if the target condition is attached to the target child node C, the request condition is changed to the target node A as shown in FIG. 13B. The same applies not only when the target child node C is the request source as shown in FIG. 13 but also when the target child node is the request destination. Further, when an exclusion condition is attached to the target child node C, the replacement is performed in the same manner.
  • the CPU 30 first sets the root node actiavteTask as a target node in step S301 for the flattened data in FIG. Next, it is determined from this target node actiavteTask whether or not a child node is defined in an XOR relationship (step S302). Here, child nodes Executionlevel, TaskID, status, and priority are defined in an AND relationship, which is not satisfied. Accordingly, the process proceeds to step S307.
  • step S307 the CPU 30 determines whether all nodes have been processed as target nodes.
  • the next node Executionlevel is set as the target node (step S308).
  • step S302 the CPU 30 determines from the target node Executionlevel whether a child node is defined in an XOR relationship.
  • the child nodes ExTask and ISR are defined in the XOR relationship, which is satisfied. Therefore, the CPU 30 sets the child node ExTask as the target child node (step S303).
  • step S304 the CPU 30 determines whether a grandchild node is defined in the XOR relationship from the target child node ExTask (step S304).
  • the grandchild node Preemptive is defined in the AND relationship and is not satisfied, the process proceeds to step S305.
  • step S305 the CPU 30 determines whether or not all child nodes are the target child nodes. Since the child node ISR has not yet been set as the target child node, this is set as the target child node (step S306).
  • the CPU 30 determines whether or not a grandchild node is defined in an XOR relationship from the target child node ISR (step S304).
  • the grandchild nodes ISR1 and ISR2 are defined in the XOR relationship, they are satisfied. Accordingly, the process proceeds to step S309.
  • step S309 it is determined whether a condition is attached to the target child node ISR.
  • the process proceeds to step S310.
  • step S310 the CPU 30 determines whether the condition is an exclusive condition.
  • step S311 is executed.
  • step S311 the exclusion condition attached to the target child node ISR is changed to the grandchild nodes ISR1 and ISR2. That is, the exclusion condition between the node priority and the target child node ISR is replaced with the exclusion condition between the node priority and the target grandchild node ISR1, and the exclusion condition between the node priority and the target grandchild node ISR2.
  • step S312 the CPU 30 determines whether or not the condition attached to the target child node ISR is a request condition (step S312).
  • the process proceeds to step S317.
  • step S317 the CPU 30 deletes the target child node ISR and sets the grandchild nodes ISR1 and ISR2 as child nodes of the target node Executionlevel. Therefore, as shown in FIG. 17, the exclusion condition is changed and the target child node ISR is deleted.
  • step S305 the CPU 30 determines whether or not processing has been performed for all child nodes.
  • the process from step S304 onward is executed with the child node TaskID as the target child node.
  • the other child nodes “status” and “priority” are also sequentially processed as target child nodes, and the processing from step S304 is executed.
  • step S308 When the processing for all the child nodes of the target node is completed, the next node is set as the target node (step S308), and the processing from step S302 is executed.
  • step S307 When all nodes are processed as target nodes in this way, the XOR / XOR hierarchy flattening process is terminated (step S307).
  • step S310 when an exclusion condition is attached to the target child node, the exclusion condition is changed to all the grandchild nodes of the child node. At this time, if the target condition is attached to the target child node (step S312), the CPU 30 performs the following processing.
  • CPU 30 determines whether or not the request source of the request condition is a child node (step S313). If so, the CPU 30 replaces the request condition from the child node with the request condition from the grandchild node of the child node (step S314).
  • a request condition is set for the node E from the target child node C in a continuous portion of the XOR hierarchy.
  • the CPU 30 sets a request condition for the node E with the request source as a grandchild node of the target child node. Thereafter, the target child node C is deleted, and the grandchild nodes F, G, and H are added to the child nodes of the target node A (step S317).
  • step S313 If the CPU 30 determines in step S313 that a request condition that sets the target child node as a request destination is attached, the CPU 30 proceeds to step S315. In step S315, the CPU 30 replaces the request condition attached to the target child node with the target node. Further, an exclusion condition is set for each of the child nodes of the target node (excluding the target child node) from the request source node of the request condition (step S316).
  • a request condition is set from the node E for the target child node C in a continuous portion of the XOR hierarchy.
  • the CPU 30 changes the request destination of the request condition to the target node A as shown in FIG. 16B.
  • the target child node C here, only the child node B
  • the node E that is the request source of the request condition Set the exclusion condition.
  • the target child node C is deleted, and the grandchild nodes F, G, and H are added to the child nodes of the target node A (step S317).
  • step S4 the CPU 30 next executes the flattening process by lifting. That is, it is flattened to parameter data consisting of three layers defined by the AND relationship and the XOR relationship. Details of the flattening process by lifting are shown in FIGS.
  • the CPU 30 sets the first node below the third hierarchy as the target node in the flattened parameter data of FIG. 17 (step S401).
  • the node ExTask is the target node.
  • step S402 determines whether a child node is defined in an AND relationship from the target node ExTask (step S402).
  • the child node preemptive is defined, it is satisfied, so the process proceeds to step S403.
  • step S403 the first child node is set as a target child node.
  • the child node preemptive is the target child node.
  • the CPU 30 defines the structure below the target child node preemptive as an AND relationship as a child node of the parent node (parent parent node or grandparent node) activateTask of the target node ExTask (see FIG. 18).
  • a request condition is set for the target node ExTask from each of the grandchild nodes Yes and No (step S405) (hereinafter, child nodes, grandchild nodes, etc. are represented based on the state of FIG. ing). Furthermore, the CPU 30 adds a grandchild node with the content “None of other grandchild nodes” in an XOR relationship (step S406).
  • a node YesNo that is neither Yes nor No is defined.
  • the CPU 30 sets an exclusion condition between the added grandchild node YesNo and the target node ExTask (step S407). Thereby, the parameter data as shown in FIG. 18 is obtained.
  • step S408 the CPU 30 determines whether or not all child nodes are the target child nodes. If there is a child node that has not been processed, the next child node is set as the target child node, and step S402 and subsequent steps are executed. Here, since all the child nodes have been processed, the process proceeds to step S410.
  • step S410 the CPU 30 determines whether or not all nodes in the third hierarchy and below are the target nodes. If there is a node below the third hierarchy that is not the target, the next node is set as the target node (step S411). Here, since there is no node below the third hierarchy, the flattening process by lifting ends.
  • the flattened parameter data as shown in FIG. 18 can be obtained. This is represented in the data format as shown in FIG. 18
  • test data generation processing based on the parameter data generated in this way (FIG. 3, step S5).
  • test data is generated based on the all-pair method.
  • the flattened parameter data is standardized as three-layer data consisting of an AND relationship and an XOR relationship. Therefore, the test data generation process by the all-pair method is easy.
  • a test data generation program for example, Microsoft's PICT
  • PICT PICT
  • Test data can be generated as described above.
  • test data is generated.
  • the parameter data flattened by the processes in steps S2 to S4 may be output.
  • the user can input the output parameter data to a tool such as PICT to obtain test data.
  • the CPU of the server device receives parameter data from the terminal device via the Internet (step S50). Subsequently, flattening of the AND-AND hierarchy (step S2), flattening of the XOR-XOR hierarchy (step S3), flattening by lifting (step S4), and generation of test data (step S5) are executed. These processes are the same as those in FIG. Subsequently, the generated test data is transmitted to the terminal device (step S51).
  • test data can be obtained without preparing a program in the terminal device.
  • the flattened parameter data may be transmitted to the terminal device.
  • the user can input this into a tool such as PICT on the terminal device side to obtain test data.
  • processing is performed in the order of AND-AND hierarchy flattening and XOR-XOR hierarchy flattening.
  • XOR-XOR hierarchy flattening may be executed prior to AND-AND hierarchy flattening.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Debugging And Monitoring (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

Selon l'invention, dans une structure logique de données de paramètre d'entrée (20), un moyen de nivellement de hiérarchie ET-ET (4) commute un état d'une partie dans laquelle une relation ET et une relation ET sont contigües à partir d'un nœud sujet à titre de hiérarchie, et supprime un nœud enfant sujet (Ta). Un moyen de nivellement de hiérarchie OU-OU (6) commute un état d'une partie dans laquelle une relation OU et une relation OU sont contigües à partir d'un nœud sujet à titre de hiérarchie, et supprime un nœud enfant sujet (ISR). Un moyen de nivellement par le haut (8) trouve une partie (34) dans laquelle la relation ET et la relation OU sont contigües à partir du nœud sujet (Ta) à titre de niveau hiérarchique inférieur et la relation OU et la relation ET sont contigües à partir du nœud sujet à titre de niveau hiérarchique supérieur, commute l'état, et effectue un nivellement. Il est ainsi possible d'obtenir des données de paramètre normalisées.
PCT/JP2014/000777 2013-02-15 2014-02-14 Dispositif de génération de données de test WO2014125836A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2013-027744 2013-02-15
JP2013027744A JP6037307B2 (ja) 2013-02-15 2013-02-15 テストデータ生成装置

Publications (1)

Publication Number Publication Date
WO2014125836A1 true WO2014125836A1 (fr) 2014-08-21

Family

ID=51353847

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2014/000777 WO2014125836A1 (fr) 2013-02-15 2014-02-14 Dispositif de génération de données de test

Country Status (2)

Country Link
JP (1) JP6037307B2 (fr)
WO (1) WO2014125836A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017035812A1 (fr) * 2015-09-02 2017-03-09 Hewlett Packard Enterprise Development Lp Chaîne de réplication d'agents

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010191508A (ja) * 2009-02-16 2010-09-02 Fujitsu Ltd プログラムモデル検査におけるデータ生成プログラム、データ生成方法およびデータ生成装置
JP2012248101A (ja) * 2011-05-30 2012-12-13 Ntt Data Corp プログラムテスト支援装置、プログラムテスト支援方法、プログラムテスト支援プログラム
JP2013003854A (ja) * 2011-06-16 2013-01-07 Fujitsu Ltd テストデータ生成プログラム、テストデータ生成方法、テストデータ生成装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010191508A (ja) * 2009-02-16 2010-09-02 Fujitsu Ltd プログラムモデル検査におけるデータ生成プログラム、データ生成方法およびデータ生成装置
JP2012248101A (ja) * 2011-05-30 2012-12-13 Ntt Data Corp プログラムテスト支援装置、プログラムテスト支援方法、プログラムテスト支援プログラム
JP2013003854A (ja) * 2011-06-16 2013-01-07 Fujitsu Ltd テストデータ生成プログラム、テストデータ生成方法、テストデータ生成装置

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017035812A1 (fr) * 2015-09-02 2017-03-09 Hewlett Packard Enterprise Development Lp Chaîne de réplication d'agents

Also Published As

Publication number Publication date
JP6037307B2 (ja) 2016-12-07
JP2014157473A (ja) 2014-08-28

Similar Documents

Publication Publication Date Title
CN106777219B (zh) 用于虚拟化数据中心的数据处理方法及装置
EP3852335B1 (fr) Procédé et système de modification d'une configuration réseau de chaîne de blocs
CN106415670A (zh) 用于实体模型的增材制造的支撑结构
CN103020089A (zh) 一种将excel文件中的数据导入数据库的方法及装置
US9280370B2 (en) System structure management device, system structure management method, and program
CN111614490A (zh) 基于顶级容器集群对托管容器集群的管理系统及方法
CN114675965B (zh) 联邦学习方法、装置、设备和介质
CN108665272A (zh) 区块链数据处理方法、装置、设备和存储介质
CN108345496B (zh) 一种运行应用程序的方法及装置
US20140351251A1 (en) Text-based command generation
JP6037307B2 (ja) テストデータ生成装置
US20190146457A1 (en) System and method for finite element analysis of parts having variable spatial density graded regions produced via 3d printers
US20210173742A1 (en) Method, device, and program product for selecting rebuild destination in storage system
KR101513393B1 (ko) 프로그램 작성 장치 및 프로그래머블 로직 컨트롤러
JP6037310B2 (ja) テストデータ表示装置
JP2019204373A (ja) ビジュアルプログラミングツールを用いてプログラムを作成することを支援する装置および方法
US11061664B2 (en) Code management system and code management method
WO2021077862A1 (fr) Procédé et dispositif de synchronisation de fichiers
CN111475572B (zh) 区块生成方法、装置、设备和介质
JP7305898B2 (ja) 操作応答方法、操作応答装置、電子機器及び記憶媒体
CN111309592B (zh) 一种权限检查方法、装置、存储介质及终端
US11924340B2 (en) Cryptographically secure shuffle with multi-layer randomness
US20230342061A1 (en) Method, electronic device and computer program product for data processing
JP5797994B2 (ja) ジョブ管理システム
JP2009259064A (ja) 評価装置および操作画面改善装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14751221

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14751221

Country of ref document: EP

Kind code of ref document: A1