Author:
Wagner Michael,Kampel Ludwig,Simos Dimitris E.
Publisher
Springer International Publishing
Reference26 articles.
1. Ahmed, B.S., Zamli, K.Z., Lim, C.P.: Application of particle swarm optimization to uniform and variable strength covering array construction. Appl. Soft Comput. 12(4), 1330–1347 (2012)
2. Bryce, R.C., Colbourn, C.J.: A density-based greedy algorithm for higher strength covering arrays. Softw. Test. Verif. Reliab. 19(1), 37–53 (2009)
3. Bush, K.A., et al.: Orthogonal arrays of index unity. Ann. Math. Stat. 23(3), 426–434 (1952)
4. Cohen, D.M., Dalal, S.R., Fredman, M.L., Patton, G.C.: The AETG system: an approach to testing based on combinatorial design. IEEE Trans. Softw. Eng. 23(7), 437–444 (1997)
5. Colbourn, C.J.: Covering Array Tables for t = 2, 3, 4, 5, 6. http://www.public.asu.edu/~ccolbou/src/tabby/catable.html. Accessed 28 July 2020
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. State of the CArt: evaluating covering array generators at scale;International Journal on Software Tools for Technology Transfer;2024-05-06
2. Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions;SN Computer Science;2024-02-01
3. IPO-MAXSAT: The In-Parameter-Order Strategy combined with MaxSAT solving for Covering Array Generation;2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2022-09
4. Developing multithreaded techniques and improved constraint handling for the tool CAgen;2022 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW);2022-04