{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:50:46Z","timestamp":1770288646809,"version":"3.49.0"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319633862","type":"print"},{"value":"9783319633879","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63387-9_6","type":"book-chapter","created":{"date-parts":[[2017,7,12]],"date-time":"2017-07-12T08:53:43Z","timestamp":1499849623000},"page":"118-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[]},{"given":"Hongfei","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Aniket","family":"Murhekar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,13]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1018373005182","volume":"10","author":"MA Akra","year":"1998","unstructured":"Akra, M.A., Bazzi, L.: On the solution of linear recurrence equations. Comp. Opt. Appl. 10(2), 195\u2013210 (1998)","journal-title":"Comp. Opt. Appl."},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.entcs.2009.12.008","volume":"258","author":"E Albert","year":"2009","unstructured":"Albert, E., Arenas, P., Genaim, S., G\u00f3mez-Zamalloa, M., Puebla, G., Ram\u00edrez-Deantes, D.V., Rom\u00e1n-D\u00edez, G., Zanardini, D.: Termination and cost analysis with COSTA and its user interfaces. Electr. Notes Theor. Comput. Sci. 258(1), 109\u2013121 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-540-69166-2_15","volume-title":"Static Analysis","author":"E Albert","year":"2008","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G.: Automatic inference of upper bounds for recurrence relations in cost analysis. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol. 5079, pp. 221\u2013237. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-69166-2_15"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-71316-6_12","volume-title":"Programming Languages and Systems","author":"E Albert","year":"2007","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost analysis of Java bytecode. In: Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 157\u2013172. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-71316-6_12"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Avanzini, M., Lago, U.D., Moser, G.: Analysing the complexity of functional programs: higher-order meets first-order. In: Fisher, K., Reppy, J.H. (eds.) ICFP, pp. 152\u2013164. ACM (2015)","DOI":"10.1145\/2858949.2784753"},{"key":"6_CR6","unstructured":"Bagnara, R., Pescetti, A., Zaccagnini, A., Zaffanella, E.: PURRS: towards computer algebra support for fully automatic worst-case complexity analysis. Technical report, University of Parma (2005). https:\/\/arxiv.org\/abs\/cs\/0512056"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-32033-3_24","volume-title":"Term Rewriting and Applications","author":"O Bournez","year":"2005","unstructured":"Bournez, O., Garnier, F.: Proving positive almost-sure termination. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 323\u2013337. Springer, Heidelberg (2005). doi:10.1007\/978-3-540-32033-3_24"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/11513988_48","volume-title":"Computer Aided Verification","author":"AR Bradley","year":"2005","unstructured":"Bradley, A.R., Manna, Z., Sipma, H.B.: Linear ranking with reachability. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 491\u2013504. Springer, Heidelberg (2005). doi:10.1007\/11513988_48"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-642-39799-8_34","volume-title":"Computer Aided Verification","author":"A Chakarov","year":"2013","unstructured":"Chakarov, A., Sankaranarayanan, S.: Probabilistic program analysis with martingales. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 511\u2013526. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-39799-8_34"},{"key":"6_CR10","unstructured":"Chatterjee, K., Fu, H.: Termination of nondeterministic recursive probabilistic programs. CoRR abs\/1701.02944 (2017). http:\/\/arxiv.org\/abs\/1701.02944"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-41528-4_1","volume-title":"Computer Aided Verification","author":"K Chatterjee","year":"2016","unstructured":"Chatterjee, K., Fu, H., Goharshady, A.K.: Termination analysis of probabilistic programs through Positivstellensatz\u2019s. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 3\u201322. Springer, Cham (2016). doi:10.1007\/978-3-319-41528-4_1"},{"key":"6_CR12","unstructured":"Chatterjee, K., Fu, H., Murhekar, A.: Automated recurrence analysis for almost-linear expected-runtime bounds. CoRR abs\/1705.00314 (2017). https:\/\/arxiv.org\/abs\/1705.00314"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Fu, H., Novotn\u00fd, P., Hasheminezhad, R.: Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. In: Bod\u00edk, R., Majumdar, R. (eds.) POPL, pp. 327\u2013342. ACM (2016)","DOI":"10.1145\/2914770.2837639"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Novotn\u00fd, P., \u017dikeli\u0107, \u0110.: Stochastic invariants for probabilistic termination. In: Castagna, G., Gordon, A.D. (eds.) POPL, pp. 145\u2013160. ACM (2017)","DOI":"10.1145\/3093333.3009873"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45319-9_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"MA Col\u00f3n","year":"2001","unstructured":"Col\u00f3n, M.A., Sipma, H.B.: Synthesis of linear ranking functions. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 67\u201381. Springer, Heidelberg (2001). doi:10.1007\/3-540-45319-9_6"},{"key":"6_CR16","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"6_CR17","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). doi:10.1007\/978-3-540-30579-8_1"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Fioriti, L.M.F., Hermanns, H.: Probabilistic termination: soundness, completeness, and compositionality. In: Rajamani, S.K., Walker, D. (eds.) POPL, pp. 489\u2013501. ACM (2015)","DOI":"10.1145\/2775051.2677001"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0166-218X(92)90177-C","volume":"39","author":"P Flajolet","year":"1992","unstructured":"Flajolet, P., Gardy, D., Thimonier, L.: Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Discret. Appl. Math. 39(3), 207\u2013229 (1992)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0304-3975(91)90145-R","volume":"79","author":"P Flajolet","year":"1991","unstructured":"Flajolet, P., Salvy, B., Zimmermann, P.: Automatic average-case analysis of algorithm. Theor. Comput. Sci. 79(1), 37\u2013109 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Grobauer, B.: Cost recurrences for DML programs. In: Pierce, B.C. (ed.) ICFP, pp. 253\u2013264. ACM (2001)","DOI":"10.1145\/507669.507666"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-540-70545-1_35","volume-title":"Computer Aided Verification","author":"BS Gulavani","year":"2008","unstructured":"Gulavani, B.S., Gulwani, S.: A numerical abstract domain based on expression abstraction and max operator with application in timing analysis. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 370\u2013384. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-70545-1_35"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-02658-4_7","volume-title":"Computer Aided Verification","author":"S Gulwani","year":"2009","unstructured":"Gulwani, S.: SPEED: symbolic complexity bound analysis. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 51\u201362. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-02658-4_7"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Mehra, K.K., Chilimbi, T.M.: SPEED: precise and efficient static estimation of program computational complexity. In: Shao, Z., Pierce, B.C. (eds.) POPL, pp. 127\u2013139. ACM (2009)","DOI":"10.1145\/1594834.1480898"},{"issue":"6","key":"6_CR25","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."},{"issue":"3","key":"6_CR26","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2362389.2362393","volume":"34","author":"J Hoffmann","year":"2012","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate amortized resource analysis. ACM Trans. Program. Lang. Syst. 34(3), 14 (2012)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/978-3-642-31424-7_64","volume-title":"Computer Aided Verification","author":"J Hoffmann","year":"2012","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Resource aware ML. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 781\u2013786. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-31424-7_64"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-642-17164-2_13","volume-title":"Programming Languages and Systems","author":"J Hoffmann","year":"2010","unstructured":"Hoffmann, J., Hofmann, M.: Amortized resource analysis with polymorphic recursion and partial big-step operational semantics. In: Ueda, K. (ed.) APLAS 2010. LNCS, vol. 6461, pp. 172\u2013187. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-17164-2_13"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-11957-6_16","volume-title":"Programming Languages and Systems","author":"J Hoffmann","year":"2010","unstructured":"Hoffmann, J., Hofmann, M.: Amortized resource analysis with polynomial potential. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 287\u2013306. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-11957-6_16"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. In: Aiken, A., Morrisett, G. (eds.) POPL, pp. 185\u2013197. ACM (2003)","DOI":"10.1145\/640128.604148"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11693024_3","volume-title":"Programming Languages and Systems","author":"M Hofmann","year":"2006","unstructured":"Hofmann, M., Jost, S.: Type-based amortised heap-space analysis. In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol. 3924, pp. 22\u201337. Springer, Heidelberg (2006). doi:10.1007\/11693024_3"},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-04027-6_24","volume-title":"Computer Science Logic","author":"M Hofmann","year":"2009","unstructured":"Hofmann, M., Rodriguez, D.: Efficient type-checking for amortised heap-space analysis. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol. 5771, pp. 317\u2013331. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-04027-6_24"},{"key":"6_CR33","unstructured":"Jones, C.: Probabilistic non-determinism. Ph.D. thesis, The University of Edinburgh (1989)"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Jost, S., Hammond, K., Loidl, H., Hofmann, M.: Static determination of quantitative resource usage for higher-order programs. In: Hermenegildo, M.V., Palsberg, J. (eds.) POPL, pp. 223\u2013236. ACM (2010)","DOI":"10.1145\/1707801.1706327"},{"key":"6_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-05089-3_23","volume-title":"FM 2009: Formal Methods","author":"S Jost","year":"2009","unstructured":"Jost, S., Loidl, H.-W., Hammond, K., Scaife, N., Hofmann, M.: \u201cCarbon credits\u201d for resource-bounded computations using amortised analysis. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 354\u2013369. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-05089-3_23"},{"key":"6_CR36","volume-title":"Algorithm Design","author":"J Kleinberg","year":"2004","unstructured":"Kleinberg, J., Tardos, \u00c9.: Algorithm Design. Addison-Wesley, Boston (2004)"},{"key":"6_CR37","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. I\u2013III. Addison-Wesley, Boston (1973)"},{"key":"6_CR38","volume-title":"Analysis of Algorithms - An Active Learning Approach","author":"J McConnell","year":"2008","unstructured":"McConnell, J.: Analysis of Algorithms - An Active Learning Approach. Jones and Bartlett Publishers, Inc., Burlington (2008)"},{"key":"6_CR39","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Olmedo, F., Kaminski, B.L., Katoen, J., Matheja, C.: Reasoning about recursive probabilistic programs. In: Grohe, M., Koskinen, E., Shankar, N. (eds.) LICS, pp. 672\u2013681. ACM (2016)","DOI":"10.1145\/2933575.2935317"},{"key":"6_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-24622-0_20","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Podelski","year":"2004","unstructured":"Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 239\u2013251. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-24622-0_20"},{"issue":"2","key":"6_CR42","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s11424-013-1004-1","volume":"26","author":"L Shen","year":"2013","unstructured":"Shen, L., Wu, M., Yang, Z., Zeng, Z.: Generating exact nonlinear ranking functions by symbolic-numeric hybrid method. J. Syst. Sci. Complex. 26(2), 291\u2013301 (2013)","journal-title":"J. Syst. Sci. Complex."},{"key":"6_CR43","unstructured":"Sinn, M., Zuleger, F., Veith, H.: A simple and scalable static analysis for bound analysis and amortized complexity analysis. In: Knoop, J., Zdun, U. (eds.) Software Engineering. LNI, vol. 252, pp. 101\u2013102. GI (2016)"},{"key":"6_CR44","doi-asserted-by":"crossref","unstructured":"Sohn, K., Gelder, A.V.: Termination detection in logic programs using argument sizes. In: Rosenkrantz, D.J. (ed.) PODS, pp. 216\u2013226. ACM Press (1991)","DOI":"10.1145\/113413.113433"},{"issue":"9","key":"6_CR45","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1145\/361002.361016","volume":"18","author":"B Wegbreit","year":"1975","unstructured":"Wegbreit, B.: Mechanical program analysis. Commun. ACM 18(9), 528\u2013539 (1975)","journal-title":"Commun. ACM"},{"issue":"3","key":"6_CR46","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/1347375.1347389","volume":"7","author":"R Wilhelm","year":"2008","unstructured":"Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N., Thesing, S., Whalley, D.B., Bernat, G., Ferdinand, C., Heckmann, R., Mitra, T., Mueller, F., Puaut, I., Puschner, P.P., Staschulat, J., Stenstr\u00f6m, P.: The worst-case execution-time problem - overview of methods and survey of tools. ACM Trans. Embedded Comput. Syst. 7(3), 36 (2008)","journal-title":"ACM Trans. Embedded Comput. Syst."},{"issue":"1","key":"6_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11704-009-0074-7","volume":"4","author":"L Yang","year":"2010","unstructured":"Yang, L., Zhou, C., Zhan, N., Xia, B.: Recent advances in program verification through computer algebra. Front. Comput. Sci. China 4(1), 1\u201316 (2010)","journal-title":"Front. Comput. Sci. China"},{"key":"6_CR48","unstructured":"Zimmermann, P., Zimmermann, W.: The automatic complexity analysis of divide-and-conquer algorithms. Technical report, HAL Inria (1989). https:\/\/hal.inria.fr\/inria-00075410\/"}],"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-319-63387-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T00:14:35Z","timestamp":1626135275000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-63387-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319633862","9783319633879"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63387-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"13 July 2017","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":"Heidelberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cavconference.org\/2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}