{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:04:12Z","timestamp":1762459452222,"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_6","type":"book-chapter","created":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T04:20:06Z","timestamp":1489810806000},"page":"141-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Confluence of Graph Rewriting with Interfaces"],"prefix":"10.1007","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[]},{"given":"Aleks","family":"Kissinger","sequence":"additional","affiliation":[]},{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Zanasi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,19]]},"reference":[{"key":"6_CR1","first-page":"836","volume":"30","author":"J Baez","year":"2015","unstructured":"Baez, J., Erbele, J.: Categories in control. Theory Appl. Categ. 30, 836\u2013881 (2015)","journal-title":"Theory Appl. Categ."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-22993-0_8","volume-title":"Mathematical Foundations of Computer Science 2011","author":"P Baldan","year":"2011","unstructured":"Baldan, P., Gadducci, F., Soboci\u0144ski, P.: Adhesivity is not enough: local church-rosser revisited. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 48\u201359. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-22993-0_8"},{"issue":"5","key":"6_CR3","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/BF00271645","volume":"21","author":"G Bauer","year":"1984","unstructured":"Bauer, G., Otto, F.: Finite complete rewriting systems and the complexity of the word problem. Acta Inform. 21(5), 521\u2013540 (1984)","journal-title":"Acta Inform."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gadducci, F., Kissinger, A., Soboci\u0144ski, P., Zanasi, F.: Rewriting modulo symmetric monoidal structure. In: LiCS 2016, pp. 710\u2013719. ACM (2016)","DOI":"10.1145\/2933575.2935316"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ic.2008.10.005","volume":"207","author":"F Bonchi","year":"2009","unstructured":"Bonchi, F., Gadducci, F., K\u00f6nig, B.: Synthesising CCS bisimulation using graph rewriting. Inf. Comput. 207(1), 14\u201340 (2009)","journal-title":"Inf. Comput."},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-662-44584-6_30","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"F Bonchi","year":"2014","unstructured":"Bonchi, F., Soboci\u0144ski, P., Zanasi, F.: A categorical semantics of signal flow graphs. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 435\u2013450. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44584-6_30"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Sobocinski, P., Zanasi, F.: Full abstraction for signal flow graphs. In: POPL 2015, pp. 515\u2013526. ACM (2015)","DOI":"10.1145\/2775051.2676993"},{"key":"6_CR8","unstructured":"Bruggink, H.J.S., Cauderlier, R., H\u00fclsbusch, M., K\u00f6nig, B.: Conditional reactive systems. In: FSTTCS 2011, LIPIcs, vol. 13, pp. 191\u2013203. Schloss Dagstuhl\u00a0- Leibniz-Zentrum f\u00fcr Informatik (2011)"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0304-3975(01)00318-8","volume":"286","author":"R Bruni","year":"2002","unstructured":"Bruni, R., Gadducci, F., Montanari, U.: Normal forms for algebras of connection. Theor. Comput. Sci. 286(2), 247\u2013292 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"6_CR10","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.tcs.2006.07.005","volume":"366","author":"R Bruni","year":"2006","unstructured":"Bruni, R., Lanese, I., Montanari, U.: A basic algebra of stateless connectors. Theor. Comput. Sci. 366(1\u20132), 98\u2013120 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-23217-6_21","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"R Bruni","year":"2011","unstructured":"Bruni, R., Melgratti, H., Montanari, U.: A connector algebra for P\/T nets interactions. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 312\u2013326. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-23217-6_21"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0304-3975(93)90054-W","volume":"115","author":"A Burroni","year":"1993","unstructured":"Burroni, A.: Higher dimensional word problems with applications to equational logic. Theor. Comput. Sci. 115(1), 43\u201362 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/0021-8693(91)90057-F","volume":"136","author":"A Carboni","year":"1991","unstructured":"Carboni, A.: Matrices, relations, and group representations. J. Algebra 136(1), 497\u2013529 (1991)","journal-title":"J. Algebra"},{"issue":"1\u20132","key":"6_CR14","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0022-4049(87)90121-6","volume":"49","author":"A Carboni","year":"1987","unstructured":"Carboni, A., Walters, R.F.C.: Cartesian bicategories I. J. Pure Appl. Algebra 49(1\u20132), 11\u201332 (1987)","journal-title":"J. Pure Appl. Algebra"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-70583-3_25","volume-title":"Automata, Languages and Programming","author":"B Coecke","year":"2008","unstructured":"Coecke, B., Duncan, R.: Interacting quantum observables. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 298\u2013310. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-70583-3_25"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Coecke, B., Duncan, R., Kissinger, A., Wang, Q.: Strong complementarity and non-locality in categorical quantum mechanics. In: LiCS 2012, pp. 245\u2013254. ACM (2012)","DOI":"10.1109\/LICS.2012.35"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-50230-4_8","volume-title":"Software Technologies: Applications and Foundations","author":"A Corradini","year":"2016","unstructured":"Corradini, A.: On the definition of parallel independence in the algebraic approaches to graph transformation. In: Milazzo, P., Varr\u00f3, D., Wimmer, M. (eds.) STAF 2016. LNCS, vol. 9946, pp. 101\u2013111. Springer, Heidelberg (2016). doi:10.1007\/978-3-319-50230-4_8"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-30203-2_12","volume-title":"Graph Transformations","author":"H Ehrig","year":"2004","unstructured":"Ehrig, H., Habel, A., Padberg, J., Prange, U.: Adhesive high-level replacement categories and systems. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 144\u2013160. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-30203-2_12"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-24727-2_12","volume-title":"Foundations of Software Science and Computation Structures","author":"H Ehrig","year":"2004","unstructured":"Ehrig, H., K\u00f6nig, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting. In: Walukiewicz, I. (ed.) FoSSaCS 2004. LNCS, vol. 2987, pp. 151\u2013166. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-24727-2_12"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-07854-1_188","volume-title":"Mathematical Foundations of Computer Science 1976","author":"H Ehrig","year":"1976","unstructured":"Ehrig, H., Kreowski, H.-J.: Parallelism of manipulations in multidimensional information structures. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol. 45, pp. 284\u2013293. Springer, Heidelberg (1976). doi:10.1007\/3-540-07854-1_188"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-38164-5_4","volume-title":"Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky","author":"M Fiore","year":"2013","unstructured":"Fiore, M., Devesas Campos, M.: The algebra of directed acyclic graphs. In: Coecke, B., Ong, L., Panangaden, P. (eds.) Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky. LNCS, vol. 7860, pp. 37\u201351. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-38164-5_4"},{"issue":"33","key":"6_CR22","first-page":"1096","volume":"30","author":"B Fong","year":"2015","unstructured":"Fong, B.: Decorated cospans. Theory Appl. Categ. 30(33), 1096\u20131120 (2015)","journal-title":"Theory Appl. Categ."},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Fong, B., Rapisarda, P., Soboci\u0144ski, P.: A categorical approach to open interconnected dynamical systems. In: LiCS 2016, pp. 495\u2013504. ACM (2016)","DOI":"10.1145\/2933575.2934556"},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1017\/S096012950700610X","volume":"17","author":"F Gadducci","year":"2007","unstructured":"Gadducci, F.: Graph rewriting for the $$\\pi $$-calculus. Math. Struct. Comput. Sci. 17(3), 407\u2013437 (2007)","journal-title":"Math. Struct. Comput. Sci."},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-64299-4_36","volume-title":"Recent Trends in Algebraic Development Techniques","author":"F Gadducci","year":"1998","unstructured":"Gadducci, F., Heckel, R.: An inductive view of graph transformation. In: Presicce, F.P. (ed.) WADT 1997. LNCS, vol. 1376, pp. 223\u2013237. Springer, Heidelberg (1998). doi:10.1007\/3-540-64299-4_36"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-38164-5_5","volume-title":"Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky","author":"DR Ghica","year":"2013","unstructured":"Ghica, D.R.: Diagrammatic reasoning for delay-insensitive asynchronous circuits. In: Coecke, B., Ong, L., Panangaden, P. (eds.) Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky. LNCS, vol. 7860, pp. 52\u201368. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-38164-5_5"},{"key":"6_CR27","unstructured":"Huet, G., Lankford, D.: On the uniform halting problem for term rewriting systems. Technical report 283, IRIA (1978)"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Hyland, M., Power, J.: Lawvere theories and monads. In: Plotkin Festschrift, ENTCS, vol. 172, pp. 437\u2013458. Elsevier, Amsterdam (2007)","DOI":"10.1016\/j.entcs.2007.02.019"},{"issue":"1","key":"6_CR29","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0001-8708(91)90003-P","volume":"88","author":"A Joyal","year":"1991","unstructured":"Joyal, A., Street, R.: The geometry of tensor calculus, I. Adv. Math. 88(1), 55\u2013112 (1991)","journal-title":"Adv. Math."},{"issue":"1","key":"6_CR30","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0890-5401(90)90023-B","volume":"86","author":"D Kapur","year":"1990","unstructured":"Kapur, D., Narendran, P., Otto, F.: On ground-confluence of term rewriting systems. Inf. Comput. 86(1), 14\u201331 (1990)","journal-title":"Inf. Comput."},{"key":"6_CR31","unstructured":"Kissinger, A.: Finite matrices are complete for (dagger)-hypergraph categories. arXiv:1406.5942 [math.CT]"},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-21401-6_22","volume-title":"Automated Deduction - CADE-25","author":"A Kissinger","year":"2015","unstructured":"Kissinger, A., Zamdzhiev, V.: Quantomatic: a proof assistant for diagrammatic reasoning. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 326\u2013336. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-21401-6_22"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Computational Problems in Abstract Algebra, pp. 263\u2013297. Pergamon Press (1970)","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"issue":"3","key":"6_CR34","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1051\/ita:2005028","volume":"39","author":"S Lack","year":"2005","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive and quasiadhesive categories. Theor. Inf. Appl. 39(3), 511\u2013546 (2005)","journal-title":"Theor. Inf. Appl."},{"issue":"2\u20133","key":"6_CR35","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0022-4049(03)00069-0","volume":"184","author":"Y Lafont","year":"2003","unstructured":"Lafont, Y.: Towards an algebraic theory of Boolean circuits. J. Pure Appl. Algebra 184(2\u20133), 257\u2013310 (2003)","journal-title":"J. Pure Appl. Algebra"},{"issue":"1","key":"6_CR36","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1090\/S0002-9904-1965-11234-4","volume":"71","author":"S MacLane","year":"1965","unstructured":"MacLane, S.: Categorical algebra. Bull. Am. Math. Soc. 71(1), 40\u2013106 (1965)","journal-title":"Bull. Am. Math. Soc."},{"issue":"2","key":"6_CR37","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0890-5401(90)90013-8","volume":"88","author":"J Meseguer","year":"1990","unstructured":"Meseguer, J., Montanari, U.: Petri nets are monoids. Inf. Comput. 88(2), 105\u2013155 (1990)","journal-title":"Inf. Comput."},{"key":"6_CR38","unstructured":"Mimram, S.: Computing critical pairs in 2-dimensional rewriting systems. In: RTA, LIPIcs, vol. 6, pp. 227\u2013242. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"issue":"2:1","key":"6_CR39","first-page":"1","volume":"10","author":"S Mimram","year":"2014","unstructured":"Mimram, S.: Towards 3-dimensional rewriting theory. Logical Methods Comput. Sci. 10(2:1), 1\u201347 (2014)","journal-title":"Logical Methods Comput. Sci."},{"key":"6_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0022525","volume-title":"Mathematical Foundations of Computer Science 1980","author":"P Padawitz","year":"1980","unstructured":"Padawitz, P.: New results on completeness and consistency of abstract data types. In: Dembi\u0144ski, P. (ed.) MFCS 1980. LNCS, vol. 88, pp. 460\u2013473. Springer, Heidelberg (1980). doi:10.1007\/BFb0022525"},{"key":"6_CR41","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ic.2013.03.007","volume":"226","author":"D Pavlovic","year":"2013","unstructured":"Pavlovic, D.: Monoidal computer I: basic computability by string diagrams. Inf. Comput. 226, 94\u2013116 (2013)","journal-title":"Inf. Comput."},{"key":"6_CR42","unstructured":"Plump, D.: Hypergraph rewriting: critical pairs and undecidability of confluence. In: Term Graph Rewriting: Theory and Practice, pp. 201\u2013213. Wiley (1993)"},{"key":"6_CR43","unstructured":"Plump, D.: Checking graph-transformation systems for confluence. In: Manipulation of Graphs, Algebras and Pictures, ECEASST, vol. 26. EASST (2010)"},{"key":"6_CR44","doi-asserted-by":"crossref","unstructured":"Sassone, V., Soboci\u0144ski, P.: Reactive systems over cospans. In: LiCS 2005, pp. 311\u2013320. ACM (2005)","DOI":"10.1109\/LICS.2005.40"},{"key":"6_CR45","series-title":"Lecture Notes in Physics","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-12821-9_4","volume-title":"New Structures for Physics","author":"P Selinger","year":"2011","unstructured":"Selinger, P.: A survey of graphical languages for monoidal categories. In: Coecke, B. (ed.) New Structures for Physics. LNP, vol. 813, pp. 289\u2013355. Springer, Heidelberg (2011)"},{"key":"6_CR46","unstructured":"Soboci\u0144ski, P.: Deriving process congruences from reaction rules. Ph.D. thesis, BRICS, University of Aarhus (2004)"},{"key":"6_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-319-07734-5_9","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"P Soboci\u0144ski","year":"2014","unstructured":"Soboci\u0144ski, P., Stephens, O.: A programming language for spatial distribution of net systems. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol. 8489, pp. 150\u2013169. Springer, Heidelberg (2014). doi:10.1007\/978-3-319-07734-5_9"},{"issue":"2","key":"6_CR48","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0022-4049(76)90013-X","volume":"8","author":"R Street","year":"1976","unstructured":"Street, R.: Limits indexed by category-valued 2-functors. J. Pure Appl. Algebra 8(2), 149\u2013181 (1976)","journal-title":"J. Pure Appl. Algebra"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T01:40:55Z","timestamp":1750124455000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-54434-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662544334","9783662544341"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54434-1_6","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"}]}}