{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T03:40:17Z","timestamp":1769744417594,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031906596","type":"print"},{"value":"9783031906602","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":120,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>\n            <jats:sc>EmergenTheta<\/jats:sc> is our sandbox for experimental analyses. After its successful debut in SV-COMP\u201924, we kept some well-performing but still under-tested configurations, and complemented them with a new saturation algorithm over decision diagrams, and two ways of extending their verification power: wrapping them in a lightweight, counterexample-guided abstraction refinement (CEGAR) loop based on implicit predicate abstraction; and backwards traversal of the state space. All such analyses now rely on a common interface to the underlying symbolic transition system, integrating seamlessly into the existing <jats:sc>Theta<\/jats:sc> framework. Using this combination of proven analyses and novel extensions, <jats:sc>EmergenTheta<\/jats:sc> outperformed our expectations in SV-COMP\u201925.<\/jats:p>","DOI":"10.1007\/978-3-031-90660-2_15","type":"book-chapter","created":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T09:38:20Z","timestamp":1746005900000},"page":"217-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["EmergenTheta: Variations on Symbolic Transition Systems (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":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6551-5860","authenticated-orcid":false,"given":"Levente","family":"Bajczi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2912-028X","authenticated-orcid":false,"given":"D\u00e1niel","family":"Szekeres","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8204-7595","authenticated-orcid":false,"given":"Vince","family":"Moln\u00e1r","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","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. pp. 195\u2013208. Springer International Publishing, Cham (2021)","DOI":"10.1007\/978-3-030-81688-9_9"},{"key":"15_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 (2022). https:\/\/doi.org\/10.1145\/3524482.3527646","DOI":"10.1145\/3524482.3527646"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bajczi, L., Szekeres, D., Mondok, M., \u00c1d\u00e1m, Z., Somorjai, M., Telbisz, C., Dobos-Kov\u00e1cs, M., Moln\u00e1r, V.: EmergenTheta: Verification Beyond Abstraction Refinement (Competition Contribution). In: Finkbeiner, B., Kov\u00e1cs, L. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. pp. 371\u2013375. Springer Nature Switzerland, Cham (2024)","DOI":"10.1007\/978-3-031-57256-2_23"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Bajczi, L., Telbisz, C., Somorjai, M., \u00c1d\u00e1m, Z., Dobos-Kov\u00e1cs, M., Szekeres, D., Mondok, M., Moln\u00e1r, V.: EmergenTheta - SV-COMP\u201925 Verifier Archive (Nov 2024). https:\/\/doi.org\/10.5281\/zenodo.14194484","DOI":"10.5281\/zenodo.14194484"},{"key":"15_CR5","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-030-99524-9_24"},{"key":"15_CR6","unstructured":"Beyer, D., Strej\u010dek, J.: Improvements in software verification and witness validation: SV-COMP 2025. In: Proc. TACAS. LNCS, Springer (2025)"},{"key":"15_CR7","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"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic Model Checking without BDDs. In: TACAS (1999). https:\/\/doi.org\/10.1007\/3-540-49059-0_14","DOI":"10.1007\/3-540-49059-0_14"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Ciardo, G., L\u00fcttgen, G., Siminiceanu, R.: Saturation: An efficient iteration strategy for symbolic state\u2014space generation. In: Margaria, T., Yi, W. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. pp. 328\u2013342. Springer Berlin Heidelberg, Berlin, Heidelberg (2001)","DOI":"10.1007\/3-540-45319-9_23"},{"key":"15_CR10","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":"15_CR11","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":"15_CR12","doi-asserted-by":"publisher","unstructured":"Hajdu, \u00c1., Micskei, Z.: Efficient Strategies for CEGAR-based Model Checking. Journal of Automated Reasoning 64(6), 1051\u20131091 (2020). https:\/\/doi.org\/10.1007\/s10817-019-09535-x","DOI":"10.1007\/s10817-019-09535-x"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"McMillan, K.L.: Interpolation and SAT-Based Model Checking. In: Hunt, W.A., Somenzi, F. (eds.) Computer Aided Verification (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_1","DOI":"10.1007\/978-3-540-45069-6_1"},{"key":"15_CR14","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-030-21571-2_19"},{"key":"15_CR15","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":"15_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":"15_CR17","doi-asserted-by":"publisher","unstructured":"Sheeran, M., Singh, S., St\u00e5lmarck, G.: Checking Safety Properties Using Induction and a SAT-Solver. In: Formal Methods in Computer-Aided Design (2000). https:\/\/doi.org\/10.1007\/3-540-40922-X_8","DOI":"10.1007\/3-540-40922-X_8"},{"key":"15_CR18","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-642-05089-3_7"}],"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-031-90660-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T09:38:25Z","timestamp":1746005905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90660-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031906596","9783031906602"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90660-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 May 2025","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":"Hamilton, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"3 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2025\/conferences\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}