{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T14:05:42Z","timestamp":1776261942223,"version":"3.50.1"},"publisher-location":"Cham","reference-count":49,"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]]},"DOI":"10.1007\/978-3-032-22749-2_19","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T13:13:03Z","timestamp":1776258783000},"page":"373-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting Stateful Partial-Order Reduction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1029-2356","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Herbreteau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-4222-2858","authenticated-orcid":false,"given":"G\u00e9rald","family":"Point","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2713-7643","authenticated-orcid":false,"given":"Gautham","family":"Viswanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8952-7201","authenticated-orcid":false,"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,15]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Parosh\u00a0Aziz Abdulla, Stavros Aronis, Bengt Jonsson, and Konstantinos Sagonas. Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction. Journal of the ACM, 64(4):1\u201349, 2017.","DOI":"10.1145\/3073408"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Parosh\u00a0Aziz Abdulla, Mohamed\u00a0Faouzi Atig, Frederik\u00a0Meyer B\u00f8nneland, Sarbojit Das, Bengt Jonsson, Magnus Lang, and Konstantinos Sagonas. Tailoring Stateless Model Checking for\u00a0Event-Driven Multi-threaded Programs. In \u00c9tienne Andr\u00e9 and Jun Sun, editors, Automated Technology for Verification and Analysis, pages 176\u2013198. Springer Nature Switzerland, 2023.","DOI":"10.1007\/978-3-031-45332-8_9"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Parosh\u00a0Aziz Abdulla, Mohamed\u00a0Faouzi Atig, Sarbojit Das, Bengt Jonsson, and Konstantinos Sagonas. Parsimonious optimal dynamic partial order reduction. In Arie Gurfinkel and Vijay Ganesh, editors, Computer Aided Verification - 36th International Conference, CAV 2024, Montreal, QC, Canada, July 24-27, 2024, Proceedings, Part II, volume 14682 of Lecture Notes in Computer Science, pages 19\u201343. Springer, 2024.","DOI":"10.1007\/978-3-031-65630-9_2"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Parosh\u00a0Aziz Abdulla, Mohamed\u00a0Faouzi Atig, Bengt Jonsson, Magnus Lang, Tuan\u00a0Phong Ngo, and Konstantinos Sagonas. Optimal stateless model checking for reads-from equivalence under sequential consistency. Proceedings of the ACM on Programming Languages, 3(OOPSLA):1\u201329, 2019.","DOI":"10.1145\/3360576"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Pratyush Agarwal, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. Stateless Model Checking Under a Reads-Value-From Equivalence. In Alexandra Silva and K.\u00a0Rustan\u00a0M. Leino, editors, Computer Aided Verification, volume 12759, pages 341\u2013366. Springer International Publishing, 2021.","DOI":"10.1007\/978-3-030-81685-8_16"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Elvira Albert, Maria\u00a0Garcia de la Banda, Miguel G\u00f3mez-Zamalloa, Miguel Isabel, and Peter Stuckey. Optimal dynamic partial order reduction with context-sensitive independence and observers. Journal of Systems and Software, 202:111730, 2023.","DOI":"10.1016\/j.jss.2023.111730"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"D.\u00a0L. Black, R.\u00a0F. Rashid, D.\u00a0B. Golub, and C.\u00a0R. Hill. Translation lookaside buffer consistency: A software approach. SIGARCH Comput. Archit. News, 17(2):113\u2013122, 1989.","DOI":"10.1145\/68182.68193"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Marc Brooker and Ankush Desai. Systems Correctness Practices at Amazon Web Services. Communications of the ACM, 2025.","DOI":"10.1145\/3729175"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Roberto Cavada, Alessandro Cimatti, Michele Dorigatti, Alberto Griggio, Alessandro Mariotti, Andrea Micheli, Sergio Mover, Marco Roveri, and Stefano Tonetta. The nuxmv symbolic model checker. In Armin Biere and Roderick Bloem, editors, CAV, volume 8559 of Lecture Notes in Computer Science, pages 334\u2013342. Springer, 2014.","DOI":"10.1007\/978-3-319-08867-9_22"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Marek Chalupa, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages, 2(POPL):1\u201330, 2018.","DOI":"10.1145\/3158119"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Berk Cirisci, Constantin Enea, Azadeh Farzan, and Suha\u00a0Orhun Mutluergil. A Pragmatic Approach to Stateful Partial Order Reduction. In Cezara Dragoi, Michael Emmi, and Jingbo Wang, editors, Verification, Model Checking, and Abstract Interpretation, volume 13881, pages 129\u2013154. Springer Nature Switzerland, 2023.","DOI":"10.1007\/978-3-031-24950-1_7"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Camille Coti, Laure Petrucci, C\u00e9sar Rodr\u00edguez, and Marcelo Sousa. Quasi-optimal partial order reduction. Formal Methods in System Design, 57(1):3\u201333, 2021.","DOI":"10.1007\/s10703-020-00350-4"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Frank\u00a0S. De\u00a0Boer, Marcello Bonsangue, Einar\u00a0Broch Johnsen, Violet Ka\u00a0I Pun, S.\u00a0Lizeth Tapia\u00a0Tarifa, and Lars Tveito. SymPaths: Symbolic Execution Meets Partial Order Reduction. In Wolfgang Ahrendt, Bernhard Beckert, Richard Bubel, Reiner H\u00e4hnle, and Mattias Ulbrich, editors, Deductive Software Verification: Future Perspectives, volume 12345, pages 313\u2013338. Springer International Publishing, 2020.","DOI":"10.1007\/978-3-030-64354-6_13"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Mathieu Desnoyers, Paul\u00a0E. McKenney, Alan\u00a0S. Stern, Michel\u00a0R. Dagenais, and Jonathan Walpole. User-level implementations of read-copy update. IEEE Trans. Parallel Distributed Syst., 23(2):375\u2013382, 2012.","DOI":"10.1109\/TPDS.2011.159"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Azadeh Farzan. Commutativity in Automated Verification. In 2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pages 1\u20137. IEEE, 2023.","DOI":"10.1109\/LICS56636.2023.10175734"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Azadeh Farzan, Dominik Klumpp, and Andreas Podelski. Sound sequentialization for concurrent program verification. In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, pages 506\u2013521. ACM, 2022.","DOI":"10.1145\/3519939.3523727"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Azadeh Farzan, Dominik Klumpp, and Andreas Podelski. Stratified Commutativity in Verification Algorithms for Concurrent Programs. Proceedings of the ACM on Programming Languages, 7(POPL):1426\u20131453, 2023.","DOI":"10.1145\/3571242"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Cormac Flanagan and Patrice Godefroid. Dynamic Partial-Order Reduction for Model Checking Software. In POPL\u201905, 2005.","DOI":"10.1145\/1040305.1040315"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Natalia Gavrilenko, Hern\u00e1n Ponce-de-Le\u00f3n, Florian Furbach, Keijo Heljanko, and Roland Meyer. BMC for Weak Memory Models: Relation Analysis for Compact SMT Encodings. In Isil Dillig and Serdar Tasiran, editors, Computer Aided Verification, volume 11561, pages 355\u2013365. Springer International Publishing, 2019.","DOI":"10.1007\/978-3-030-25540-4_19"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Patrice Godefroid. Using partial orders to improve automatic verification methods. In Edmund\u00a0M. Clarke and Robert\u00a0P. Kurshan, editors, Computer-Aided Verification, pages 176\u2013185. Springer, 1991.","DOI":"10.1007\/BFb0023731"},{"key":"19_CR21","unstructured":"Patrice Godefroid. Partial-Order Methods for the Verification of Concurrent Systems An Approach to the State-Explosion Problem. PhD thesis, Universit\u00e9 de Li\u00e8ge, 1994."},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"R.\u00a0Govind, Fr\u00e9d\u00e9ric Herbreteau, Srivathsan, and Igor Walukiewicz. Abstractions for the local-time semantics of timed automata: A foundation for partial-order methods. In Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science, pages 1\u201314. ACM, 2022.","DOI":"10.1145\/3531130.3533343"},{"key":"19_CR23","unstructured":"Fr\u00e9d\u00e9ric Herbreteau, Sarah Larroze-Jardin\u00e9, and Igor Walukiewicz. Partial-order reduction is hard. In Patricia Bouyer and Jaco van\u00a0de Pol, editors, 36th International Conference on Concurrency Theory, CONCUR 2025, August 26-29, 2025, Aarhus, Denmark, volume 348 of LIPIcs, pages 22:1\u201322:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2025."},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Gerard\u00a0J. Holzmann. The model checker SPIN. IEEE Trans. Software Eng., 23(5):279\u2013295, 1997.","DOI":"10.1109\/32.588521"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Casper\u00a0S. Jensen, Anders Moller, Veselin Raychev, Dimitar Dimitrov, and Martin Vechev. Stateless model checking of event-driven applications. In Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2015, pages 57\u201373. Association for Computing Machinery, 2015.","DOI":"10.1145\/2814270.2814282"},{"key":"19_CR26","unstructured":"Bengt Jonsson, Magnus Lang, and Konstantinos Sagonas. Awaiting for Godot Stateless Model Checking that Avoids Executions where Nothing Happens. In {22nd }Formal Methods in Computer-Aided Design,  FMCAD  2022. IEEE, 2022."},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Vineet Kahlon, Chao Wang, and Aarti Gupta. Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique. In Ahmed Bouajjani and Oded Maler, editors, Computer Aided Verification, volume 5643, pages 398\u2013413. Springer Berlin Heidelberg, 2009.","DOI":"10.1007\/978-3-642-02658-4_31"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Shmuel Katz and Doron Peled. Verification of distributed programs using representative interleaving sequences. Distributed Computing, 6(2):107\u2013120, 1992.","DOI":"10.1007\/BF02252682"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Michalis Kokologiannakis, Rupak Majumdar, and Viktor Vafeiadis. Enhancing GenMC\u2019s Usability and Performance. In Bernd Finkbeiner and Laura Kov\u00e1cs, editors, Tools and Algorithms for the Construction and Analysis of Systems, pages 66\u201384. Springer Nature Switzerland, 2024.","DOI":"10.1007\/978-3-031-57249-4_4"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Michalis Kokologiannakis, Iason Marmanis, Vladimir Gladstein, and Viktor Vafeiadis. Truly stateless, optimal dynamic partial order reduction. Proceedings of the ACM on Programming Languages, 6(POPL):1\u201328, 2022.","DOI":"10.1145\/3498711"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Michalis Kokologiannakis, Iason Marmanis, and Viktor Vafeiadis. Unblocking Dynamic Partial Order Reduction. In Constantin Enea and Akash Lal, editors, Computer Aided Verification, volume 13964, pages 230\u2013250. Springer Nature Switzerland, 2023.","DOI":"10.1007\/978-3-031-37706-8_12"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Michalis Kokologiannakis, Azalea Raad, and Viktor Vafeiadis. Model checking for weakly consistent libraries. In Kathryn\u00a0S. McKinley and Kathleen Fisher, editors, Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, Phoenix, AZ, USA, June 22-26, 2019, pages 96\u2013110. ACM, 2019.","DOI":"10.1145\/3314221.3314609"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Leslie Lamport. A new solution of dijkstra\u2019s concurrent programming problem. Commun. ACM, 17(8):453\u2013455, 1974.","DOI":"10.1145\/361082.361093"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Pallavi Maiya, Rahul Gupta, Aditya Kanade, and Rupak Majumdar. Partial Order Reduction for Event-Driven Multi-threaded Programs. In Marsha Chechik and Jean-Fran\u00e7ois Raskin, editors, Tools and Algorithms for the Construction and Analysis of Systems, pages 680\u2013697. Springer, 2016.","DOI":"10.1007\/978-3-662-49674-9_44"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Burcu\u00a0Kulahcioglu Ozkan, Rupak Majumdar, and Simin Oraee. Trace aware random testing for distributed systems. Proceedings of the ACM on Programming Languages, 3(OOPSLA):1\u201329, 2019.","DOI":"10.1145\/3360606"},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Doron Peled. Partial-order reduction. In Edmund\u00a0M. Clarke, Thomas\u00a0A. Henzinger, Helmut Veith, and Roderick Bloem, editors, Handbook of Model Checking, pages 173\u2013190. Springer, 2018.","DOI":"10.1007\/978-3-319-10575-8_6"},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"Gary\u00a0L. Peterson. Myths about the mutual exclusion problem. Inf. Process. Lett., 12(3):115\u2013116, 1981.","DOI":"10.1016\/0020-0190(81)90106-X"},{"key":"19_CR38","doi-asserted-by":"crossref","unstructured":"The\u00a0Anh Pham. Efficient State-Space Exploration for Asynchronous Distributed Programs: Adapting Unfolding-Based Dynamic Partial Order Reduction to MPI Programs. These de doctorat, Rennes, Ecole normale superieure, 2019.","DOI":"10.1007\/978-3-030-21759-4_13"},{"key":"19_CR39","doi-asserted-by":"crossref","unstructured":"Maxwell Pirtle, Luka Jovanovic, and Gene Cooperman. McMini: A Programmable DPOR-Based Model Checker for Multithreaded Programs, 2023.","DOI":"10.22152\/programming-journal.org\/2024\/8\/1"},{"key":"19_CR40","unstructured":"C\u00e9sar Rodr\u00edguez, Marcelo Sousa, Subodh Sharma, and Daniel Kroening. Unfolding-based Partial Order Reduction. LIPIcs, Volume 42, CONCUR 2015, 42:456\u2013469, 2015."},{"key":"19_CR41","doi-asserted-by":"crossref","unstructured":"Boleslaw\u00a0K. Szymanski. A simple solution to lamport\u2019s concurrent programming problem with linear wait. In Jacques Lenfant, editor, Proceedings of the 2nd international conference on Supercomputing, ICS 1988, Saint Malo, France, July 4-8, 1988, pages 621\u2013626. ACM, 1988.","DOI":"10.1145\/55364.55425"},{"key":"19_CR42","doi-asserted-by":"crossref","unstructured":"Samira Tasharofi, Rajesh\u00a0K. Karmani, Steven Lauterburg, Axel Legay, Darko Marinov, and Gul Agha. TransDPOR: A Novel Dynamic Partial-Order Reduction Technique for Testing Actor Programs. In Holger Giese and Grigore Rosu, editors, Formal Techniques for Distributed Systems, pages 219\u2013234. Springer, 2012.","DOI":"10.1007\/978-3-642-30793-5_14"},{"key":"19_CR43","doi-asserted-by":"crossref","unstructured":"Rahmadi Trimananda, Weiyu Luo, Brian Demsky, and Guoqing\u00a0Harry Xu. Stateful Dynamic Partial Order Reduction for Model Checking Event-Driven Applications that Do Not Terminate, 2021.","DOI":"10.1007\/978-3-030-94583-1_20"},{"key":"19_CR44","doi-asserted-by":"crossref","unstructured":"Antti Valmari. Stubborn sets for reduced state space generation. In G.\u00a0Goos, J.\u00a0Hartmanis, D.\u00a0Barstow, W.\u00a0Brauer, P.\u00a0Brinch\u00a0Hansen, D.\u00a0Gries, D.\u00a0Luckham, C.\u00a0Moler, A.\u00a0Pnueli, G.\u00a0Seegm\u00fcller, J.\u00a0Stoer, N.\u00a0Wirth, and Grzegorz Rozenberg, editors, Advances in Petri Nets 1990, volume 483, pages 491\u2013515. Springer Berlin Heidelberg, 1991.","DOI":"10.1007\/3-540-53863-1_36"},{"key":"19_CR45","unstructured":"Antti Valmari. A state space tool for concurrent system models expressed in C++. In Jyrki Nummenmaa, Outi Sievi-Korte, and Erkki M\u00e4kinen, editors, Proceedings of the 14th Symposium on Programming Languages and Software Tools (SPLST\u201915), Tampere, Finland, October 9-10, 2015, volume 1525 of CEUR Workshop Proceedings, pages 91\u2013105. CEUR-WS.org, 2015."},{"key":"19_CR46","doi-asserted-by":"crossref","unstructured":"Antti Valmari and Henri Hansen. Stubborn Set Intuition Explained. In Maciej Koutny, Jetty Kleijn, and Wojciech Penczek, editors, Transactions on Petri Nets and Other Models of Concurrency XII, volume 10470, pages 140\u2013165. Springer Berlin Heidelberg, 2017.","DOI":"10.1007\/978-3-662-55862-1_7"},{"key":"19_CR47","doi-asserted-by":"crossref","unstructured":"Bjorn Wachter, Daniel Kroening, and Joel Ouaknine. Verifying multi-threaded software with impact. In 2013 Formal Methods in Computer-Aided Design, pages 210\u2013217. IEEE, 2013.","DOI":"10.1109\/FMCAD.2013.6679412"},{"key":"19_CR48","doi-asserted-by":"crossref","unstructured":"Chao Wang, Zijiang Yang, Vineet Kahlon, and Aarti Gupta. Peephole Partial Order Reduction. In C.\u00a0R. Ramakrishnan and Jakob Rehof, editors, Tools and Algorithms for the Construction and Analysis of Systems, volume 4963, pages 382\u2013396. Springer Berlin Heidelberg, 2008.","DOI":"10.1007\/978-3-540-78800-3_29"},{"key":"19_CR49","doi-asserted-by":"crossref","unstructured":"Yu\u00a0Yang, Xiaofang Chen, Ganesh Gopalakrishnan, and Robert\u00a0M. Kirby. Efficient Stateful Dynamic Partial Order Reduction. In Klaus Havelund, Rupak Majumdar, and Jens Palsberg, editors, Model Checking Software, pages 288\u2013305. Springer, 2008.","DOI":"10.1007\/978-3-540-85114-1_20"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T13:13:17Z","timestamp":1776258797000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22749-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227485","9783032227492"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22749-2_19","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"}}]}}