The present disclosure generally relates to a generation device, and more particularly relates to a generation method, and a program for generating a test sequence.
Up to now, a technique for performing a test that covers a large number of input conditions, using a combinational test has been known (for example, Patent Literature 1 and Non-patent Literatures 1 and 2). Unfortunately, if the combinational test is applied to a system for receiving an ordered sequence, the number of tests could be too large and/or the test could be too long.
In view of the above, a known method for testing a system for receiving an ordered sequence involves checking a test case by describing a state machine, a temporal logic, and the like (for example, Patent Literatures 2 and 3). Unfortunately, in general, according to this method, an input space is complicated, checking of completeness is difficult, and detailed specifications about the operation sequence received by the system as a test target are required. Moreover, Patent Literature 2 has a problem that the test target needs to be reducible to an automaton, and Patent Literature 3 has a problem that a specific algorithm for generating the test case is not disclosed.
[Patent Literature 1] JP2012-185642A
[Patent Literature 2] JP2011-065576A
[Patent Literature 3] JP2010-191899A
[Non-patent Literature 1] “Software fault interactions and implications for software testing.” Software Engineering, IEEE Transactions on 30.6 (2004): 418-421.
[Non-patent Literature 2] “MUSTC-Testing: Multi-Stage-Combinational Test scheduling at the Register-Transfer Level.” VLSI Design, 1995, Proceedings of the 8th International Conference on. IEEE, 1995.
In order to solve the problems described above, the present invention provides a technique for ensuring a large coverage of a test case without defining an operation sequence in detail for a system for receiving an ordered sequence.
A first aspect of the present invention provides a device for generating a test sequence to be supplied to a test target, the generation device including: a test vector generation unit for selecting, for each of a plurality of parameters to be included in a test vector, one value from among possible values for the parameter to generate a plurality of test vectors whose combinations of values are different from each other; an extraction unit for extracting, as a plurality of partial sequences each including one or more test vectors, a plurality of portions of a series including the plurality of test vectors output by the test vector generation unit; and a test sequence generation unit for generating a test sequence based on the extracted plurality of partial sequences. The first aspect of the present invention also provides a generation method using the generation device and a program used for the generation device.
Note that all necessary features of the present invention are not listed above in the summary of the invention. Moreover, sub-combinations of these feature groups can also be included in the present invention.
The accompanying figures where like reference numerals refer to identical or functionally similar elements throughout the separate views, and which together with the detailed description below are incorporated in and form part of the specification, serve to further illustrate various embodiments and to explain various principles and advantages all in accordance with the present disclosure, in which:
Hereinafter, the present invention is described by way of an embodiment of the invention, and the following embodiment is not intended to limit the invention according to Scope of Claims. Moreover, all combinations of features described in the embodiment are not necessarily essential to solving means of the invention.
In the present embodiment, a generation device 10 receives, from a user, a setting file in which specifications of an operation of a test target (SUT) and the length of a test sequence are set, and defines an operation in accordance with the setting file, to thereby generate test vectors according to a pairwise method or the like. The generation device 10 generates a test sequence including a set of operations based on the test vectors.
After that, a test driver causes the test target to execute the operations based on the test sequence, and acquires the execution result, to thereby obtain a test result corresponding to the test sequence. The generation device 10 according to the present embodiment can ensure completeness of operations and states on the basis of the setting file, and can generate the test sequence whose length is suppressed within a realistically executable range.
The first reception unit 100 receives, from a user terminal 20 or the like, prohibition rule information for defining combinations of values that cannot be used, for parameters as factors included in a test vector. The first reception unit 100 supplies the received prohibition rule information to the test vector generation unit 120.
The test vector generation unit 120 selects a value of each parameter (that is, a level of each factor) of a test vector to generate test vectors whose combinations of values taken by the parameters are different from each other. For example, according to a pairwise method, the test vector generation unit 120 generates the test vectors that cover all possible patterns taken by the combinations of the values of the parameters.
Here, the test vector generation unit 120 may generate the test vectors that take combinations of values whose use is permitted, on the basis of the prohibition rule information. The test vector generation unit 120 outputs a series of the generated test vectors to the extraction unit 150.
The second reception unit 130 receives, from the user terminal 20 or the like, commutativity information indicating a condition of values of the parameters under which the order of two or more test vectors is changeable. The second reception unit 130 supplies the commutativity information to the extraction unit 150.
The third reception unit 140 receives, from the user terminal 20 or the like, error condition information indicating a condition of a series including one or more test vectors under which causes an error and makes it impossible to continue a test of the test target. The third reception unit 140 supplies the error condition information to the extraction unit 150.
The extraction unit 150 extracts, as partial sequences each including one or more test vectors, portions of the series including the test vectors output by the test vector generation unit 120. For example, the extraction unit 150 extracts the mutually commutative partial sequences from the series including the test vectors, on the basis of the commutativity information.
Further, the extraction unit 150 may exclude a portion that causes the error from the extracted partial sequences, on the basis of the error condition information, and may further extract partial sequences that do not cause the error. Here, the extraction unit 150 may further generate an error sequence used for a test in which the error is caused, on the basis of the portion that is excluded from the series including the test vectors and causes the error. The extraction unit 150 supplies the partial sequences that do not cause the error and the error sequence to the test sequence generation unit 160.
The test sequence generation unit 160 generates a test sequence on the basis of the extracted partial sequences that do not cause the error. For example, the test sequence generation unit 160 generates a test sequence including a cyclic group of the partial sequences, on the basis of the extracted partial sequences that do not cause the error. The test sequence generation unit 160 may add the error sequence to the test sequence.
As described above, in the generation device 10, the test vector generation unit 120 generates a series of test vectors in which pairwise completeness is ensured, the extraction unit 150 extracts the mutually commutative partial sequences from the series of the test vectors, and the test sequence generation unit 160 generates a test sequence including a cyclic group of the partial sequences. With this configuration, the generation device 10 can cover inputs based on an operation sequence using a realistic test sequence length, without defining a state machine of the test target.
First, in S110, the first reception unit 100 receives, from the user terminal 20 or the like, prohibition rule information for defining combinations of values that cannot be used for the parameters included in a test vector.
For example, as illustrated in
For example, the first reception unit 100 receives prohibition rule information that “if OP is Delete (deletion of a record), fields other than ID should be Null”. That is, the first reception unit 100 receives “(OP=Delete) and {(Serial=Null) or (Name=Null)}” as the prohibition rule information. The first reception unit 100 supplies the received prohibition rule information to the test vector generation unit 120.
Subsequently, in S120, the test vector generation unit 120 selects, for each of the parameters to be included in the test vector, one value from among possible values taken by each parameter to generate test vectors whose combinations of values taken by the parameters are different from each other. For example, according to a pairwise method, an orthogonal table, a naive method in which all patterns of combinations of parameter values are covered, or the like, the test vector generation unit 120 generates a list including the test vectors that cover all possible patterns taken by the combinations of the values of the parameters.
Note that the test vector generation unit 120 may select possible values taken by all the parameters included in the test vector. Alternatively, the test vector generation unit 120 may select possible values taken by only a predetermined number of parameters of all the parameters, and may set a predetermined value to each of the other parameters.
Moreover, the test vector generation unit 120 generates the test vectors that take combinations of values whose use is permitted, on the basis of the prohibition rule information acquired from the first reception unit 100. For example, the test vector generation unit 120 may set negative to a condition of a parameter whose error is indicated by the prohibition rule information, to generate the test vectors according to the pairwise method.
As an example, on the basis of the prohibition rule information that “if OP is Delete (deletion of a record), fields other than ID should be Null”, the test vector generation unit 120 generates a test vector in which ID is Delete and Name or Serial is Null, and avoids generating a test vector in which ID is Delete and Name or Serial is other than Null.
Specifically, as illustrated in
Subsequently, in S130, the extraction unit 150 extracts partial sequences in which one or more test vectors are ordered and arranged, from the series including the test vectors.
For example, first, the second reception unit 130 receives, from the user terminal 20 or the like, commutativity information indicating a condition of values of the parameters under which the order of two or more test vectors is changeable, and supplies the commutativity information to the extraction unit 150. That is, for two test vectors ai and aj included in a series a of n test vectors (a ∈ {a1, a2, . . . , an}), the second reception unit 130 supplies a condition of parameters of the test vectors ai and aj under which the result obtained by executing in order of ai→aj and a result obtained by executing in order of aj→ai are equal to each other, as the commutativity information to the extraction unit 150.
As an example, in the case of the test vectors for records as illustrated in
Subsequently, the extraction unit 150 extracts the mutually commutative partial sequences each including one or more test vectors from the series including the test vectors that are arranged in the listed order, on the basis of the commutativity information. For example, the extraction unit 150 extracts three partial sequences (G1, G2, and G3) illustrated in
Subsequently, in S133, the extraction unit 150 determines whether or not the partial sequence Gi that is the ith partial sequence is an empty set. If the partial sequence Gi is empty, the extraction unit 150 executes the processing in S136. If the partial sequence Gi is not empty, the extraction unit 150 executes the processing in S134.
In S134, on the basis of the commutativity information, the extraction unit 150 determines whether or not at least one test vector included in the partial sequence Gi and the test vector am are mutually commutative. If the extraction unit 150 determines that the vectors are mutually commutative, the extraction unit 150 proceeds the processing to S135. If no, the extraction unit 150 proceeds the processing to S136.
In S135, the extraction unit 150 executes a process of adding 1 to i. After that, the extraction unit 150 returns the processing to S133.
In S136, the extraction unit 150 executes a process of adding am to the partial sequence Gi. After that, the extraction unit 150 returns the processing to S131.
In this way, the extraction unit 150 allocates each partial sequence am to any of the partial sequences Gi. Note that, in the case where a state machine of the test target is defined, the extraction unit 150 may make the upper limit of the number of partial sequences added in S135 equivalent to the number of states of the test target, and may proceed the processing to S136 without executing S135 if the value of i exceeds the number of states.
Subsequently to S130, in S140, the extraction unit 150 excludes a portion that causes an error from the partial sequences, and extracts partial sequences that do not cause the error.
For example, first, the third reception unit 140 receives, from the user terminal 20 or the like, error condition information indicating a condition of a series including one or more test vectors under which an error that makes it impossible to continue a test of the test target is caused, and supplies the error condition information to the extraction unit 150. As an example, the third reception unit 140 supplies, to the extraction unit 150, a condition of parameters of a test vector (that is, a test vector a that satisfies Gx·a=0, in relation to a given partial sequence Gx) corresponding to an incorrect operation on a database, such as: insertion or update of a record having an overlapping primary key; or insertion or update of an incorrect record containing a NULL value. If the incorrect operation is supplied to the test target, the obtained result becomes an error, and the output is not changed even by the subsequent operation.
The extraction unit 150 excludes a test vector that causes the error from each of the partial sequences, on the basis of the error condition information, and generates partial sequences (herein, also referred to as non-error sequences) that do not cause the error and each include one or more test vectors.
Subsequently, in S150, the extraction unit 150 further generates an error sequence used for a test in which the error is caused, on the basis of the portion that is excluded from the series including the test vectors and causes the error. For example, the extraction unit 150 extracts, for each test vector that causes the error in each partial sequence, one or more test vectors that do not cause the error from the first test vector up to the test vector that causes the error, and adds the test vector that causes the error to the one or more test vectors that do not cause the error, and thereby generate an error sequence. The extraction unit 150 may generate error sequences for each test vector that causes the error.
The extraction unit 150 excludes the test vectors (2) to (4) that cause the error from the test vectors (1) to (6) included in the partial sequence G1, to thereby generate the non-error sequence G1-N including the test vector (1), the test vector (5), and the test vector (6).
Moreover, the extraction unit 150 couples: one or more test vectors that do not cause the error in a range of from the first test vector (1) to the test vector (2) that causes the error, that is, the test vector (1); to each of the test vectors (2) to (4) that cause the error. As a result, the extraction unit 150 generates: the error sequence G1-1 including the test vectors (1) and (2); the error sequence G1-2 including the test vectors (1) and (3); and the error sequence G1-3 including the test vectors (1) and (4).
Similarly to the processing in
Similarly to the processing in
The extraction unit 150 supplies the extracted non-error sequences and the extracted error sequences to the test sequence generation unit 160.
Subsequently, in S160, the test sequence generation unit 160 generates a test sequence having a length equal to or larger than a designated sequence length designated in advance, on the basis of the extracted non-error sequences. The test sequence generation unit 160 further generates a test sequence on the basis of the error sequences.
For example, the test sequence generation unit 160 generates, as the test sequences, (1) repetitions of each of the non-error sequences, (2) a sequence obtained by coupling (1) the repetitions of each of the non-error sequences, (3) cyclic groups of the non-error sequences, and/or (4) a sequence obtained by coupling the cyclic groups of the non-error sequences.
The test sequence generation unit 160 generates, as the test sequences, (1) an operation in which O1 is repeated a predetermined number of times, an operation in which O2 is repeated a predetermined number of times, and an operation in which O3 is repeated a predetermined number of times, (2) an operation in which O1 is repeated a predetermined number of times, O2 is then repeated a predetermined number of times, and O3 is then repeated a predetermined number of times, (3) an operation in which O1, O2, and O3 are executed in the stated order, an operation in which O2, O3, and O1 are executed in the stated order, and an operation in which O3, O1, and O2 are executed in the stated order, and (4) an operation in which O1, O2, O3, O2, O3, O1, O3, O1, and O2 are executed in the stated order.
For example, as illustrated in
For example, as illustrated in
For example, as illustrated in
For example, as illustrated in
Moreover, for example, as illustrated in
Moreover, for example, as illustrated in
Here, the test sequence generation unit 160 may add the error sequence received from the extraction unit 150, to the test sequence.
In this way, in consideration of the prohibition rule information, the generation device 10 selects combinations of levels from factors according to the pairwise method or the like to generate a test vector, and treats the test vector as an input to the test target. As a result, the generation device 10 can secure completeness of factors included in a test vector as a unit operation.
Moreover, the generation device 10 applies coupling rules to generated test vectors, to further generate a partial sequence in which the test vectors are ordered based on the commutativity of operations. As a result, through application of a cyclic group, the generation device 10 can apply an output of a combinational test method such as the pairwise method to the test target for receiving an ordered sequence, without defining a state machine.
Moreover, the generation device 10 generates a test sequence based on a partial sequence from which test vectors corresponding to operations that cause the error are removed, and generates another test sequence for the error portion. As a result, the generation device 10 can separately execute a test of an error process while omitting a useless operation from the test sequences.
Further, the generation device 10 applies a cyclic group to a partial sequence from which the error is removed, to generate a test sequence. As a result, the generation device 10 can secure completeness of a state transition of the test target using the test sequence of a realistically testable length. For example, a test sequence generated according to a naive method has a length of kk, and the generation device 10 of the present embodiment can generate a test sequence having a length of approximately k2.
Note that, instead of acquiring the prohibition rule information, the commutativity information, and/or the error condition information from the user terminal or the like, the generation device 10 may store these pieces of information in a storage device in advance, and may read out the stored pieces of information from the storage device as needed.
Note that the assumption that {O1, O2, . . . , Ok} covers the possibility cases of operations received by the test target is an empirical hypothesis that is obtained through tests using the pairwise method and the orthogonal table, and its effectiveness is confirmed by many examples.
(1) Definition
The test target as a state machine is defined by Sk,1={Q, Σ, Δ}. Here, Q is a set of a finite number of states, and |Q|=k. Σ is a residue class of 1 types of operations received by the test target, and satisfies Σ≅{O1} (homomorphism). The transition is defined by Δ⊆Q×Σ×Σ.
(2) Theorem
In the case of Tk (k≥1) (a set of test vectors), Tk covers all states of Sk,1. This is denoted by Tk↑Sk,1.
(3) Proof
Proof is given according to induction for k.
Here, a state that is newly added at Sk+1,1 is represented by qk+1. Moreover, a path from Sk,1 to qk+1 is represented by Ox1, . . . , Oxm. With the use of the fact that (4) the sequence obtained by coupling the cyclic groups of the non-error sequences is configured such that ∀j;Tk+1⊆Tk Okj, the entire path from Sk,1 to qk+1 can be covered by Tk+1 in consideration of m≤k. Accordingly, if Tk↑Sk,1 is established, Tk+1↑Sk+1,1 is also established, and the completeness of the transition state of the test target is secured.
The host controller 2082 connects the RAM 2020 to the CPU 2000 and the graphics controller 2075 that access the RAM 2020 at high transmission rates. The CPU 2000 operates and controls each unit on the basis of programs stored in the ROM 2010 and the RAM 2020. The graphics controller 2075 acquires image data that is generated by the CPU 2000 and the like on a frame buffer provided in the RAM 2020, and displays the image data on the display device 2080. Alternatively, the graphics controller 2075 may include a frame buffer for storing image data generated by the CPU 2000 and the like.
The input/output controller 2084 connects the host controller 2082 to the communication interface 2030, the hard disk drive 2040, and the CD-ROM drive 2060 that are relatively high-speed input/output devices. The communication interface 2030 makes communications with other devices via a network through wires or radio waves. Moreover, the communication interface functions as hardware for making communications. The hard disk drive 2040 stores therein programs and data used by the CPU 2000 in the computer 1900. The CD-ROM drive 2060 reads a program or data from a CD-ROM 2095, and provides the program or data to the hard disk drive 2040 through the RAM 2020.
Moreover, the ROM 2010 and the flexible disk drive 2050 and the input/output chip 2070 that are relatively low-speed input/output devices are connected to the input/output controller 2084. The ROM 2010 stores therein a boot program executed at the time of activation of the computer 1900 and/or programs depending on hardware of the computer 1900. The flexible disk drive 2050 reads a program or data from a flexible disk 2090, and provides the program or data to the hard disk drive 2040 through the RAM 2020. The input/output chip 2070 connects the flexible disk drive 2050 to the input/output controller 2084, and connects various input/output devices to the input/output controller 2084 through, for example, a parallel port, a serial port, a keyboard port, and a mouse port.
The programs that are provided to the hard disk drive 2040 through the RAM 2020 are provided by a user in the state where the programs are stored in a recording medium such as the flexible disk 2090, the CD-ROM 2095, or an IC card. The programs are read out from the recording medium, are installed onto the hard disk drive 2040 in the computer 1900 through the RAM 2020, and are executed by the CPU 2000.
The programs that are installed onto the computer 1900 to cause the computer 1900 to function as the generation device 10 include a first reception module, a test vector generation module, a second reception module, a third reception module, an extraction module, and a test sequence generation module. These programs or modules may act on the CPU 2000 and the like to cause the computer 1900 to function as the first reception unit 100, the test vector generation unit 120, the second reception unit 130, the third reception unit 140, the extraction unit 150, and the test sequence generation unit 160.
Information processing described in these programs is read onto the computer 1900 to thereby function as the first reception unit 100, the test vector generation unit 120, the second reception unit 130, the third reception unit 140, the extraction unit 150, and the test sequence generation unit 160 that are specific means achieved by cooperation of software and the above-mentioned various hardware resources. Then, computation or processing of information suited to the intended use of the computer 1900 according to the present embodiment is achieved by these specific means, whereby a special generation device 10 suited to its intended use is constructed.
As an example, in the case where the computer 1900 makes communications with an external device or the like, the CPU 2000 executes a communication program loaded onto the RAM 2020, and instructs the communication interface 2030 to perform a communication process, on the basis of a processing content described in the communication program. Upon reception of control by the CPU 2000, the communication interface 2030 reads out transmission data stored in a transmission buffer region or the like provided on a storage device such as the RAM 2020, the hard disk drive 2040, the flexible disk 2090, or the CD-ROM 2095, and transmits the transmission data to the network. Otherwise, the communication interface 2030 writes reception data received from the network into a reception buffer region or the like provided on the storage device. In this way, the communication interface 2030 may transfer the transmission/reception data with respect to the storage device according to a direct memory access (DMA) method. Alternatively, the CPU 2000 may read out data from the transfer-origin storage device or communication interface 2030, and may write the data into the transfer-destination communication interface 2030 or storage device, to thereby transfer the transmission/reception data.
Moreover, the CPU 2000 reads the entire or a necessary portion from files, databases, or the like stored in an external storage device such as the hard disk drive 2040, the CD-ROM drive 2060 (the CD-ROM 2095), or the flexible disk drive 2050 (the flexible disk 2090), onto the RAM 2020 through DMA transfer or the like, and performs various processing on the data on the RAM 2020. Then, the CPU 2000 writes the processed data back into the external storage device through DMA transfer or the like. In such processing, the RAM 2020 can be considered to temporarily hold the contents of the external storage device, and hence, in the present embodiment, the RAM 2020, the external storage device, and the like are generally referred to as a memory, a storage unit, a storage device, and the like.
Various pieces of information such as various programs, pieces of data, tables, and databases in the present embodiment are stored in such a storage device to be subjected to information processing. Note that the CPU 2000 may hold part of the RAM 2020 on a cache memory, and may read and write data on the cache memory. Also in this mode, the cache memory takes on part of the function of the RAM 2020, and hence, in the present embodiment, the cache memory is also included in the RAM 2020, the memory, and/or the storage device unless distinctively described.
Moreover, the CPU 2000 performs, on data read out from the RAM 2020, various processes including various types of computation, information processing, condition determination, and information retrieval/translation that are described in the present embodiment and are designated by a sequence of instructions in a program, and writes the processed data back into the RAM 2020. For example, in the case where the CPU 2000 makes condition determination, the CPU 2000 determines whether or not a condition that various variables described in the present embodiment are larger than, smaller than, equal to or larger than, equal to or smaller than, or equal to another variable or a constant is satisfied. Then, if the condition is satisfied (or is not satisfied), the CPU 2000 moves on to a different sequence of instructions, or invokes a sub-routine.
Moreover, the CPU 2000 can retrieve information stored in a file, a database, or the like in the storage device. For example, in the case where entries in each of which an attribute value having a second attribute is associated with an attribute value having a first attribute are stored in the storage device, the CPU 2000 retrieves an entry in which the attribute value having the first attribute coincides with a designated condition, from among the entries stored in the storage device, and reads out the attribute value having the second attribute stored in the retrieved entry, whereby the CPU 2000 can obtain the attribute value having the second attribute associated with the first attribute that satisfies the designated condition.
The above-mentioned programs or modules may be stored in an external recording medium. Examples of the usable recording medium include an optical recording medium such as a DVD or a CD, a magneto-optical recording medium such as a MO, a tape medium, and a semiconductor memory such as an IC card, in addition to the flexible disk 2090 and the CD-ROM 2095. Moreover, a storage device such as a hard disk or a RAM provided to a server system connected to a private communication network or the Internet may be used as the recording medium, and the programs may be provided to the computer 1900 via the network.
Hereinabove, the present invention has been described by way of the embodiment, and the technical range of the present invention is not limited to the range described above in the embodiment. It is obvious for those skilled in the art that the embodiment can be variously changed or improved. It is obvious from the description in Scope of Claims that such changed or improved modes can also be included in the technical range of the present invention.
It should be noted that processes in operations, procedures, steps, stages, and the like in the devices, the systems, the programs, and the methods described in Scope of Claims, Description, and the drawings can be executed in arbitrary order, unless “before”, “prior to”, and the like are particularly specified or unless an output of the previous process is used in the subsequent process. Even if operation flows in Scope of Claims, Description, and the drawings are described using “first”, “subsequently”, and the like for convenience sake, execution in the order indicated by these terms is not intended to be essential.
10 generation device, 20 user terminal, 100 first reception unit, 120 test vector generation unit, 130 second reception unit, 140 third reception unit, 150 extraction unit, 160 test sequence generation unit, 1900 computer, 2000 CPU, 2010 ROM, 2020 RAM, 2030 communication interface, 2040 hard disk drive, 2050 flexible disk drive, 2060 CD-ROM drive, 2070 input/output chip, 2075 graphics controller, 2080 display device, 2082 host controller, 2084 input/output controller, 2090 flexible disk, 2095 CD-ROM
Number | Date | Country | Kind |
---|---|---|---|
2014-030275 | Feb 2014 | JP | national |
Number | Name | Date | Kind |
---|---|---|---|
5050091 | Rubin | Sep 1991 | A |
5581491 | Biwer | Dec 1996 | A |
5598344 | Dangelo | Jan 1997 | A |
6292765 | Ho | Sep 2001 | B1 |
8190953 | Chakravarthy | May 2012 | B2 |
8438442 | Morrison | May 2013 | B2 |
8661305 | Rajarao | Feb 2014 | B2 |
20020073374 | Danialy | Jun 2002 | A1 |
20030115033 | Aitken et al. | Jun 2003 | A1 |
20030145297 | Cote et al. | Jul 2003 | A1 |
20040010741 | Forlenza | Jan 2004 | A1 |
20070055665 | Kitahara et al. | Mar 2007 | A1 |
20070079204 | Ong | Apr 2007 | A1 |
20070259256 | Le Canut et al. | Nov 2007 | A1 |
20080072112 | Varadarajan | Mar 2008 | A1 |
20100109676 | Zjajo | May 2010 | A1 |
20140298120 | Tong | Oct 2014 | A1 |
20150234007 | Amano et al. | Aug 2015 | A1 |
20160204781 | Plusquellic | Jul 2016 | A1 |
Number | Date | Country |
---|---|---|
0612285 | Jan 1994 | JP |
2008210275 | Sep 2008 | JP |
2010191899 | Sep 2010 | JP |
2011034274 | Feb 2011 | JP |
2011044131 | Mar 2011 | JP |
2011065576 | Mar 2011 | JP |
2012185642 | Sep 2012 | JP |
2014026458 | Feb 2014 | JP |
Entry |
---|
Kuhn, et al., “Software Fault Interactions and Implications for Software Testing”, IEEE Transactions of Software Engineering, Jun. 2004, pp. 418-421, vol. 30, No. 6. |
Yadavalli, et al., “MUSTC-Testing: Multi-Stage-Combinational Test Scheduling at the Register-Transfer Level”, 8th International Conference on VLSI Design, Jan. 1995, pp. 110-115. |
List of IBM Patents or Patent Applications Treated as Related, Jan. 24, 2017. 2 pages. |
Decision to Grant a Patent, Application No. 2014-030275, May 24, 2016. Translated Sep. 16, 2016. 6 pages. |
JP Office Action; Notification of Reasons for Refusal, Application No. 2014-030275, dated Mar. 1, 2016. Translated Sep. 16, 2016. 3 pages. |
Amano, et al., “Generation Device, Generation Method, and Program”, Japan Application No. 2014-030275, filed Feb. 20, 2014. 54 pages. |
Number | Date | Country | |
---|---|---|---|
20170132103 A1 | May 2017 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14627409 | Feb 2015 | US |
Child | 15415331 | US |