{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T02:28:24Z","timestamp":1784255304292,"version":"3.55.0"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030112448","type":"print"},{"value":"9783030112455","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-11245-5_22","type":"book-chapter","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T13:45:18Z","timestamp":1547127918000},"page":"468-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Termination of Nondeterministic Probabilistic Programs"],"prefix":"10.1007","author":[{"given":"Hongfei","family":"Fu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Krishnendu","family":"Chatterjee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"issue":"POPL","key":"22_CR1","first-page":"34:1","volume":"2","author":"S Agrawal","year":"2018","unstructured":"Agrawal, S., Chatterjee, K., Novotn\u00fd, P.: Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. PACMPL 2(POPL), 34:1\u201334:32 (2018)","journal-title":"PACMPL"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-319-90686-7_9","volume-title":"Functional and Logic Programming","author":"M Avanzini","year":"2018","unstructured":"Avanzini, M., Dal Lago, U., Yamada, A.: On probabilistic term rewriting. In: Gallagher, J.P., Sulzmann, M. (eds.) FLOPS 2018. LNCS, vol. 10818, pp. 132\u2013148. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90686-7_9"},{"key":"22_CR3","unstructured":"Avanzini, M., Lago, U.D., Yamada, A.: On probabilistic term rewriting. CoRR abs\/1802.09774 (2018). http:\/\/arxiv.org\/abs\/1802.09774"},{"key":"22_CR4","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"issue":"POPL","key":"22_CR5","first-page":"57:1","volume":"2","author":"G Barthe","year":"2018","unstructured":"Barthe, G., Espitau, T., Gr\u00e9goire, B., Hsu, J., Strub, P.: Proving expected sensitivity of probabilistic programs. PACMPL 2(POPL), 57:1\u201357:29 (2018)","journal-title":"PACMPL"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/3093333.3009896","volume":"52","author":"Gilles Barthe","year":"2017","unstructured":"Barthe, G., Gr\u00e9goire, B., Hsu, J., Strub, P.: Coupling proofs are probabilistic product programs. In: Castagna and Gordon [11], pp. 161\u2013174 (2017)","journal-title":"ACM SIGPLAN Notices"},{"key":"22_CR7","volume-title":"Probability and Measure","author":"P Billingsley","year":"1995","unstructured":"Billingsley, P.: Probability and Measure, 3rd edn. Wiley, Hoboken (1995)","edition":"3"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Bournez, O., Garnier, F.: Proving positive almost-sure termination. In: RTA, pp. 323\u2013337 (2005)","DOI":"10.1007\/978-3-540-32033-3_24"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Bradley, A.R., Manna, Z., Sipma, H.B.: Linear ranking with reachability. In: CAV, pp. 491\u2013504 (2005)","DOI":"10.1007\/11513988_48"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Bradley, A.R., Manna, Z., Sipma, H.B.: The polyranking principle. In: ICALP, pp. 1349\u20131361 (2005)","DOI":"10.1007\/11523468_109"},{"key":"22_CR11","unstructured":"Castagna, G., Gordon, A.D. (eds.): Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, 18\u201320 January 2017. ACM (2017)"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-642-39799-8_34","volume-title":"Computer Aided Verification","author":"Aleksandar Chakarov","year":"2013","unstructured":"Chakarov, A., Sankaranarayanan, S.: Probabilistic program analysis with martingales. In: CAV, pp. 511\u2013526 (2013)"},{"key":"22_CR13","unstructured":"Chatterjee, K., Fu, H.: Termination of nondeterministic recursive probabilistic programs. CoRR abs\/1701.02944 (2017). http:\/\/arxiv.org\/abs\/1701.02944"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Fu, H., Goharshady, A.K.: Termination analysis of probabilistic programs through Positivstellensatz\u2019s. In: CAV, pp. 3\u201322 (2016)","DOI":"10.1007\/978-3-319-41528-4_1"},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1145\/2914770.2837639","volume":"51","author":"Krishnendu Chatterjee","year":"2016","unstructured":"Chatterjee, K., Fu, H., Novotn\u00fd, P., Hasheminezhad, R.: Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. In: POPL, pp. 327\u2013342 (2016)","journal-title":"ACM SIGPLAN Notices"},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/3093333.3009873","volume":"52","author":"Krishnendu Chatterjee","year":"2017","unstructured":"Chatterjee, K., Novotn\u00fd, P., Zikelic, D.: Stochastic invariants for probabilistic termination. In: Castagna and Gordon [11], pp. 145\u2013160 (2017)","journal-title":"ACM SIGPLAN Notices"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-540-45069-6_39","volume-title":"Computer Aided Verification","author":"MA Col\u00f3n","year":"2003","unstructured":"Col\u00f3n, M.A., Sankaranarayanan, S., Sipma, H.B.: Linear invariant generation using non-linear constraint solving. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 420\u2013432. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_39"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Col\u00f3n, M., Sipma, H.: Synthesis of linear ranking functions. In: TACAS, pp. 67\u201381 (2001)","DOI":"10.1007\/3-540-45319-9_6"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Cook, B., See, A., Zuleger, F.: Ramsey vs. lexicographic termination proving. In: TACAS, pp. 47\u201361 (2013)","DOI":"10.1007\/978-3-642-36742-7_4"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30579-8_1","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P Cousot","year":"2005","unstructured":"Cousot, P.: Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 1\u201324. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30579-8_1"},{"issue":"4","key":"22_CR21","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1145\/3296979.3192399","volume":"53","author":"Marco Cusumano-Towner","year":"2018","unstructured":"Cusumano-Towner, M., Bichsel, B., Gehr, T., Vechev, M.T., Mansinghka, V.K.: Incremental inference for probabilistic programs. In: Foster and Grossman [27], pp. 571\u2013585 (2018)","journal-title":"ACM SIGPLAN Notices"},{"key":"22_CR22","volume-title":"Probability: Theory and Examples","author":"R Durrett","year":"1996","unstructured":"Durrett, R.: Probability: Theory and Examples, 2nd edn. Duxbury Press, Boston (1996)","edition":"2"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Esparza, J., Gaiser, A., Kiefer, S.: Proving termination of probabilistic programs using patterns. In: CAV, pp. 123\u2013138 (2012)","DOI":"10.1007\/978-3-642-31424-7_14"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Fioriti, L.M.F., Hermanns, H.: Probabilistic termination: soundness, completeness, and compositionality. In: POPL, pp. 489\u2013501 (2015)","DOI":"10.1145\/2676726.2677001"},{"key":"22_CR25","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","volume":"19","author":"RW Floyd","year":"1967","unstructured":"Floyd, R.W.: Assigning meanings to programs. Math. Asp. Comput. Sci. 19, 19\u201333 (1967)","journal-title":"Math. Asp. Comput. Sci."},{"issue":"3","key":"22_CR26","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1214\/aoms\/1177728976","volume":"24","author":"FG Foster","year":"1953","unstructured":"Foster, F.G.: On the stochastic matrices associated with certain queuing processes. Ann. Math. Stat. 24(3), 355\u2013360 (1953)","journal-title":"Ann. Math. Stat."},{"key":"22_CR27","unstructured":"Foster, J.S., Grossman, D. (eds.): Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018, Philadelphia, PA, USA, 18\u201322 June 2018. ACM (2018)"},{"key":"22_CR28","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-662-49498-1_12","volume-title":"Programming Languages and Systems","author":"Nate Foster","year":"2016","unstructured":"Foster, N., Kozen, D., Mamouras, K., Reitblatt, M., Silva, A.: Probabilistic netKAT. In: Thiemann [56], pp. 282\u2013309 (2016)"},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1007\/978-3-319-40229-1_37","volume-title":"Automated Reasoning","author":"F Frohn","year":"2016","unstructured":"Frohn, F., Naaf, M., Hensel, J., Brockschmidt, M., Giesl, J.: Lower runtime bounds for integer programs. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS (LNAI), vol. 9706, pp. 550\u2013567. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40229-1_37"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Gordon, A.D., Henzinger, T.A., Nori, A.V., Rajamani, S.K.: Probabilistic programming. In: Herbsleb, J.D., Dwyer, M.B. (eds.) Proceedings of the on Future of Software Engineering, FOSE 2014, Hyderabad, India, 31 May\u20137 June 2014, pp. 167\u2013181. ACM (2014)","DOI":"10.1145\/2593882.2593900"},{"issue":"4","key":"22_CR31","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1137\/0214070","volume":"14","author":"S Hart","year":"1985","unstructured":"Hart, S., Sharir, M.: Concurrent probabilistic programs, or: How to schedule if you must. SIAM J. Comput. 14(4), 991\u20131012 (1985)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"22_CR32","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/BF01211249","volume":"5","author":"WH Hesselink","year":"1993","unstructured":"Hesselink, W.H.: Proof rules for recursive procedures. Formal Asp. Comput. 5(6), 554\u2013570 (1993)","journal-title":"Formal Asp. Comput."},{"key":"22_CR33","volume-title":"Dynamic Programming and Markov Processes","author":"H Howard","year":"1960","unstructured":"Howard, H.: Dynamic Programming and Markov Processes. MIT Press, Cambridge (1960)"},{"key":"22_CR34","unstructured":"Jones, C.: Probabilistic non-determinism. Ph.D. thesis, The University of Edinburgh (1989)"},{"issue":"1","key":"22_CR35","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0004-3702(98)00023-X","volume":"101","author":"LP Kaelbling","year":"1998","unstructured":"Kaelbling, L.P., Littman, M.L., Cassandra, A.R.: Planning and acting in partially observable stochastic domains. Artif. Intell. 101(1), 99\u2013134 (1998)","journal-title":"Artif. Intell."},{"key":"22_CR36","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"LP Kaelbling","year":"1996","unstructured":"Kaelbling, L.P., Littman, M.L., Moore, A.W.: Reinforcement learning: a survey. JAIR 4, 237\u2013285 (1996)","journal-title":"JAIR"},{"key":"22_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-662-48057-1_24","volume-title":"Mathematical Foundations of Computer Science 2015","author":"BL Kaminski","year":"2015","unstructured":"Kaminski, B.L., Katoen, J.-P.: On the hardness of almost\u2013sure termination. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 307\u2013318. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48057-1_24"},{"key":"22_CR38","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-662-49498-1_15","volume-title":"Programming Languages and Systems","author":"Benjamin Lucien Kaminski","year":"2016","unstructured":"Kaminski, B.L., Katoen, J., Matheja, C., Olmedo, F.: Weakest precondition reasoning for expected run-times of probabilistic programs. In: Thiemann [56], pp. 364\u2013389 (2016)"},{"key":"22_CR39","volume-title":"Denumerable Markov Chains","author":"J Kemeny","year":"1966","unstructured":"Kemeny, J., Snell, J., Knapp, A.: Denumerable Markov Chains. D. Van Nostrand Company, New York City (1966)"},{"key":"22_CR40","unstructured":"Kura, S., Urabe, N., Hasuo, I.: Tail probabilities for randomized program runtimes via martingales for higher moments. CoRR abs\/1811.06779 (2018). http:\/\/arxiv.org\/abs\/1811.06779"},{"key":"22_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_47"},{"key":"22_CR42","doi-asserted-by":"crossref","unstructured":"Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: POPL, pp. 81\u201392 (2001)","DOI":"10.1145\/360204.360210"},{"key":"22_CR43","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/11889229_4","volume-title":"Refinement Techniques in Software Engineering","author":"Annabelle McIver","year":"2006","unstructured":"McIver, A., Morgan, C.: Developing and reasoning about probabilistic programs in pGCL. In: PSSE, pp. 123\u2013155 (2004)"},{"key":"22_CR44","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b138392","volume-title":"Abstraction, Refinement and Proof for Probabilistic Systems","author":"A McIver","year":"2005","unstructured":"McIver, A., Morgan, C.: Abstraction, Refinement and Proof for Probabilistic Systems. Monographs in Computer Science. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/b138392"},{"issue":"POPL","key":"22_CR45","first-page":"33:1","volume":"2","author":"A McIver","year":"2018","unstructured":"McIver, A., Morgan, C., Kaminski, B.L., Katoen, J.: A new proof rule for almost-sure termination. PACMPL 2(POPL), 33:1\u201333:28 (2018)","journal-title":"PACMPL"},{"key":"22_CR46","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626630","volume-title":"Markov Chains and Stochastic Stability","author":"S Meyn","year":"2009","unstructured":"Meyn, S., Tweedie, R.: Markov Chains and Stochastic Stability. Cambridge University Press, Cambridge (2009)"},{"issue":"4","key":"22_CR47","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1145\/3296979.3192394","volume":"53","author":"Van Chan Ngo","year":"2018","unstructured":"Ngo, V.C., Carbonneaux, Q., Hoffmann, J.: Bounded expectations: resource analysis for probabilistic programs. In: Foster and Grossman [27], pp. 496\u2013512 (2018)","journal-title":"ACM SIGPLAN Notices"},{"key":"22_CR48","doi-asserted-by":"crossref","unstructured":"Olmedo, F., Kaminski, B.L., Katoen, J.P., Matheja, C.: Reasoning about recursive probabilistic programs. In: LICS, pp. 672\u2013681 (2016)","DOI":"10.1145\/2933575.2935317"},{"key":"22_CR49","series-title":"Computer Science and Applied Mathematics","volume-title":"Introduction to Probabilistic Automata","author":"A Paz","year":"1971","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Computer Science and Applied Mathematics. Academic Press, Cambridge (1971)"},{"key":"22_CR50","doi-asserted-by":"crossref","unstructured":"Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: VMCAI, pp. 239\u2013251 (2004)","DOI":"10.1007\/978-3-540-24622-0_20"},{"key":"22_CR51","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M Rabin","year":"1963","unstructured":"Rabin, M.: Probabilistic automata. Inf. Control. 6, 230\u2013245 (1963)","journal-title":"Inf. Control."},{"key":"22_CR52","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, S., Chakarov, A., Gulwani, S.: Static analysis for probabilistic programs: inferring whole program properties from finitely many paths. In: PLDI, pp. 447\u2013458 (2013)","DOI":"10.1145\/2491956.2462179"},{"issue":"2","key":"22_CR53","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1137\/0213021","volume":"13","author":"M Sharir","year":"1984","unstructured":"Sharir, M., Pnueli, A., Hart, S.: Verification of probabilistic programs. SIAM J. Comput. 13(2), 292\u2013314 (1984)","journal-title":"SIAM J. Comput."},{"key":"22_CR54","doi-asserted-by":"crossref","unstructured":"Sohn, K., Gelder, A.V.: Termination detection in logic programs using argument sizes. In: PODS, pp. 216\u2013226 (1991)","DOI":"10.1145\/113413.113433"},{"key":"22_CR55","doi-asserted-by":"crossref","unstructured":"Staton, S., Yang, H., Wood, F.D., Heunen, C., Kammar, O.: Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. In: Grohe, M., Koskinen, E., Shankar, N. (eds.) Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2016, 5\u20138 July 2016, pp. 525\u2013534. ACM, New York (2016)","DOI":"10.1145\/2933575.2935313"},{"key":"22_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49498-1","volume-title":"Programming Languages and Systems","year":"2016","unstructured":"Thiemann, P. (ed.): ESOP 2016. LNCS, vol. 9632. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49498-1"},{"key":"22_CR57","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813658","volume-title":"Probability with Martingales","author":"D Williams","year":"1991","unstructured":"Williams, D.: Probability with Martingales. Cambridge University Press, Cambridge (1991)"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-11245-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T22:17:09Z","timestamp":1573683429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-11245-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030112448","9783030112455"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-11245-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cascais","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl19.sigplan.org\/track\/VMCAI-2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}