{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:56:44Z","timestamp":1782867404707,"version":"3.54.5"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227485","type":"print"},{"value":"9783032227492","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    <jats:sc>EmergenTheta<\/jats:sc>\n                    is our sandbox for emerging analyses within the\n                    <jats:sc>Theta<\/jats:sc>\n                    framework. Previously established analyses have been migrated to\n                    <jats:sc>Theta<\/jats:sc>\n                    , and\n                    <jats:sc>EmergenTheta<\/jats:sc>\n                    focuses exclusively on novelties for both counterexample-guided abstraction refinement over control-flow automata and reachability analyses over symbolic transition systems. The 2026 submission presents a combined predicate\u2013explicit abstraction domain, multithreaded symbolic transition system encodings, on-the-fly reachability and counterexample generation for generalized saturation, and an IC3 backend. This is the first year that we were able to submit\n                    <jats:sc>EmergenTheta<\/jats:sc>\n                    to all categories, representing a significant step in the evolution of\n                    <jats:sc>Theta<\/jats:sc>\n                    , and the competition results indicate the practical viability of the new techniques.\n                  <\/jats:p>","DOI":"10.1007\/978-3-032-22749-2_25","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T13:10:22Z","timestamp":1776258622000},"page":"510-515","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["EmergenTheta: Experimental Analyses within the Theta Framework (Competition Contribution)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5396-2172","authenticated-orcid":false,"given":"Mil\u00e1n","family":"Mondok","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6260-5908","authenticated-orcid":false,"given":"Csan\u00e1d","family":"Telbisz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6551-5860","authenticated-orcid":false,"given":"Levente","family":"Bajczi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7687-5958","authenticated-orcid":false,"given":"D\u00e1niel","family":"Kov\u00e1cs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0064-2965","authenticated-orcid":false,"given":"Mih\u00e1ly","family":"Dobos-Kov\u00e1cs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8204-7595","authenticated-orcid":false,"given":"Vince","family":"Moln\u00e1r","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,15]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","unstructured":"Baier, D., Beyer, D., Friedberger, K.: JavaSMT 3: Interacting with SMT Solvers in Java. In: Silva, A., Leino, K.R.M. (eds.) Computer Aided Verification. Lecture Notes in Computer Science, vol. 12760, pp. 195\u2013208. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81688-9_9","DOI":"10.1007\/978-3-030-81688-9_9"},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Bajczi, L., \u00c1d\u00e1m, Z., Moln\u00e1r, V.: C for Yourself: Comparison of Front-End Techniques for Formal Verification. In: 10th FormaliSEICSE 2022. pp. 1\u201311. ACM (2022https:\/\/doi.org\/10.1145\/3524482.3527646","DOI":"10.1145\/3524482.3527646"},{"key":"25_CR3","doi-asserted-by":"publisher","unstructured":"Barbosa, H., Barrett, C., Brain, M., Kremer, G., Lachnitt, H., Mann, M., Mohamed, A., Mohamed, M., Niemetz, A., N\u00f6tzli, A., Ozdemir, A., Preiner, M., Reynolds, A., Sheng, Y., Tinelli, C., Zohar, Y.: cvc5: A Versatile and Industrial-Strength SMT Solver. In: Fisman, D., Rosu, G. (eds.) TACAS 2022. pp. 415\u2013442. Springer International Publishing, Cham (2022).https:\/\/doi.org\/10.1007\/978-3-030-99524-9_24","DOI":"10.1007\/978-3-030-99524-9_24"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Beyer, D., Strec\u0328jek, J.: Evaluating software verifiers for C, Java, and SV-LIB (report on SV-COMP 2026). In: Proc. TACAS\u00a0(2). LNCS\u00a016506, Springer (2026)","DOI":"10.1007\/978-3-032-22749-2_23"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Beyer, D., Jankola, M., Lingsch-Rosenfeld, M., Xia, T., Zheng, X.: A modular program-transformation framework for reducing specifications to reachability (2025), https:\/\/arxiv.org\/abs\/2501.16310","DOI":"10.1007\/978-3-032-06847-7_1"},{"key":"25_CR6","doi-asserted-by":"publisher","unstructured":"Biere, A., Artho, C., Schuppan, V.: Liveness checking as safety checking. In: FMICS 2002, ICALP 2002 Satellite Workshop (2002).https:\/\/doi.org\/10.1016\/S1571-0661(04)80410-9","DOI":"10.1016\/S1571-0661(04)80410-9"},{"key":"25_CR7","doi-asserted-by":"publisher","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic Model Checking without BDDs. In: TACAS (1999https:\/\/doi.org\/10.1007\/3-540-49059-0_14","DOI":"10.1007\/3-540-49059-0_14"},{"key":"25_CR8","doi-asserted-by":"publisher","unstructured":"Cimatti, A., Griggio, A., Schaafsma, B., Sebastiani, R.: The MathSAT5 SMT Solver. In: TACAS 2013, LNCS, vol.\u00a07795, pp. 93\u2013107. Springer (2013).https:\/\/doi.org\/10.1007\/978-3-642-36742-7_7","DOI":"10.1007\/978-3-642-36742-7_7"},{"key":"25_CR9","doi-asserted-by":"publisher","unstructured":"Dobos-Kov\u00e1cs, M., V\u00f6r\u00f6s, A.: Evaluation of SMT solvers in abstraction-based software model checking. In: Proceedings of the 11th Latin-American Symposium on Dependable Computing. p. 109\u2013116. LADC \u201922, Association for Computing Machinery, New York, NY, USA (2023).https:\/\/doi.org\/10.1145\/3569902.3570187","DOI":"10.1145\/3569902.3570187"},{"key":"25_CR10","unstructured":"Een, N., Mishchenko, A., Brayton, R.: Efficient implementation of property directed reachability. In: Proceedings of the International Conference on Formal Methods in Computer-Aided Design. p. 125\u2013134. FMCAD \u201911, FMCAD Inc, Austin, Texas (2011), https:\/\/dl.acm.org\/doi\/10.5555\/2157654.2157675"},{"issue":"6","key":"25_CR11","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/s10817-019-09535-x","volume":"64","author":"\u00c1 Hajdu","year":"2020","unstructured":"Hajdu, \u00c1., Micskei, Z.: Efficient Strategies for CEGAR-based Model Checking. J. Autom. Reason. 64(6), 1051\u20131091 (2020). https:\/\/doi.org\/10.1007\/s10817-019-09535-x","journal-title":"J. Autom. Reason."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-030-21571-2_19","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"V Moln\u00e1r","year":"2019","unstructured":"Moln\u00e1r, V., Majzik, I.: Saturation Enhanced with Conditional Locality: Application to Petri Nets. In: Donatelli, S., Haar, S. (eds.) Application and Theory of Petri Nets and Concurrency, pp. 342\u2013361. Springer International Publishing, Cham (2019)"},{"key":"25_CR13","unstructured":"Mondok, M.: Efficient formal verification of component-based engineering models. Master\u2019s thesis, Budapest University of Technology and Economics (2022)"},{"key":"25_CR14","doi-asserted-by":"publisher","unstructured":"Mondok, M., Moln\u00e1r, V.: Efficient Manipulation of Logical Formulas as Decision Diagrams. In: Renczes, B. (ed.) Proceedings of the 31st PhD Mini-Symposium. pp. 61\u201365. Budapest University of Technology and Economics, Department of Measurement and Information Systems (2024).https:\/\/doi.org\/10.3311\/MINISY2024-012","DOI":"10.3311\/MINISY2024-012"},{"key":"25_CR15","unstructured":"Mondok, M., V\u00f6r\u00f6s, A.: Abstraction-based model checking of linear temporal properties. In: Renczes, B. (ed.) Proceedings of the 27th PhD Mini-Symposium. pp. 29\u201332. Budapest University of Technology and Economics, Department of Measurement and Information Systems (2020)"},{"key":"25_CR16","doi-asserted-by":"publisher","unstructured":"de\u00a0Moura, L., Bj\u00f8rner, N.: Z3: An Efficient SMT Solver. In: TACAS 2008, LNCS, vol.\u00a04963, pp. 337\u2013340. Springer (2008).https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-05089-3_7","volume-title":"FM 2009: Formal Methods","author":"S Tonetta","year":"2009","unstructured":"Tonetta, S.: Abstract Model Checking without Computing the Abstraction. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009: Formal Methods, pp. 89\u2013105. Springer, Berlin Heidelberg, Berlin, Heidelberg (2009)"},{"key":"25_CR18","doi-asserted-by":"publisher","unstructured":"\u00c1d\u00e1m, Z., Bajczi, L., Dobos-Kov\u00e1cs, M., Moln\u00e1r, V., Mondok, M., Somorjai, M., Szekeres, D., Telbisz, C., Kov\u00e1cs, D., Rippl, B.R.: Emergentheta - verifier archive (2025). https:\/\/doi.org\/10.5281\/zenodo.17779912","DOI":"10.5281\/zenodo.17779912"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22749-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:18:47Z","timestamp":1782865127000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22749-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227485","9783032227492"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22749-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"15 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/about\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}