Practical Combinatorial Testing: Beyond Pairwise
暂无分享,去创建一个
[1] D. Richard Kuhn,et al. Software fault interactions and implications for software testing , 2004, IEEE Transactions on Software Engineering.
[2] Charles J. Colbourn,et al. A density-based greedy algorithm for higher strength covering arrays , 2009 .
[3] Pedram Amini,et al. Fuzzing: Brute Force Vulnerability Discovery , 2007 .
[4] Jean-Louis Lanet,et al. A case study in JML-based software validation , 2004 .
[5] Charles J. Colbourn,et al. The density algorithm for pairwise interaction testing , 2007, Softw. Test. Verification Reliab..
[6] Myra B. Cohen,et al. Testing across configurations: implications for combinatorial testing , 2006, SOEN.
[7] Paul Ammann,et al. Abstracting formal specifications to generate software tests via model checking , 1999, Gateway to the New Millennium. 18th Digital Avionics Systems Conference. Proceedings (Cat. No.99CH37033).
[8] D. Richard Kuhn,et al. Pseudo-Exhaustive Testing for Software , 2006, 2006 30th Annual IEEE/NASA Software Engineering Workshop.
[9] K. Burr,et al. Combinatorial Test Techniques : Table-based Automation , Test Generation and Code Coverage , 1998 .
[10] Albert L. Baker,et al. JML: A Notation for Detailed Design , 1999, Behavioral Specifications of Businesses and Systems.