{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:52:58Z","timestamp":1742935978472,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031171956"},{"type":"electronic","value":"9783031171963"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17196-3_17","type":"book-chapter","created":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T22:03:09Z","timestamp":1663884189000},"page":"283-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["TestSelector: Automatic Test Suite Selection for\u00a0Student Projects"],"prefix":"10.1007","author":[{"given":"Filipe","family":"Marques","sequence":"first","affiliation":[]},{"given":"Ant\u00f3nio","family":"Morgado","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Fragoso Santos","sequence":"additional","affiliation":[]},{"given":"Mikol\u00e1\u0161","family":"Janota","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,23]]},"reference":[{"key":"17_CR1","unstructured":"Chen, Z., Zhang, X., Xu, B.: A degraded ILP approach for test suite reduction. In: Proceedings of the Twentieth International Conference on Software Engineering & Knowledge Engineering (SEKE), pp. 494\u2013499. Knowledge Systems Institute Graduate School (2008)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Cruciani, E., Miranda, B., Verdecchia, R., Bertolino, A.: Scalable approaches for test suite reduction. In: Proceedings of the 41st International Conference on Software Engineering, ICSE, pp. 419\u2013429. IEEE \/ ACM (2019)","DOI":"10.1109\/ICSE.2019.00055"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Davies, J., Bacchus, F.: Solving MaxSAT by solving a sequence of simpler SAT instances. In: Principles and Practice of Constraint Programming (2011)","DOI":"10.1007\/978-3-642-23786-7_19"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Davies, J., Bacchus, F.: Exploiting the power of MIP solvers in MaxSAT. In: Theory and Applications of Satisfiability Testing (2013)","DOI":"10.1007\/978-3-642-39071-5_13"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"De\u00a0Moura, L., Bj\u00f8rner, N.: Z3: An Efficient SMT Solver. In: Tools and Algorithms for the Construction and Analysis of Systems (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Compositional dynamic test generation. In: POPL, vol. 42, pp. 47\u201354 (2007)","DOI":"10.1145\/1190215.1190226"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: Dart: Directed automated random testing. In: ACM Sigplan Notices (2005)","DOI":"10.1145\/1065010.1065036"},{"key":"17_CR8","unstructured":"Godefroid, P., Levin, M.Y., Molnar, D.A.: Automated whitebox fuzz testing. In: NDSS (2008)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Nori, A.V., Rajamani, S.K., Tetali, S.: Compositional may-must program analysis: Unleashing the power of alternation. In: POPL (2010)","DOI":"10.1145\/1706299.1706307"},{"key":"17_CR10","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2022). https:\/\/www.gurobi.com"},{"issue":"2\u20133","key":"17_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10601-006-7094-9","volume":"11","author":"B Hnich","year":"2006","unstructured":"Hnich, B., Prestwich, S.D., Selensky, E., Smith, B.M.: Constraint models for the covering test problem. Constraints An Int. J. 11(2\u20133), 199\u2013219 (2006)","journal-title":"Constraints An Int. J."},{"key":"17_CR12","unstructured":"Janota, M., Morgado, A., Fragoso Santos, J., Manquinho, V.: The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets. In: Principles and Practice of Constraint Programming (2021)"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1109\/TSE.2003.1183927","volume":"29","author":"JA Jones","year":"2003","unstructured":"Jones, J.A., Harrold, M.J.: Test-suite reduction and prioritization for modified condition\/decision coverage. IEEE Trans. Software Eng. 29(3), 195\u2013209 (2003)","journal-title":"IEEE Trans. Software Eng."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-99130-6_9","volume-title":"Computer Safety, Reliability, and Security","author":"T Kitamura","year":"2018","unstructured":"Kitamura, T., Maissonneuve, Q., Choi, E.-H., Artho, C., Gargantini, A.: Optimal test suite generation for modified condition decision coverage using SAT solving. In: Gallina, B., Skavhaug, A., Bitsch, F. (eds.) SAFECOMP 2018. LNCS, vol. 11093, pp. 123\u2013138. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99130-6_9"},{"key":"17_CR15","unstructured":"Leal, J.P., Paiva, J.C., Correia, H.: Mooshak (2022). https:\/\/mooshak2.dcc.fc.up.pt"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Marques, F., Morgado, A., Santos, J.F., Janota, M.: TestSelector: automatic test suite selection for student projects - extended version (2022). https:\/\/doi.org\/10.48550\/ARXIV.2207.09509. https:\/\/arxiv.org\/abs\/2207.09509","DOI":"10.48550\/ARXIV.2207.09509"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Miranda, B., Cruciani, E., Verdecchia, R., Bertolino, A.: FAST approaches to scalable similarity-based test case prioritization. In: Proceedings of the 40th International Conference on Software Engineering, ICSE, pp. 222\u2013232. ACM (2018)","DOI":"10.1145\/3180155.3180210"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-22183-0_7","volume-title":"Search-Based Software Engineering","author":"JM Rojas","year":"2015","unstructured":"Rojas, J.M., Campos, J., Vivanti, M., Fraser, G., Arcuri, A.: Combining multiple coverage criteria in search-based unit test generation. In: Barros, M., Labiche, Y. (eds.) SSBSE 2015. LNCS, vol. 9275, pp. 93\u2013108. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22183-0_7"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Sen, K., Agha, G.: Cute and jcute: Concolic unit testing and explicit path model-checking tools. In: CAV, pp. 419\u2013423 (2006)","DOI":"10.1007\/11817963_38"},{"key":"17_CR20","unstructured":"Serra, P.: Pandora: Automatic Assessment Tool (AAT) (2022). https:\/\/saturn.ulusofona.pt"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Shi, A., Yung, T., Gyori, A., Marinov, D.: Comparing and combining test-suite reduction and regression test selection. In: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering, ESEC\/FSE, pp. 237\u2013247. ACM (2015)","DOI":"10.1145\/2786805.2786878"},{"key":"17_CR22","doi-asserted-by":"publisher","DOI":"10.15546\/aeei-2013-0050","volume-title":"Comparison of DC and MC\/DC code coverages","author":"Z Sz\u0169gyi","year":"2013","unstructured":"Sz\u0169gyi, Z., Porkol\u00e1b, Z.: Comparison of DC and MC\/DC code coverages. Research report, Acta Electrotechnica et Informatica (2013)"},{"key":"17_CR23","unstructured":"Wu, H., Nie, C., Petke, J., Jia, Y., Harman, M.: A survey of constrained combinatorial testing. CoRR abs\/1908.02480 (2019)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Yamada, A., Biere, A., Artho, C., Kitamura, T., Choi, E.: Greedy combinatorial test case generation using unsatisfiable cores. In: Proceedings of the 31st IEEE\/ACM International Conference on Automated Software Engineering, ASE, pp. 614\u2013624. ACM (2016)","DOI":"10.1145\/2970276.2970335"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Yamada, A., Kitamura, T., Artho, C., Choi, E., Oiwa, Y., Biere, A.: Optimization of combinatorial testing by incremental SAT solving. In: 8th IEEE International Conference on Software Testing, Verification and Validation, ICST, pp. 1\u201310. IEEE Computer Society (2015)","DOI":"10.1109\/ICST.2015.7102599"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Yoo, S., Harman, M.: Pareto efficient multi-objective test case selection. In: Proceedings of the ACM\/SIGSOFT International Symposium on Software Testing and Analysis, ISSTA, pp. 140\u2013150. ACM (2007)","DOI":"10.1145\/1273463.1273483"}],"container-title":["Lecture Notes in Computer Science","Runtime Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17196-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T14:06:29Z","timestamp":1672841189000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17196-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031171956","9783031171963"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17196-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Runtime Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilsi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rv2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rv22.gitlab.io","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}