R. Mandl. Orthogonal latin squares an application of experiment design to compiler testing. Communications of the ACM, 28(10):1054-1058, 1985.  Home/Search   Document Not in Database   Summary   ACM   TOC   Related Articles   Check

....selects one that covers the most uncovered pairs. Another approach to generating a pairwise test set is to use orthogonal arrays. The original method of orthogonal arrays requires that all parameters have the same number of values and that each pair of values be covered the same number of times [ 8 ] . The first requirement can be relaxed by adding don t care values for missing values. But the use of don t care values creates extra tests [ 9 ] The second requirement is considered unnecessary for software testing and also creates extra tests for pairwise testing [ 1 ] In this paper, we ....

R. Mandl. Orthogonal latin squares: An application of experimental design to compiler testing. Comm. ACM, pages 1054--1058, October 1985.

....from random testing by allowing the tester to define complex relationships between the test parameters. The tester can use the AETG constructs for relations, constraints and hierarchy to focus testing. The AETG test plans are far from random. Closely related to our work is the use by Mandl [17], Brownlie, Prowse, and Phadke [1] and Heller [14] of orthogonal arrays to generate pair wise test sets. Orthogonal arrays are combinatorial designs used to design statistical experiments [21] 18] Because of their use in statistical experimentation, they have a balance requirement that ....

R. Mandl, "Orthogonal Latin Squares: An Application of Experimental Design to Compiler Testing," Comm. ACM, vol. 28, no. 10, pp. 1,054-1,058, Oct. 1985.

....in many cases. Testing for boolean conditions is discussed in [13, 14] Automated test generation has been considered by some researchers [14, 15] The problem of reducing the number of tests by limiting the total number of combinations to be considered by using orthogonal arrays is given in [16, 17]. This approach, although not considered here, can be used in conjunction with the scheme proposed here. One major difference between the two approaches is that antirandom testing will test for all input interactions provided sufficient test vectors are applied. It is thus applicable for ....

R. Mandl, "Orthogonal Latin square: An application of experiment design to compiler testing," Comm. ACM, Oct. 1985, pp. 1054-1058.

....and combinatorial theories. An introduction to the algebraic construction of orthogonal Latin squares is contained in Gilbert [2] while the combinatorial theory and properties are covered in detail in Hall [3] The use of orthogonal Latin squares for testing software is introduced by Mandl [4] in testing an Ada compiler. An example application of the method is to choose the types of the left and right sides of logical operators to achieve pair wise type coverage. Mandl also presents some of the restrictions imposed by the theory. Brownlie, et al. 5] provide a case report on the use ....

....5 6 7 8 9 Parameter 1 1 1 1 2 2 2 3 3 3 Parameter 2 1 2 3 1 2 3 1 2 3 Parameter 3 1 2 3 2 3 1 3 1 2 Parameter 4 1 2 3 3 1 2 2 3 1 Restrictions on the existence of orthogonal Latin squares It is always possible to construct a single n n Latin square for any size n. However, as listed in Mandl [4], and proved in Hall [3] there are restrictions on the existence of a set of orthogonal Latin squares: 1. For any n, there are at most n 1 mutually orthogonal n n Latin squares. 2. If p is the smallest prime in the prime factorization of n, and occurs j times in that factorization, then ....

R. Mandl, "Orthogonal Latin squares: An application of experiment design to compiler testing", Communications of the ACM, Vol. 28 No. 10 (October 1985) pp. 1054-1058.

....researching this area, but it is beyond the scope of this paper. 3 RELATED WORK Heller offers a brief introduction to using design of experiment techniques to choose small sets of test cases [8] Mandl describes his experience with applying experiment design techniques to compiler testing [10]. Dunietz et al. report on their experience with attaining code coverage based on pairwise, triplet wise, and higher coverage of values within test tuples [7] They were able to attain very high block coverage with relatively few cases, but attaining high path coverage required far more cases. ....

R. Mandl. Orthogonal latin squares: An application of experiment design to compiler testing. Communications of the ACM, 28(10):1054--1058, Oct. 1985.

....testing, checkpoint encoding, test coverage, software testing. 1 Introduction Testing of software requires a significant commitment of resources [12, 17] It is of considerable practical and theoretical importance to explore ways to reduce the testing effort while maximizing test effectiveness [3, 6, 13, 15]. There are many testing techniques discussed in the literature that can be termed black box testing [6, 8, 9, 13, 20] Random testing [8] chooses tests randomly based on some input distribution, without attempting to exploit information gained by tests applied earlier. It considers the program s ....

....This has the advantage of reducing testing effort while preserving testing effectiveness. Another approach to increasing test effectiveness and efficiency is to reduce the number of tests required by limiting the number of combinations of tests to be considered. Orthogonal latin squares [15] and combinatorial design [3] are among the approaches that have been discussed in the literature. Recently, Malaiya [13] introduced the concept of antirandom testing for black box testing. It is based on the view that testing is both effective and efficient if the next test in the sequence is ....

R. Mandl, "Orthogonal Latin Squares: An application of experiment design to compiler testing," Comm. ACM, Oct. 1985, pp. 1054-1058.

....of polymorphic substitution for the parts of a class is tested, a representative group is covered such that every concrete class is instantiated in some test case, and every edge is covered in a traversal history. Orthogonal latin squares can be used to avoid ad hoc test case development [14, 15]. An example set of test objects for minimal customizer coverage of the Scheme expression class graph is shown in figure 7. Every concrete class in the traversal dependence graph is covered, as is every subclass and construction edge. This is a very weak type of coverage, as many errors will only ....

....dependency graph. Their approach does not discuss regression testing changes to class structure and the impact on existing behavior, and does not discuss maintenance of object structure in test cases. McDaniel and McGregor [15] describe an approach to testing coverage using orthogonal arrays [14] to avoid exhaustive testing of polymorphic substitutions. Regression testing and class evolution are not discussed. 6 Concluding Remarks The concept of reuse must extend beyond program implementation and into the testing process. Class evolution has significant impact on maintenance and testing. ....

Robert Mandl. Orthogonal latin squares: An application of experimental design to compiler testing. Communications of the ACM, 28(10):1054--1058, October 1985.

No context found.

R. Mandl. Orthogonal latin squares an application of experiment design to compiler testing. Communications of the ACM, 28(10):1054-1058, 1985.

No context found.

R. Mandl. Orthogonal latin squares an application of experiment design to compiler testing. Communications of the ACM, 28(10):1054-1058, 1985.

No context found.

R. Mandl. Orthogonal latin squares an application of experiment design to compiler testing. Communications of the ACM, 28(10):1054-1058, 1985.

No context found.

Robert Mandl. Orthogonal Latin Squares : An Application of Experiment Design to Compiler Testing. Communications of the ACM, 28(10):1054--1058, October 1985.

No context found.

Mandl, R. (1980). "Orthogonal latin squares: An application of experimental design to compiler testing," Communications of the ACM, Vol. 28, No. 10, pp. 1054-1058.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC