{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:04:32Z","timestamp":1762459472372,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":48,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662544334"},{"type":"electronic","value":"9783662544341"}],"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-662-54434-1_9","type":"book-chapter","created":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T04:20:06Z","timestamp":1489810806000},"page":"229-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Linearity, Control Effects, and Behavioral Types"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Caires","sequence":"first","affiliation":[]},{"given":"Jorge A.","family":"P\u00e9rez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,19]]},"reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J-M Andreoli","year":"1992","unstructured":"Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. Log. Comput. 2(3), 297\u2013347 (1992)","journal-title":"J. Log. Comput."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/3-540-45061-0_68","volume-title":"Automata, Languages and Programming","author":"ZM Ariola","year":"2003","unstructured":"Ariola, Z.M., Herbelin, H.: Minimal classical logic and control operators. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 871\u2013885. Springer, Heidelberg (2003). doi:10.1007\/3-540-45061-0_68"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-319-30936-1_2","volume-title":"A List of Successes That Can Change the World","author":"R Atkey","year":"2016","unstructured":"Atkey, R., Lindley, S., Morris, J.G.: Conflation confers concurrency. In: Lindley, S., McBride, C., Trinder, P., Sannella, D. (eds.) A List of Successes That Can Change the World. LNCS, vol. 9600, pp. 32\u201355. Springer, Heidelberg (2016). doi:10.1007\/978-3-319-30936-1_2"},{"key":"9_CR4","unstructured":"Barber, A.: Dual intuitionistic linear logic. Technical report LFCS-96-347 University of Edinburgh (1996)"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1017\/S0956796898002998","volume":"8","author":"PN Benton","year":"1998","unstructured":"Benton, P.N., Bierman, G.M., de Paiva, V.: Computational types from a logical perspective. J. Funct. Program. 8(2), 177\u2013193 (1998)","journal-title":"J. Funct. Program."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BFb0037099","volume-title":"Typed Lambda Calculi and Applications","author":"N Benton","year":"1993","unstructured":"Benton, N., Bierman, G., Paiva, V., Hyland, M.: A term calculus for intuitionistic linear logic. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, pp. 75\u201390. Springer, Heidelberg (1993). doi:10.1007\/BFb0037099"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(97)00220-X","volume":"195","author":"M Boreale","year":"1998","unstructured":"Boreale, M.: On the expressiveness of internal mobility in name-passing calculi. Theor. Comput. Sci. 195(2), 205\u2013226 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR8","unstructured":"Caires, L.: Types and logic, concurrency and non-determinism. In: Abadi, M., Gardner, P., Gordon, A.D., Mardare, R. (eds.) Essays for the Luca Cardelli Fest, pp. 69\u201383. Microsoft Research TR MSR-TR\u2013104 (2014)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-319-39570-8_6","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"L Caires","year":"2016","unstructured":"Caires, L., P\u00e9rez, J.A.: Multiparty session types within a canonical binary theory, and beyond. In: Albert, E., Lanese, I. (eds.) FORTE 2016. LNCS, vol. 9688, pp. 74\u201395. Springer, Heidelberg (2016). doi:10.1007\/978-3-319-39570-8_6"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-642-37036-6_19","volume-title":"Programming Languages and Systems","author":"L Caires","year":"2013","unstructured":"Caires, L., P\u00e9rez, J.A., Pfenning, F., Toninho, B.: Behavioral polymorphism and parametricity in session-based communication. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 330\u2013349. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-37036-6_19"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-15375-4_16","volume-title":"CONCUR 2010 - Concurrency Theory","author":"L Caires","year":"2010","unstructured":"Caires, L., Pfenning, F.: Session types as intuitionistic linear propositions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 222\u2013236. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-15375-4_16"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Caires, L., Pfenning, F., Toninho, B.: Towards concurrent type theory. In: Types in Language Design and Implementation, pp. 1\u201312 (2012)","DOI":"10.1145\/2103786.2103788"},{"issue":"03","key":"9_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1017\/S0960129514000218","volume":"26","author":"L Caires","year":"2016","unstructured":"Caires, L., Pfenning, F., Toninho, B.: Linear logic propositions as session types. Math. Struct. Comput. Sci. 26(03), 367\u2013423 (2016)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1017\/S0960129514000164","volume":"26","author":"S Capecchi","year":"2016","unstructured":"Capecchi, S., Giachino, E., Yoshida, N.: Global escape in multiparty sessions. Math. Struct. Comput. Sci. 26(2), 156\u2013205 (2016)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-540-85361-9_32","volume-title":"CONCUR 2008 - Concurrency Theory","author":"M Carbone","year":"2008","unstructured":"Carbone, M., Honda, K., Yoshida, N.: Structured interactional exceptions in session types. In: Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 402\u2013417. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-85361-9_32"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Carbone, M., Lindley, S., Montesi, F., Sch\u00fcrmann, C., Wadler, P.: Coherence generalises duality: a logical explanation of multiparty session types. In: CONCUR 2016, pp. 3:1\u201333:15 (2016)","DOI":"10.1007\/s00236-016-0285-y"},{"key":"9_CR17","unstructured":"Carbone, M., Montesi, F., Sch\u00fcrmann, C., Yoshida, N.: Multiparty session types as coherence proofs. In: Proceedings of CONCUR 2015. LIPIcs, vol. 42, pp. 412\u2013426. Schloss Dagstuhl (2015)"},{"key":"9_CR18","unstructured":"Cardelli, L.: Typeful Programming. IFIP State-of-the-Art Reports: Formal Description of Programming Concepts, pp. 431\u2013507 (1991)"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/3-540-17660-8_53","volume-title":"TAPSOFT \u201987","author":"R Nicola","year":"1987","unstructured":"Nicola, R., Hennessy, M.: CCS without $$\\tau $$\u2019s. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds.) CAAP 1987. LNCS, vol. 249, pp. 138\u2013152. Springer, Heidelberg (1987). doi:10.1007\/3-540-17660-8_53"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-540-24851-4_21","volume-title":"ECOOP 2004 \u2013 Object-Oriented Programming","author":"R DeLine","year":"2004","unstructured":"DeLine, R., F\u00e4hndrich, M.: Typestates for objects. In: Odersky, M. (ed.) ECOOP 2004. LNCS, vol. 3086, pp. 465\u2013490. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-24851-4_21"},{"issue":"3","key":"9_CR21","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10703-014-0218-8","volume":"46","author":"R Demangeon","year":"2015","unstructured":"Demangeon, R., Honda, K., Hu, R., Neykova, R., Yoshida, N.: Practical interruptible conversations: distributed dynamic verification with multiparty session types and python. Formal Methods Syst. Des. 46(3), 197\u2013225 (2015)","journal-title":"Formal Methods Syst. Des."},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tcs.2006.08.003","volume":"364","author":"T Ehrhard","year":"2006","unstructured":"Ehrhard, T., Regnier, L.: Differential interaction nets. Theor. Comput. Sci. 364(2), 166\u2013195 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-20401-2_14","volume-title":"Rigorous Software Engineering for Service-Oriented Systems","author":"C Ferreira","year":"2011","unstructured":"Ferreira, C., Lanese, I., Ravara, A., Vieira, H.T., Zavattaro, G.: Advanced mechanisms for service combination and transactions. In: Wirsing, M., H\u00f6lzl, M. (eds.) Rigorous Software Engineering for Service-Oriented Systems. LNCS, vol. 6582, pp. 302\u2013325. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-20401-2_14"},{"issue":"10","key":"9_CR24","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1016\/j.ic.2007.01.006","volume":"205","author":"P Gardner","year":"2007","unstructured":"Gardner, P., Laneve, C., Wischik, L.: Linear forwarders. Inf. Comput. 205(10), 1526\u20131550 (2007)","journal-title":"Inf. Comput."},{"issue":"1","key":"9_CR25","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1017\/S0956796809990268","volume":"20","author":"S Gay","year":"2010","unstructured":"Gay, S., Vasconcelos, V.T.: Linear type theory for asynchronous session types. J. Funct. Program. 20(1), 19\u201350 (2010)","journal-title":"J. Funct. Program."},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Griffin, T.: A formulae-as-types notion of control. In: POPL 1990, pp. 47\u201358 (1990)","DOI":"10.1145\/96709.96714"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/3-540-57208-2_35","volume-title":"CONCUR\u201993","author":"K Honda","year":"1993","unstructured":"Honda, K.: Types for dyadic interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 509\u2013523. Springer, Heidelberg (1993). doi:10.1007\/3-540-57208-2_35"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/BFb0053567","volume-title":"Programming Languages and Systems","author":"K Honda","year":"1998","unstructured":"Honda, K., Vasconcelos, V.T., Kubo, M.: Language primitives and type discipline for structured communication-based programming. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol. 1381, pp. 122\u2013138. Springer, Heidelberg (1998). doi:10.1007\/BFb0053567"},{"issue":"1","key":"9_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2873052","volume":"49","author":"H H\u00fcttel","year":"2016","unstructured":"H\u00fcttel, H., Lanese, I., Vasconcelos, V.T., Caires, L., et al.: Foundations of session types and behavioural contracts. ACM Comput. Surv. 49(1), 3 (2016)","journal-title":"ACM Comput. Surv."},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the pi-calculus. In: 23rd Symposium on Principles of Programming Languages, POPL 1996, pp. 358\u2013371. ACM (1996)","DOI":"10.1145\/237721.237804"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Krishnaswami, N.R., Turon, A., Dreyer, D., Garg, D.: Superficially substructural types. In: ICFP 2012, pp. 41\u201354 (2012)","DOI":"10.1145\/2398856.2364536"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Lindley, S., Morris, J.G.: Embedding session types in Haskell. In: 9th International Symposium on Haskell, Haskell 2016, pp. 133\u2013145 (2016)","DOI":"10.1145\/2976002.2976018"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-662-44202-9_14","volume-title":"ECOOP 2014 \u2013 Object-Oriented Programming","author":"F Milit\u00e3o","year":"2014","unstructured":"Milit\u00e3o, F., Aldrich, J., Caires, L.: Rely-guarantee protocols. In: Jones, R. (ed.) ECOOP 2014. LNCS, vol. 8586, pp. 334\u2013359. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44202-9_14"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-662-43376-8_8","volume-title":"Coordination Models and Languages","author":"D Mostrous","year":"2014","unstructured":"Mostrous, D., Vasconcelos, V.T.: Affine sessions. In: K\u00fchn, E., Pugliese, R. (eds.) COORDINATION 2014. LNCS, vol. 8459, pp. 115\u2013130. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-43376-8_8"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Orchard, D.A., Yoshida, N.: Effects as sessions, sessions as effects. In: Proceedings of the POPL 2016, pp. 568\u2013581. ACM (2016)","DOI":"10.1145\/2914770.2837634"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BFb0013061","volume-title":"Logic Programming and Automated Reasoning","author":"M Parigot","year":"1992","unstructured":"Parigot, M.: $$\\lambda \\upmu $$-calculus: an algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol. 624, pp. 190\u2013201. Springer, Heidelberg (1992). doi:10.1007\/BFb0013061"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-28869-2_27","volume-title":"Programming Languages and Systems","author":"JA P\u00e9rez","year":"2012","unstructured":"P\u00e9rez, J.A., Caires, L., Pfenning, F., Toninho, B.: Linear logical relations for session-based concurrency. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol. 7211, pp. 539\u2013558. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-28869-2_27"},{"key":"9_CR38","doi-asserted-by":"crossref","unstructured":"Pfenning, F.: Structural cut elimination. In: 10th Annual IEEE Symposium on Logic in Computer Science, LICS 1995, pp. 156\u2013166. IEEE Computer Society (1995)","DOI":"10.1109\/LICS.1995.523253"},{"issue":"3","key":"9_CR39","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"GD Plotkin","year":"1976","unstructured":"Plotkin, G.D.: A powerdomain construction. SIAM J. Comput. 5(3), 452\u2013487 (1976)","journal-title":"SIAM J. Comput."},{"key":"9_CR40","doi-asserted-by":"crossref","DOI":"10.1017\/9781316134924","volume-title":"The $$\\pi $$-Calculus: A Theory of Mobile Processes","author":"D Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The $$\\pi $$-Calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"9_CR41","unstructured":"Scalas, A., Yoshida, N.: Lightweight session programming in scala. In: 30th European Conference on Object-Oriented Programming, ECOOP 2016, pp. 21:1\u201321:28 (2016)"},{"key":"9_CR42","doi-asserted-by":"crossref","unstructured":"Toninho, B., Caires, L., Pfenning, F.: Dependent session types via intuitionistic linear type theory. In: PPDP 2011, pp. 161\u2013172 (2011)","DOI":"10.1145\/2003476.2003499"},{"key":"9_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-28729-9_23","volume-title":"Foundations of Software Science and Computational Structures","author":"B Toninho","year":"2012","unstructured":"Toninho, B., Caires, L., Pfenning, F.: Functions as session-typed processes. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 346\u2013360. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-28729-9_23"},{"key":"9_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-37036-6_20","volume-title":"Programming Languages and Systems","author":"B Toninho","year":"2013","unstructured":"Toninho, B., Caires, L., Pfenning, F.: Higher-order processes, functions, and sessions: a monadic integration. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 350\u2013369. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-37036-6_20"},{"key":"9_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1007\/978-3-642-11957-6_29","volume-title":"Programming Languages and Systems","author":"JA Tov","year":"2010","unstructured":"Tov, J.A., Pucella, R.: Stateful contracts for affine types. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 550\u2013569. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-11957-6_29"},{"key":"9_CR46","doi-asserted-by":"crossref","unstructured":"Tov, J.A., Pucella, R.: A theory of substructural types and control. In: OOPSLA 2011, pp. 625\u2013642 (2011)","DOI":"10.1145\/2076021.2048115"},{"key":"9_CR47","doi-asserted-by":"crossref","unstructured":"Tov, J.A., Pucella, R.: Practical affine types. In: POPL 2011, pp. 447\u2013458 (2011)","DOI":"10.1145\/1925844.1926436"},{"key":"9_CR48","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Propositions as sessions. In: ICFP 2012, pp. 273\u2013286. ACM (2012)","DOI":"10.1145\/2398856.2364568"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54434-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T01:40:59Z","timestamp":1750124459000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-54434-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662544334","9783662544341"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54434-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","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":"25 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2017a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.etaps.org\/index.php\/2017\/esop","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"}]}}