{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T07:46:15Z","timestamp":1772264775556,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T00:00:00Z","timestamp":1652832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001804","name":"Canada Research Chairs","doi-asserted-by":"publisher","award":["950-230760"],"award-info":[{"award-number":["950-230760"]}],"id":[{"id":"10.13039\/501100001804","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,18]]},"DOI":"10.1145\/3524482.3527659","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T22:06:57Z","timestamp":1658441217000},"page":"23-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Test suite generation for boolean conditions with equivalence class partitioning"],"prefix":"10.1145","author":[{"given":"Sylvain","family":"Hall\u00e9","sequence":"first","affiliation":[{"name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Chicoutimi, Chicoutimi, QC, Canada"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3133461"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570123"},{"key":"e_1_3_2_1_3_1","first-page":"1","volume-title":"VALID","author":"Bloem R.","year":"2013","unstructured":"R. Bloem , K. Greimel , R. Koenighofer , and F. Roeck . Model-based MCDC testing of complex decisions for the Java Card applet firewall . In VALID , pages 1 -- 6 . IARIA, 2013 . R. Bloem, K. Greimel, R. Koenighofer, and F. Roeck. Model-based MCDC testing of complex decisions for the Java Card applet firewall. In VALID, pages 1--6. IARIA, 2013."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2007.44"},{"key":"e_1_3_2_1_5_1","first-page":"338","volume-title":"SEEP","author":"Chen T.","year":"1998","unstructured":"T. Chen and M. Lau . An empirical study on the effectiveness of the greedy MUTP strategy . In SEEP , pages 338 -- 344 . IEEE, 1998 . T. Chen and M. Lau. An empirical study on the effectiveness of the greedy MUTP strategy. In SEEP, pages 338--344. IEEE, 1998."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/APSEC.1999.809656"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00135-4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1049\/sej.1994.0025"},{"key":"e_1_3_2_1_10_1","volume-title":"Parameterized Complexity Theory","author":"Flum J.","year":"2006","unstructured":"J. Flum and M. Grohe . Parameterized Complexity Theory . Springer , 2006 . J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"S.\n      Hall\u00e9 E. L.\n      Chance and \n      S.\n      Gaboury\n  . \n  Graph methods for generating test cases with universal and existential constraints\n  . In K. El-Fakih G. D. Barlas and N. Yevtushenko editors ICTSS volume \n  9447\n   of \n  LNCS pages \n  55\n  --\n  70\n  . \n  Springer 2015\n  .  S. Hall\u00e9 E. L. Chance and S. Gaboury. Graph methods for generating test cases with universal and existential constraints. In K. El-Fakih G. D. Barlas and N. Yevtushenko editors ICTSS volume 9447 of LNCS pages 55--70. Springer 2015.","DOI":"10.1007\/978-3-319-25945-1_4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2018.2876075"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.6377794"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700381097"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSA.2018.00027"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.442"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1405567.1405570"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/AUTEST.2015.7356490"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1077293.1077294"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"G.\n      Karakostas\n    .\n  A better approximation ratio for the vertex cover problem\n  . In L. Caires G. F. Italiano L. Monteiro C. Palamidessi and M. Yung editors ICALP volume \n  3580\n   of \n  LNCS pages \n  1043\n  --\n  1050\n  . \n  Springer 2005\n  .  G. Karakostas. A better approximation ratio for the vertex cover problem. In L. Caires G. F. Italiano L. Monteiro C. Palamidessi and M. Yung editors ICALP volume 3580 of LNCS pages 1043--1050. Springer 2005.","DOI":"10.1007\/11523468_84"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"T.\n      Kitamura Q.\n      Maissonneuve E.\n      Choi C.\n      Artho and \n      A.\n      Gargantini\n  . \n  Optimal test suite generation for modified condition decision coverage using SAT solving\n  . In B. Gallina A. Skavhaug and F. Bitsch editors SAFECOMP volume \n  11093\n   of \n  LNCS pages \n  123\n  --\n  138\n  . \n  Springer 2018\n  .  T. Kitamura Q. Maissonneuve E. Choi C. Artho and A. Gargantini. Optimal test suite generation for modified condition decision coverage using SAT solving. In B. Gallina A. Skavhaug and F. Bitsch editors SAFECOMP volume 11093 of LNCS pages 123--138. Springer 2018.","DOI":"10.1007\/978-3-319-99130-6_9"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2004.24"},{"key":"e_1_3_2_1_23_1","volume-title":"Accessed February 27th","author":"Kuhn R.","year":"2021","unstructured":"R. Kuhn . Automated combinatorial testing for software. https:\/\/csrc.nist.gov\/Projects\/automated-combinatorial-testing-for-software\/downloadable-tools , Accessed February 27th , 2021 . R. Kuhn. Automated combinatorial testing for software. https:\/\/csrc.nist.gov\/Projects\/automated-combinatorial-testing-for-software\/downloadable-tools, Accessed February 27th, 2021."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"M. F.\n      Lau\n     and \n      Y.\n      Yu\n  . \n  On comparing testing criteria for logical decisions\n  . In F. Kordon and Y. Kermarrec editors Ada-Europe volume \n  5570\n   of \n  LNCS pages \n  44\n  --\n  58\n  . \n  Springer 2009\n  .  M. F. Lau and Y. Yu. On comparing testing criteria for logical decisions. In F. Kordon and Y. Kermarrec editors Ada-Europe volume 5570 of LNCS pages 44--58. Springer 2009.","DOI":"10.1007\/978-3-642-01924-1_4"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECBS.2007.47"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88636-5_4"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1956.tb03835.x"},{"key":"e_1_3_2_1_28_1","volume-title":"Upper bounds for covering arrays by tabu search. Discrete applied mathematics, 138(1--2):143--152","author":"Nurmela K. J.","year":"2004","unstructured":"K. J. Nurmela . Upper bounds for covering arrays by tabu search. Discrete applied mathematics, 138(1--2):143--152 , 2004 . K. J. Nurmela. Upper bounds for covering arrays by tabu search. Discrete applied mathematics, 138(1--2):143--152, 2004."},{"key":"e_1_3_2_1_29_1","first-page":"1301","volume-title":"SAC","author":"Paul T. K.","year":"2014","unstructured":"T. K. Paul and M. F. Lau . A systematic literature review on modified condition and decision coverage. In Y. Cho, S. Y. Shin, S. Kim, C. Hung, and J. Hong, editors , SAC , pages 1301 -- 1308 . ACM, 2014 . T. K. Paul and M. F. Lau. A systematic literature review on modified condition and decision coverage. In Y. Cho, S. Y. Shin, S. Kim, C. Hung, and J. Hong, editors, SAC, pages 1301--1308. ACM, 2014."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1163514.1163534"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIT.2006.51"},{"key":"e_1_3_2_1_32_1","first-page":"926","volume-title":"ICS","author":"Sun C.-a.","year":"2004","unstructured":"C.-a. Sun , K. Y. Sim , T. Tse , and T. Chen . An Empirical Evaluation and Analysis of the Fault-Detection Capability of MUMCUT for General Boolean Expressions . In ICS , pages 926 -- 932 , 2004 . C.-a. Sun, K. Y. Sim, T. Tse, and T. Chen. An Empirical Evaluation and Analysis of the Fault-Detection Capability of MUMCUT for General Boolean Expressions. In ICS, pages 926--932, 2004."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.09.020"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSTW.2015.7107439"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-005-0084-7"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.286420"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2005.05.030"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2005.08.016"},{"key":"e_1_3_2_1_39_1","first-page":"254","volume-title":"HASE","author":"Lei Yu","year":"1998","unstructured":"Yu Lei and K. C. Tai . In-parameter-order: a test generation strategy for pairwise testing . In HASE , pages 254 -- 261 , Nov 1998 . Yu Lei and K. C. Tai. In-parameter-order: a test generation strategy for pairwise testing. In HASE, pages 254--261, Nov 1998."}],"event":{"name":"FormaliSE '22: International Conference on Formal Methods in Software Engineering","location":"Pittsburgh Pennsylvania","acronym":"FormaliSE '22","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"]},"container-title":["Proceedings of the IEEE\/ACM 10th International Conference on Formal Methods in Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3524482.3527659","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3524482.3527659","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:51Z","timestamp":1750183791000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3524482.3527659"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,18]]},"references-count":38,"alternative-id":["10.1145\/3524482.3527659","10.1145\/3524482"],"URL":"https:\/\/doi.org\/10.1145\/3524482.3527659","relation":{},"subject":[],"published":{"date-parts":[[2022,5,18]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}