AETG
The AETG system: an approach to testing based on combinatorial design. This paper describes a new approach to testing that uses combinatorial designs to generate tests that cover the pairwise, triple, or n-way combinations of a system’s test parameters. These are the parameters that determine the system’s test scenarios. Examples are system configuration parameters, user inputs and other external events. We implemented this new method in the AETG system. The AETG system uses new combinatorial algorithms to generate test sets that cover all valid n-way parameter combinations. The size of an AETG test set grows logarithmically in the number of test parameters. This allows testers to define test models with dozens of parameters. The AETG system is used in a variety of applications for unit, system, and interoperability testing. It has generated both high-level test plans and detailed test cases. In several applications, it greatly reduced the cost of test plan development.
Keywords for this software
References in zbMATH (referenced in 59 articles )
Showing results 1 to 20 of 59.
Sorted by year (- Akhtar, Yasmeen; Phoa, Frederick Kin Hing: Cost-efficient mixed-level covering designs for testing experiments (2020)
- Kampel, Ludwig; Leithner, Manuel; Simos, Dimitris E.: Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm (2020)
- Kampel, Ludwig; Leithner, Manuel; Garn, Bernhard; Simos, Dimitris E.: Problems and algorithms for covering arrays via set covers (2019)
- Kampel, Ludwig; Simos, Dimitris E.: A survey on the problems and algorithms for covering arrays via set covers (2019)
- Colbourn, Charles J.; Lanus, Erin; Sarkar, Kaushik: Asymptotic and constructive methods for covering perfect hash families and covering arrays (2018)
- Colbourn, Charles J.; Syrotiuk, Violet R.: On a combinatorial framework for fault characterization (2018)
- Kampel, Ludwig; Garn, Bernhard; Simos, Dimitris E.: Covering arrays via set covers (2018)
- Kleine, Kristoffer; Simos, Dimitris E.: An efficient design and implementation of the in-parameter-order algorithm (2018)
- Maity, Soumen; Akhtar, Yasmeen; Chandrasekharan, Reshma C.; Colbourn, Charles J.: Improved strength four covering arrays with three symbols (2018)
- Akhtar, Yasmeen; Maity, Soumen: Mixed covering arrays on 3-uniform hypergraphs (2017)
- Akhtar, Yasmeen; Maity, Soumen: Covering arrays on product graphs (2017)
- Garn, Bernhard; Simos, Dimitris E.: Algebraic modelling of covering arrays (2017)
- Demirkale, Fatih; Donovan, Diane; Hall, Joanne; Khodkar, Abdollah; Rao, Asha: Difference covering arrays and pseudo-orthogonal Latin squares (2016)
- Akhtar, Yasmeen; Maity, Soumen; Chandrasekharan, Reshma C.: Covering arrays of strength four and software testing (2015)
- Chodoriwsky, Jacob; Moura, Lucia: An adaptive algorithm for group testing for complexes (2015)
- Rodriguez-Tello, Eduardo; Romero-Monsivais, Hillel; Ramirez-Torres, Gabriel; Lardeux, Frédéric: Tabu search for the cyclic bandwidth problem (2015)
- Petukhov, A. A.: Mixed optimization combinatorial method for constructing covering arrays (2014)
- Nayeri, Peyman; Colbourn, Charles J.; Konjevod, Goran: Randomized post-optimization of covering arrays (2013)
- Choi, Soohak; Kim, Hyun Kwang; Oh, Dong Yeol: Structures and lower bounds for binary covering arrays (2012)
- Colbourn, Charles J.; Zhou, Junling: Improving two recursive constructions for covering arrays (2012)