{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:56Z","timestamp":1763468036519,"version":"3.40.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IIEEE Trans. Software Eng."],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1109\/tse.2011.85","type":"journal-article","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T15:45:03Z","timestamp":1314805503000},"page":"1088-1099","source":"Crossref","is-referenced-by-count":50,"title":["Formal Analysis of the Probability of Interaction Fault Detection Using Random Testing"],"prefix":"10.1109","volume":"38","author":[{"given":"Andrea","family":"Arcuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lionel","family":"Briand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16573-3_8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1831708.1831736"},{"key":"ref3","first-page":"180","article-title":"Pairwise Testing: A Best Practice That Isn\u2019t","volume-title":"Proc. 22nd Pacific Northwest Software Quality Conf.","author":"Bach"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-010-9171-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.10002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/52.536462"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2003.1251061"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2008.50"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2003.1201186"},{"article-title":"Covering Array Tables","year":"2009","author":"Colbourn","key":"ref10"},{"key":"ref11","first-page":"121","article-title":"Combinatorial Aspects of Covering Arrays","volume":"58","author":"Colbourn","year":"2004","journal-title":"Le Matematiche"},{"volume-title":"Introduction to Algorithms","year":"2001","author":"Cormen","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010257"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87698-4_5"},{"key":"ref15","volume-title":"An Introduction to Probability Theory and Its Applications","volume":"1","author":"Feller","year":"1968"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572294"},{"key":"ref17","first-page":"1","article-title":"Evaluating Improvements to a Meta-Heuristic Search for Constrained Interaction Testing","volume":"16","author":"Garvin","year":"2010","journal-title":"J. Empirical Software Eng."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300001905"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.319"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16573-3_6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2011.12"},{"key":"ref22","first-page":"14","article-title":"Random vs. Combinatorial Methods for Discrete Event Simulation of a Grid Computer Network","volume-title":"Proc. Mod Sim World","author":"Kuhn"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2004.24"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MITP.2008.54"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.381"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/HASE.1998.731623"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2010.74"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-99970-3"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1883612.1883618"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2010.43"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2008.44"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2006.08.001"},{"issue":"3","key":"ref34","first-page":"279","article-title":"Lower Bounds for Transversal Covers","volume-title":"Designs, Codes and Cryptography","volume":"15","author":"Stevens","year":"1998"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1183236.1183260"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/32.979992"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2006.8"}],"container-title":["IEEE Transactions on Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx5\/32\/6311391\/05999671.pdf?arnumber=5999671","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T06:00:03Z","timestamp":1742364003000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/ieeexplore.ieee.org\/document\/5999671\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":37,"journal-issue":{"issue":"5"},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/tse.2011.85","relation":{},"ISSN":["0098-5589"],"issn-type":[{"type":"print","value":"0098-5589"}],"subject":[],"published":{"date-parts":[[2012,9]]}}}