The Constraint Programming Platform project will develop G12, a software platform for solving large-scale industrial combinatorial optimisation problems.
Software developers frequently encounter failures that occur only as the result of an interaction between two components. Failure triggering fault interactionsTesters often use pairwise testing – all pairs of parameter values – to detect such interactions. Combinatorial testing beyond pairwise is rarely used because good algorithms for higher strength combinations (e.g., 4-way or more) have not been available, but empirical evidence shows that some errors are triggered only by the interaction of three, four, or more parameters (see graph). These results have important implications for testing. If all faults in a system can be triggered by a combination of n or fewer parameters, then testing all n-way combinations of parameters can provide high confidence that nearly all faults have been discovered. We are producing methods and tools to generate tests for all n-way combinations of parameter values, using improved combinatorial testing algorithms for constructing covering arrays, and automated generation of test oracles using model checking.
S. Moro, M. Bacilieri, B. Cacciari, C. Bolcato, C. Cusan, G. Pastorin, K. Klotz, and G. Spalluto. Bioorg Med Chem, 14 (14):
4923-32(July 2006)Moro, Stefano Bacilieri, Magdalena Cacciari, Barbara Bolcato, Chiara
Cusan, Claudia Pastorin, Giorgia Klotz, Karl-Norbert Spalluto, Giampiero
In Vitro Research Support, Non-U.S. Gov't England Bioorganic & medicinal
chemistry Bioorg Med Chem. 2006 Jul 15;14(14):4923-32. Epub 2006
Mar 29..
M. Khouadjia, E. Alba, L. Jourdan, and E. Talbi. Swarm Intelligence, volume 6234 of Lecture Notes in Computer Science, Springer, Berlin / Heidelberg, (2010)
V. Vassilev, J. Miller, and T. Fogarty. Proceedings of the Congress on Evolutionary
Computation, 2, Mayflower Hotel, Washington D.C., USA, IEEE Press, (6-9 July 1999)
J. Hu, and E. Goodman. Proceedings of the 2004 IEEE Congress on Evolutionary
Computation, page 1178--1184. Portland, Oregon, IEEE Press, (20-23 June 2004)
L. Steels, and P. Wellens. Symbol Grounding and Beyond: Proceedings of the Third International Workshop on the Emergence and Evolution of Linguistic Communication, page 76-88. Springer, (2006)
M. Cohen, M. Dwyer, and J. Shi. ROSATEA '06: Proceedings of the ISSTA 2006 workshop on Role of software architecture for testing and analysis, page 53--63. New York, NY, USA, ACM, (2006)MR: Ünsere" OVM-Notation wird auf ein relationales Modell abgebildet, um damit Abdeckungskriterien für das Testen von SPL definieren zu können. Mit diesen Kriterien kann die Information gesammelt werden für sogenanntes 'cumulative variability coverage' mit dem gezielt die Testaufwände für neue Produkte der SPL festgelegt werden können. Das Ganze wird durch combinatorial interaction testing ermöglicht. Diese Technik (aus Einzelsystemen bekannt) reduziert die hohe Anzahl von möglichen Kombinationen von Input-Variablen auf wenige Repräsentanten.
Bei IST-SPL könnte man überlegen, diese Technik als Ergänzung einer anderen einzuführen, um höhere Abdeckungsraten zu erreichen.
Der Nachteil ist jedoch immer noch, dass hierbei keine Orakel erstellt werden. Hierfür verweisen die Spezialisten von Combinatorial Testing auf Model Checking beispielsweise..
M. Kotani, and D. Kato. Proceedings of the 2004 IEEE Congress on Evolutionary
Computation, page 614--619. Portland, Oregon, IEEE Press, (20-23 June 2004)
S. Bain, J. Thornton, and A. Sattar. Proceedings of the 2004 IEEE Congress on Evolutionary
Computation, page 265--272. Portland, Oregon, IEEE Press, (20-23 June 2004)
Y. Bernstein, X. Li, V. Ciesielski, and A. Song. Proceedings of the 2004 IEEE Congress on Evolutionary
Computation, page 83--89. Portland, Oregon, IEEE Press, (20-23 June 2004)
A. Agogino, K. Tumer, and R. Miikkulainen. GECCO'05: Proc. 7th Genetic and Evolutionary Computation Conf., page 1309--1316. Washington, DC, ACM Press, (2005)
M. Freedman. (2000)cite arxiv:math/0002124Comment: 11 pages. Published copy, also available at http://www.maths.warwick.ac.uk/gt/GTMon2/paper6.abs.html.
S. Mertens. (2000)cite arxiv:cond-mat/0012185Comment: references updated, reprint available from http://itp.nat.uni-magdeburg.de/~mertens/papers/complexity.shtml.
C. Banderier, P. Flajolet, D. Gardy, M. Bousquet-Melou, A. Denise, and D. Gouyou-Beauchamps. (2004)cite arxiv:math/0411250Comment: This article corresponds, up to minor typo corrections, to the article submitted to Discrete Mathematics (Elsevier) in Nov. 1999, and published in its vol. 246(1-3), March 2002, pp. 29-55.
N. Amersi, O. Beckwith, S. Miller, R. Ronan, and J. Sondow. (2011)cite arxiv:1108.0475Comment: 13 pages, 2 tables, to appear in the CANT 2011 Conference Proceedings. This is version 2.0. Changes: fixed typos, added references to OEIS sequences, and cited Shevelev's preprint.
I. Aitchison, and J. Rubinstein. (2000)cite arxiv:math/0008245Comment: 21 pages. Published copy, also available at http://www.maths.warwick.ac.uk/gt/GTMon2/paper1.abs.html . Includes erratum added to the original, published 22 November 1999.
O. Post. (2007)cite arxiv:0712.1507Comment: 24 pages, extended version of a lecture held at the EPF Lausanne, some references added and typos corrected.
C. Becchi. (1997)cite arxiv:hep-ph/9705211Comment: 28 pages, LateX, Lectures given at the Triangle Graduate School 96, Charles University, Prague September 2-11, 1996.
J. Valle. (2006)cite arxiv:hep-ph/0608101Comment: Review based on lectures at the Corfu Summer Institute on Elementary Particle Physics in September 2005. To be published in the Proceedings.
B. Ahmed, and K. Zamli. volume 0 of Proceedings of the Electrical and Electronic Postgraduate Colloquium EEPC2009, Jawi, Malaysia, USM, University Sains Malaysia, (November 2009)