{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T21:18:24Z","timestamp":1758057504789,"version":"3.44.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032051875","type":"print"},{"value":"9783032051882","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T00:00:00Z","timestamp":1757980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T00:00:00Z","timestamp":1757980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-05188-2_2","type":"book-chapter","created":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T21:52:40Z","timestamp":1757973160000},"page":"16-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Loop Unrolling: Formal Definition and\u00a0Application to\u00a0Testing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3531-4045","authenticated-orcid":false,"given":"Li","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5985-7434","authenticated-orcid":false,"given":"Bertrand","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9262-4843","authenticated-orcid":false,"given":"Reto","family":"Weber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,16]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Ammann, P., Offutt, J., Huang, H.: Coverage criteria for logical expressions. In: 14th International Symposium on Software Reliability Engineering, 2003. ISSRE 2003, pp. 99\u2013107. IEEE (2003). https:\/\/doi.org\/10.5555\/951952.952378","DOI":"10.5555\/951952.952378"},{"key":"2_CR2","unstructured":"AutoProof. https:\/\/se.constructor.ch\/reif-site\/autoproof"},{"key":"2_CR3","unstructured":"AutoTest. https:\/\/www.eiffel.org\/doc\/eiffelstudio\/Using_AutoTest"},{"key":"2_CR4","unstructured":"Barrett, C., Stump, A., Tinelli, C., et\u00a0al.: The SMT-LIB standard: version 2.0. In: International Workshop on Satisfiability Modulo Theories, vol.\u00a013, p.\u00a014 (2010)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0065-2458(03)58003-2","volume":"58","author":"A Biere","year":"2003","unstructured":"Biere, A.: Bounded model checking. Adv. Comput. 58, 117\u2013148 (2003). https:\/\/doi.org\/10.1016\/S0065-2458(03)58003-2","journal-title":"Adv. Comput."},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Bormer, T.: The COST IC0701 verification competition 2011. In: Beckert, B., Damiani, F., Gurov, D. (eds.) FoVeOOS 2011. LNCS, vol. 7421, pp. 3\u201321. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31762-0_2","DOI":"10.1007\/978-3-642-31762-0_2"},{"key":"2_CR7","unstructured":"Brenguier, R., Cordeiro, L., Kroening, D., Schrammel, P.: JBMC: a bounded model checking tool for java bytecode. arXiv:2302.02381 (2023)"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Chekam, T.T., Papadakis, M., Le\u00a0Traon, Y., Harman, M.: An empirical study on mutation, statement and branch coverage fault revelation that avoids the unreliable clean program assumption. In: 2017 IEEE\/ACM 39th International Conference on Software Engineering (ICSE), pp. 597\u2013608. IEEE (2017). https:\/\/doi.org\/10.1109\/ICSE.2017.61","DOI":"10.1109\/ICSE.2017.61"},{"key":"2_CR9","volume-title":"Principles of Abstract Interpretation","author":"P Cousot","year":"2021","unstructured":"Cousot, P.: Principles of Abstract Interpretation. MIT Press, Cambridge (2021)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"2_CR11","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice Hall, Upper Saddle River (1976)"},{"issue":"7","key":"2_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.1859","volume":"33","author":"L Huang","year":"2023","unstructured":"Huang, L., Meyer, B.: A failed proof can yield a useful test. Softw. Test. Verificat. Reliabil. 33(7), e1859 (2023). https:\/\/doi.org\/10.1002\/stvr.1859","journal-title":"Softw. Test. Verificat. Reliabil."},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Huang, L., Meyer, B., Oriol, M.: Improving counterexample quality from failed program verification. In: International Symposium on Software Reliability Engineering Workshops (ISSREW), pp. 268\u2013273. IEEE (2022). https:\/\/doi.org\/10.1109\/ISSREW55968.2022.00078","DOI":"10.1109\/ISSREW55968.2022.00078"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Huang, L., Meyer, B., Oriol, M.: Seeding contradiction: a fast method for generating full-coverage test suites. In: IFIP International Conference on Testing Software and Systems, pp. 52\u201370. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-43240-8_4","DOI":"10.1007\/978-3-031-43240-8_4"},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s42979-024-03482-0","volume":"6","author":"L Huang","year":"2025","unstructured":"Huang, L., Meyer, B., Oriol, M.: Seeding contradiction: a fast method for generating full-coverage test suites. SN Comput. Sci. 6(1), 1\u201316 (2025). https:\/\/doi.org\/10.1007\/s42979-024-03482-0","journal-title":"SN Comput. Sci."},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-22969-0_9","volume-title":"Software Engineering and Formal Methods","author":"S Huster","year":"2015","unstructured":"Huster, S., et al.: Efficient testing of different loop paths. In: Calinescu, R., Rumpe, B. (eds.) SEFM 2015. LNCS, vol. 9276, pp. 117\u2013131. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22969-0_9"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-21437-0_14","volume-title":"FM 2011: Formal Methods","author":"V Klebanov","year":"2011","unstructured":"Klebanov, V., et al.: The 1st verified software competition: experience report. In: Butler, M., Schulte, W. (eds.) FM 2011. LNCS, vol. 6664, pp. 154\u2013168. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21437-0_14"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-54862-8_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Kroening","year":"2014","unstructured":"Kroening, D., Tautschnig, M.: CBMC \u2013 C bounded model checker. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 389\u2013391. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_26"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-24690-6_28","volume-title":"Software Engineering and Formal Methods","author":"C Le Goues","year":"2011","unstructured":"Le Goues, C., Leino, K.R.M., Moskal, M.: The boogie verification debugger (tool paper). In: Barthe, G., Pardo, A., Schneider, G. (eds.) SEFM 2011. LNCS, vol. 7041, pp. 407\u2013414. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24690-6_28"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-17511-4_20","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"KRM Leino","year":"2010","unstructured":"Leino, K.R.M.: Dafny: an automatic program verifier for functional correctness. In: Clarke, E.M., Voronkov, A. (eds.) LPAR 2010. LNCS (LNAI), vol. 6355, pp. 348\u2013370. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17511-4_20"},{"key":"2_CR21","unstructured":"Test generation with loop unrolling, Gituhub repository with supplementary material including detailed performance results and machine-checked proofs. http:\/\/github.com\/cit-se-testing\/loop_unrolling"},{"key":"2_CR22","unstructured":"Meyer, B.: Introduction to the theory of programming languages. Prentice-Hall (1990), publicly available version (updated 2023). https:\/\/bertrandmeyer.com\/ITPL"},{"key":"2_CR23","unstructured":"Meyer, B.: Object-Oriented Software Construction, 2nd edn. (1997)"},{"issue":"8","key":"2_CR24","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/MC.2008.306","volume":"41","author":"B Meyer","year":"2008","unstructured":"Meyer, B.: Seven principles of software testing. Computer 41(8), 99\u2013101 (2008). https:\/\/doi.org\/10.1109\/MC.2008.306","journal-title":"Computer"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Meyer, B.: Theory of Programs, pp. 159\u2013189. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-28406-4_6. https:\/\/se.inf.ethz.ch\/~meyer\/publications\/proofs\/top.pdf","DOI":"10.1007\/978-3-319-28406-4_6"},{"key":"2_CR26","unstructured":"Meyer, B.: Touch of Class: Learning to Program Well with Objects and Contracts. Springer, Heidelberg (2016)"},{"key":"2_CR27","unstructured":"Meyer, B.: A formal definition of loop unrolling with applications to test coverage. arXiv (2024). https:\/\/arxiv.org\/abs\/2403.08923"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Nilizadeh, A., Calvo, M., Leavens, G.T., Cok, D.R.: Generating counterexamples in the form of unit tests from hoare-style verification attempts. In: International Conference on Formal Methods in Software Engineering (FormaliSE), pp. 124\u2013128. IEEE (2022). https:\/\/doi.org\/10.1145\/3524482.3527656","DOI":"10.1145\/3524482.3527656"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"Nilizadeh, A., Leavens, G.T., P\u0103s\u0103reanu, C.S., Le, X.B.D., Cok, D.R.: Does going beyond branch coverage make program repair tools more reliable? In: 2024 IEEE Conference on Software Testing, Verification and Validation (ICST), pp. 281\u2013292. IEEE (2024). https:\/\/doi.org\/10.1109\/ICST60714.2024.00033","DOI":"10.1109\/ICST60714.2024.00033"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C.: Isabelle\/HOL: A Proof Assistant for Higherorder Logic. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45949-9D","DOI":"10.1007\/3-540-45949-9"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-319-19249-9_26","volume-title":"FM 2015: Formal Methods","author":"N Polikarpova","year":"2015","unstructured":"Polikarpova, N., Tschannen, J., Furia, C.A.: A fully verified container library. In: Bj\u00f8rner, N., de Boer, F. (eds.) FM 2015. LNCS, vol. 9109, pp. 414\u2013434. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19249-9_26"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Stoy, J.E.: Foundations of denotational semantics. In: Bj\u00f8orner, D. (ed.) Abstract Software Specifications, pp. 43\u201399. Springer, Heidelberg (1980)","DOI":"10.1007\/3-540-10007-5_35"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-54108-7_8","volume-title":"Verified Software: Theories, Tools, Experiments","author":"J Tschannen","year":"2014","unstructured":"Tschannen, J., Furia, C.A., Nordio, M., Meyer, B.: Program checking with less hassle. In: Cohen, E., Rybalchenko, A. (eds.) VSTTE 2013. LNCS, vol. 8164, pp. 149\u2013169. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54108-7_8"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Wei, Y., Meyer, B., Oriol, M.: Is Branch Coverage a Good Measure of Testing Effectiveness?, pp. 194\u2013212. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-25231-0_5. https:\/\/se.inf.ethz.ch\/~meyer\/publications\/testing\/coverage.pdf","DOI":"10.1007\/978-3-642-25231-0_5"},{"key":"2_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-87873-5_10","volume-title":"Verified Software: Theories, Tools, Experiments","author":"BW Weide","year":"2008","unstructured":"Weide, B.W., et al.: Incremental benchmarks for software verification tools and techniques. In: Shankar, N., Woodcock, J. (eds.) VSTTE 2008. LNCS, vol. 5295, pp. 84\u201398. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87873-5_10"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Williams, N.: Towards exhaustive branch coverage with PathCrawler. In: International Conference on Automation of Software Tests (AST), pp. 117\u2013120. IEEE (2021). https:\/\/doi.org\/10.1109\/AST52587.2021.00022","DOI":"10.1109\/AST52587.2021.00022"},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11408901_21","volume-title":"Dependable Computing - EDCC 5","author":"N Williams","year":"2005","unstructured":"Williams, N., Marre, B., Mouy, P., Roger, M.: PathCrawler: automatic generation of path tests by combining static and dynamic analysis. In: Dal Cin, M., Ka\u00e2niche, M., Pataricza, A. (eds.) EDCC 2005. LNCS, vol. 3463, pp. 281\u2013292. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11408901_21"}],"container-title":["Lecture Notes in Computer Science","Testing Software and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05188-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T21:52:43Z","timestamp":1757973163000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05188-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,16]]},"ISBN":["9783032051875","9783032051882"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05188-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,16]]},"assertion":[{"value":"16 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Testing Software and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pts2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/ictss-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}