{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:02:22Z","timestamp":1786978942425,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031656293","type":"print"},{"value":"9783031656309","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T00:00:00Z","timestamp":1721865600000},"content-version":"vor","delay-in-days":206,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>is an open-source tool for specifying transition systems in first-order logic and reasoning about them.  is particularly suitable for analyzing and verifying distributed algorithms.  implements key functionalities needed for safety verification and provides flexible interfaces that make it useful not only as a verification tool but also as a research platform for developing verification techniques, and in particular invariant inference algorithms. Moreover, the  input language is both simple and general, and the  repository includes several dozen benchmarks\u2014transition systems that model a wide range of distributed and concurrent algorithms.  has supported several recent research efforts that benefited from its development framework and benchmark set.<\/jats:p>","DOI":"10.1007\/978-3-031-65630-9_4","type":"book-chapter","created":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T18:01:56Z","timestamp":1721844116000},"page":"71-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["mypyvy: A Research Platform for\u00a0Verification of\u00a0Transition Systems in\u00a0First-Order Logic"],"prefix":"10.1007","author":[{"given":"James R.","family":"Wilcox","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yotam M. Y.","family":"Feldman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oded","family":"Padon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sharon","family":"Shoham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,25]]},"reference":[{"key":"4_CR1","unstructured":"Alloy 6 announcement (2021). https:\/\/alloytools.org\/alloy6.html. Accessed 03 Feb 2023"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-99524-9_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems - ETAPS 2022, Part I","author":"H Barbosa","year":"2022","unstructured":"Barbosa, H., et al.: cvc5: A versatile and industrial-strength SMT solver. In: Fisman, D., Rosu, G. (eds.) ETAPS 2022, Part I. LNCS, vol. 13243, pp. 415\u2013442. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_24"},{"key":"4_CR3","unstructured":"Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB standard: version 2.0. In: Gupta, A., Kroening, D. (eds.) Proceedings of the 8th International Workshop on Satisfiability Modulo Theories (Edinburgh, UK) (2010)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-030-25543-5_15","volume-title":"Computer Aided Verification","author":"I Berkovits","year":"2019","unstructured":"Berkovits, I., Lazi\u0107, M., Losa, G., Padon, O., Shoham, S.: Verification of threshold-based distributed algorithms by decomposition to decidable logics. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11562, pp. 245\u2013266. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_15"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-319-23534-9_2","volume-title":"Fields of Logic and Computation II","author":"N Bj\u00f8rner","year":"2015","unstructured":"Bj\u00f8rner, N., Gurfinkel, A., McMillan, K., Rybalchenko, A.: Horn clause solvers for program verification. In: Beklemishev, L.D., Blass, A., Dershowitz, N., Finkbeiner, B., Schulte, W. (eds.) Fields of Logic and Computation II. LNCS, vol. 9300, pp. 24\u201351. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23534-9_2"},{"key":"4_CR6","unstructured":"B\u00f6rger, E., St\u00e4rk, R.F.: Abstract State Machines. A Method for High-Level System Design and Analysis. Springer, Heidelberg (2003). http:\/\/www.springer.com\/computer\/swe\/book\/978-3-540-00702-9"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-18275-4_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"AR Bradley","year":"2011","unstructured":"Bradley, A.R.: SAT-based model checking without unrolling. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 70\u201387. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18275-4_7"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Brunel, J., Chemouil, D., Cunha, A., Macedo, N.: The electrum analyzer: model checking relational first-order temporal specifications. In: Huchard, M., K\u00e4stner, C., Fraser, G. (eds.) Proceedings of the 33rd ACM\/IEEE International Conference on Automated Software Engineering. ASE 2018, Montpellier, France, 3\u20137 September 2018, pp. 884\u2013887. ACM (2018). https:\/\/doi.org\/10.1145\/3238147.3240475","DOI":"10.1145\/3238147.3240475"},{"key":"4_CR9","unstructured":"Chajed, T.: Ivy to mypyvy translator (2023). https:\/\/github.com\/tchajed\/ivy-to-mypyvy"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-14808-8_3","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2010","author":"K Chaudhuri","year":"2010","unstructured":"Chaudhuri, K., Doligez, D., Lamport, L., Merz, S.: The TLA+ proof system: building a heterogeneous verification platform. In: Cavalcanti, A., Deharbe, D., Gaudel, M.-C., Woodcock, J. (eds.) ICTAC 2010. LNCS, vol. 6255, pp. 44\u201344. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14808-8_3"},{"key":"4_CR11","unstructured":"Cimatti, A., Griggio, A., Tonetta, S.: The VMT-LIB language and tools. CoRR abs\/2109.12821 (2021). https:\/\/arxiv.org\/abs\/2109.12821"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"De Angelis, E., Hari Govind, V.K.: CHC-COMP 2022: competition report. In: Hamilton, G.W., Kahsai, T., Proietti, M. (eds.) Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation. HCVS\/VPT@ETAPS 2022, and 10th International Workshop on Verification and Program TransformationMunich, Germany, 3 April 2022. EPTCS, vol.\u00a0373, pp. 44\u201362 (2022). https:\/\/doi.org\/10.4204\/EPTCS.373.5","DOI":"10.4204\/EPTCS.373.5"},{"key":"4_CR13","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":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-030-25543-5_23","volume-title":"Computer Aided Verification","author":"YMY Feldman","year":"2019","unstructured":"Feldman, Y.M.Y., Wilcox, J.R., Shoham, S., Sagiv, M.: Inferring inductive invariants from phase structures. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11562, pp. 405\u2013425. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_23"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-030-76384-8_9","volume-title":"NASA Formal Methods","author":"A Goel","year":"2021","unstructured":"Goel, A., Sakallah, K.: On symmetry and quantification: a new approach to verify distributed protocols. In: Dutle, A., Moscato, M.M., Titolo, L., Mu\u00f1oz, C.A., Perez, I. (eds.) NFM 2021. LNCS, vol. 12673, pp. 131\u2013150. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76384-8_9"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Goel, A., Sakallah, K.A.: Towards an automatic proof of Lamport\u2019s paxos. In: Formal Methods in Computer Aided Design. FMCAD 2021, New Haven, CT, USA, 19\u201322 October 2021, pp. 112\u2013122. IEEE (2021). https:\/\/doi.org\/10.34727\/2021\/isbn.978-3-85448-046-4_20","DOI":"10.34727\/2021\/isbn.978-3-85448-046-4_20"},{"key":"4_CR17","unstructured":"Gurevich, Y.: Evolving Algebras 1993: Lipari Guide, pp. 9\u201336. Oxford University Press, Specification and Vgalidation Methods edn. (1995). https:\/\/arxiv.org\/pdf\/1808.06255.pdf"},{"key":"4_CR18","unstructured":"Hance, T., Heule, M., Martins, R., Parno, B.: Finding invariants of distributed systems: it\u2019s a small (enough) world after all. In: Mickens, J., Teixeira, R. (eds.) 18th USENIX Symposium on Networked Systems Design and Implementation. NSDI 2021, 12\u201314 April 2021, pp. 115\u2013131. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/nsdi21\/presentation\/hance"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Hawblitzel, C., et al.: IronFleet: proving practical distributed systems correct. In: Proceedings of the 25th ACM Symposium on Operating Systems Principles\u00a0(SOSP), pp. 1\u201317. Monterey, CA (2015)","DOI":"10.1145\/2815400.2815428"},{"key":"4_CR20","unstructured":"Jackson, D.: Software Abstractions: Logic, Language, and Analysis. MIT Press, Cambridge (2012)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Karbyshev, A., Bj\u00f8rner, N., Itzhaky, S., Rinetzky, N., Shoham, S.: Property-directed inference of universal invariants or proving their absence. J. ACM 64(1), 7:1\u20137:33 (2017)","DOI":"10.1145\/3022187"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Koenig, J.R., Padon, O., Immerman, N., Aiken, A.: First-order quantified separators. In: Donaldson, A.F., Torlak, E. (eds.) Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI 2020, London, UK, 15\u201320 June 2020, pp. 703\u2013717. ACM (2020). https:\/\/doi.org\/10.1145\/3385412.3386018","DOI":"10.1145\/3385412.3386018"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-030-99524-9_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"JR Koenig","year":"2022","unstructured":"Koenig, J.R., Padon, O., Shoham, S., Aiken, A.: Inferring invariants with quantifier alternations: taming the search space explosion. In: TACAS 2022. LNCS, vol. 13243, pp. 338\u2013356. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_18"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Konnov, I., Kukovec, J., Tran, T.: TLA+ model checking made symbolic. Proc. ACM Program. Lang. 3(OOPSLA), 123:1\u2013123:30 (2019). https:\/\/doi.org\/10.1145\/3360549","DOI":"10.1145\/3360549"},{"issue":"2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"key":"4_CR26","unstructured":"Lamport, L.: Specifying Systems: The $$\\text{TLA}^+$$ Language and Tools for Hardware and Software Engineers. Addison-Wesley Professional, Boston (2002)"},{"key":"4_CR27","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":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-319-41528-4_20","volume-title":"Computer Aided Verification","author":"KRM Leino","year":"2016","unstructured":"Leino, K.R.M., Pit-Claudel, C.: Trigger selection strategies to stabilize program verifiers. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 361\u2013381. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_20"},{"key":"4_CR29","doi-asserted-by":"publisher","unstructured":"Macedo, N., Brunel, J., Chemouil, D., Cunha, A., Kuperberg, D.: Lightweight specification and analysis of dynamic systems with rich configurations. In: Zimmermann, T., Cleland-Huang, J., Su, Z. (eds.) Proceedings of the 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering. FSE 2016, Seattle, WA, USA, 13\u201318 November 2016, pp. 373\u2013383. ACM (2016). https:\/\/doi.org\/10.1145\/2950290.2950318","DOI":"10.1145\/2950290.2950318"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-030-53291-8_12","volume-title":"Computer Aided Verification","author":"KL McMillan","year":"2020","unstructured":"McMillan, K.L., Padon, O.: Ivy: a multi-modal verification tool for distributed algorithms. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020, Part II. LNCS, vol. 12225, pp. 190\u2013202. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_12"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Padon, O.: Deductive verification of distributed protocols in first-order logic. Ph.D. thesis, Tel Aviv University (2018)","DOI":"10.23919\/FMCAD.2018.8603010"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Padon, O., Losa, G., Sagiv, M., Shoham, S.: Paxos made EPR: decidable reasoning about distributed protocols. PACMPL 1(OOPSLA), 108:1\u2013108:31 (2017)","DOI":"10.1145\/3140568"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Padon, O., McMillan, K.L., Panda, A., Sagiv, M., Shoham, S.: Ivy: safety verification by interactive generalization. In: Proceedings of the 2016 ACM SIGPLAN Conference on Programming Language Design and Implementation\u00a0(PLDI), pp. 614\u2013630. Santa Barbara, CA (2016)","DOI":"10.1145\/2980983.2908118"},{"key":"4_CR34","doi-asserted-by":"publisher","unstructured":"Padon, O., Wilcox, J.R., Koenig, J.R., McMillan, K.L., Aiken, A.: Induction duality: Primal-dual search for invariants. Proc. ACM Program. Lang. 6(POPL), 1\u201329 (2022).https:\/\/doi.org\/10.1145\/3498712","DOI":"10.1145\/3498712"},{"issue":"4","key":"4_CR35","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10817-009-9161-6","volume":"44","author":"R Piskac","year":"2010","unstructured":"Piskac, R., de Moura, L.M., Bj\u00f8rner, N.S.: Deciding effectively propositional logic using DPLL and substitution sets. J. Autom. Reason. 44(4), 401\u2013424 (2010)","journal-title":"J. Autom. Reason."},{"key":"4_CR36","unstructured":"P\u00eerlea, G.: Translation from ivy to mypyvy (2024). https:\/\/github.com\/kenmcmil\/ivy\/pull\/76"},{"key":"4_CR37","doi-asserted-by":"publisher","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. Lond. Math. Soc. s2\u201330(1), 264\u2013286 (1930). https:\/\/doi.org\/10.1112\/plms\/s2-30.1.264, https:\/\/londmathsoc.onlinelibrary.wiley.com\/doi\/abs\/10.1112\/plms\/s2-30.1.264","DOI":"10.1112\/plms\/s2-30.1.264"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Taube, M., et al.: Modularity for decidability of deductive verification with applications to distributed systems. In: Proceedings of the 2018 ACM SIGPLAN Conference on Programming Language Design and Implementation\u00a0(PLDI). Philadelphia, PA (2018)","DOI":"10.1145\/3192366.3192414"},{"key":"4_CR39","doi-asserted-by":"publisher","unstructured":"Wilcox, J.R., Feldman, Y.M.Y., Padon, O., Shoham, S.: mypyvy: A Research Platform for Verification of Transition Systems in First-Order Logic (Artifact) (2024). https:\/\/doi.org\/10.5281\/zenodo.10948110","DOI":"10.5281\/zenodo.10948110"},{"key":"4_CR40","unstructured":"Yao, J., Tao, R., Gu, R., Nieh, J.: Duoai: fast, automated inference of inductive invariants for verifying distributed protocols. In: Aguilera, M.K., Weatherspoon, H. (eds.) 16th USENIX Symposium on Operating Systems Design and Implementation. OSDI 2022, Carlsbad, CA, USA, 11\u201313 July 2022, pp. 485\u2013501. USENIX Association (2022). https:\/\/www.usenix.org\/conference\/osdi22\/presentation\/yao"},{"key":"4_CR41","doi-asserted-by":"publisher","unstructured":"Yao, J., Tao, R., Gu, R., Nieh, J.: Mostly automated verification of liveness properties for distributed protocols with ranking functions. Proc. ACM Program. Lang. 8(POPL) (2024). https:\/\/doi.org\/10.1145\/3632877","DOI":"10.1145\/3632877"},{"key":"4_CR42","unstructured":"Yao, J., Tao, R., Gu, R., Nieh, J., Jana, S., Ryan, G.: Distai: data-driven automated invariant learning for distributed protocols. In: Brown, A.D., Lorch, J.R. (eds.) 15th USENIX Symposium on Operating Systems Design and Implementation. OSDI 2021, 14\u201316 July 2021, pp. 405\u2013421. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/osdi21\/presentation\/yao"},{"key":"4_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-48153-2_6","volume-title":"Correct Hardware Design and Verification Methods","author":"Y Yu","year":"1999","unstructured":"Yu, Y., Manolios, P., Lamport, L.: Model checking TLA+ specifications. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol. 1703, pp. 54\u201366. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48153-2_6"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-65630-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T18:02:54Z","timestamp":1721844174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-65630-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031656293","9783031656309"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-65630-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}