{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:20:48Z","timestamp":1742923248418,"version":"3.40.3"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030171834"},{"type":"electronic","value":"9783030171841"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17184-1_27","type":"book-chapter","created":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T17:34:04Z","timestamp":1554572044000},"page":"752-782","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Static Higher-Order Dependency Pair Framework"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Fuhs","sequence":"first","affiliation":[]},{"given":"Cynthia","family":"Kop","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"27_CR1","unstructured":"Aczel, P.: A general Church-Rosser theorem. Unpublished Manuscript, University of Manchester (1978)"},{"issue":"1\u20132","key":"27_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1\u20132), 133\u2013178 (2000). \n                      https:\/\/doi.org\/10.1016\/S0304-3975(99)00207-8","journal-title":"Theor. Comput. Sci."},{"key":"27_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1998","unstructured":"Baader, F., Nipkow, F.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1093\/logcom\/4.3.217","volume":"4","author":"L Bachmair","year":"1994","unstructured":"Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. J. Logic Comput. 4(3), 217\u2013247 (1994). \n                      https:\/\/doi.org\/10.1093\/logcom\/4.3.217","journal-title":"J. Logic Comput."},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/10721975_4","volume-title":"Rewriting Techniques and Applications","author":"F Blanqui","year":"2000","unstructured":"Blanqui, F.: Termination and confluence of higher-order rewrite systems. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol. 1833, pp. 47\u201361. Springer, Heidelberg (2000). \n                      https:\/\/doi.org\/10.1007\/10721975_4"},{"key":"27_CR6","unstructured":"Blanqui, F.: Higher-order dependency pairs. In: Proceedings of the WST 2006 (2006)"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2015.07.045","volume":"611","author":"F Blanqui","year":"2016","unstructured":"Blanqui, F.: Termination of rewrite relations on \n                      \n                        \n                      \n                      $$\\lambda $$\n                    -terms based on Girard\u2019s notion of reducibility. Theor. Comput. Sci. 611, 50\u201386 (2016). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2015.07.045","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"27_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0304-3975(00)00347-9","volume":"272","author":"F Blanqui","year":"2002","unstructured":"Blanqui, F., Jouannaud, J., Okada, M.: Inductive-data-type systems. Theor. Comput. Sci. 272(1\u20132), 41\u201368 (2002). \n                      https:\/\/doi.org\/10.1016\/S0304-3975(00)00347-9","journal-title":"Theor. Comput. Sci."},{"key":"27_CR9","doi-asserted-by":"publisher","unstructured":"Blanqui, F., Jouannaud, J., Rubio, A.: The computability path ordering. Logical Methods Comput. Sci. 11(4) (2015). \n                      https:\/\/doi.org\/10.2168\/LMCS-11(4:3)2015","DOI":"10.2168\/LMCS-11(4:3)2015"},{"key":"27_CR10","unstructured":"Community. The International Confluence Competition (CoCo) (2018). \n                      http:\/\/project-coco.uibk.ac.at\/"},{"key":"27_CR11","doi-asserted-by":"publisher","unstructured":"Dershowitz, N., Kaplan, S.: Rewrite, rewrite, rewrite, rewrite, rewrite. In: Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, USA, 11\u201313 January 1989, pp. 250\u2013259. ACM Press (1989). \n                      https:\/\/doi.org\/10.1145\/75277.75299","DOI":"10.1145\/75277.75299"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-31365-3_19","volume-title":"Automated Reasoning","author":"F Emmes","year":"2012","unstructured":"Emmes, F., Enger, T., Giesl, J.: Proving non-looping non-termination automatically. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 225\u2013240. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-31365-3_19"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-24364-6_11","volume-title":"Frontiers of Combining Systems","author":"C Fuhs","year":"2011","unstructured":"Fuhs, C., Kop, C.: Harnessing first order termination provers using higher order dependency pairs. In: Tinelli, C., Sofronie-Stokkermans, V. (eds.) FroCoS 2011. LNCS (LNAI), vol. 6989, pp. 147\u2013162. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-24364-6_11"},{"key":"27_CR15","doi-asserted-by":"publisher","unstructured":"Fuhs, C., Kop, C.: Polynomial interpretations for higher-order rewriting. In: Tiwari, A. (ed.) 23rd International Conference on Rewriting Techniques and Applications (RTA 2012) , RTA 2012. LIPIcs, vol. 15, Nagoya, Japan, 28 May\u20132 June 2012. pp. 176\u2013192. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2012.176","DOI":"10.4230\/LIPIcs.RTA.2012.176"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-319-08918-8_17","volume-title":"Rewriting and Typed Lambda Calculi","author":"C Fuhs","year":"2014","unstructured":"Fuhs, C., Kop, C.: First-order formative rules. In: Dowek, G. (ed.) RTA 2014. LNCS, vol. 8560, pp. 240\u2013256. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-08918-8_17"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Fuhs, C., Kop, C.: A static higher-order dependency pair framework (extended version). Technical report \n                      arXiv:1902.06733\n                      \n                     [cs.LO], CoRR (2019)","DOI":"10.1007\/978-3-030-17184-1_27"},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/3060143","volume":"18","author":"C Fuhs","year":"2017","unstructured":"Fuhs, C., Kop, C., Nishida, N.: Verifying procedural programs via constrained rewriting induction. ACM Trans. Comput. Logic 18(2), 14:1\u201314:50 (2017). \n                      https:\/\/doi.org\/10.1145\/3060143","journal-title":"ACM Trans. Comput. Logic"},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10817-016-9388-y","volume":"58","author":"J Giesl","year":"2017","unstructured":"Giesl, J., et al.: Analyzing program termination and complexity automatically with AProVE. J. Autom. Reasoning 58(1), 3\u201331 (2017). \n                      https:\/\/doi.org\/10.1007\/s10817-016-9388-y","journal-title":"J. Autom. Reasoning"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-32275-7_21","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J Giesl","year":"2005","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: combining techniques for automated termination proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3452, pp. 301\u2013331. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/978-3-540-32275-7_21"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/11559306_12","volume-title":"Frontiers of Combining Systems","author":"J Giesl","year":"2005","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and disproving termination of higher-order functions. In: Gramlich, B. (ed.) FroCoS 2005. LNCS (LNAI), vol. 3717, pp. 216\u2013231. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11559306_12"},{"issue":"3","key":"27_CR22","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10817-006-9057-7","volume":"37","author":"J Giesl","year":"2006","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. J. Autom. Reasoning 37(3), 155\u2013203 (2006). \n                      https:\/\/doi.org\/10.1007\/s10817-006-9057-7","journal-title":"J. Autom. Reasoning"},{"key":"27_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-12251-4_9","volume-title":"Functional and Logic Programming","author":"F Haftmann","year":"2010","unstructured":"Haftmann, F., Nipkow, T.: Code generation via higher-order rewrite systems. In: Blume, M., Kobayashi, N., Vidal, G. (eds.) FLOPS 2010. LNCS, vol. 6009, pp. 103\u2013117. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-12251-4_9"},{"issue":"4","key":"27_CR24","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.ic.2006.08.010","volume":"205","author":"N Hirokawa","year":"2007","unstructured":"Hirokawa, N., Middeldorp, A.: Tyrolean termination tool: techniques and features. Inf. Comput. 205(4), 474\u2013511 (2007). \n                      https:\/\/doi.org\/10.1016\/j.ic.2006.08.010","journal-title":"Inf. Comput."},{"key":"27_CR25","doi-asserted-by":"publisher","unstructured":"Hoe, J.C., Arvind: Hardware synthesis from term rewriting systems. In: Silveira, L.M., Devadas, S., Reis, R. (eds.) VLSI: Systems on a Chip. IFIPAICT, vol. 34, pp. 595\u2013619. Springer, Boston (2000). \n                      https:\/\/doi.org\/10.1007\/978-0-387-35498-9_52","DOI":"10.1007\/978-0-387-35498-9_52"},{"key":"27_CR26","doi-asserted-by":"publisher","unstructured":"Jouannaud, J., Rubio, A.: The higher-order recursive path ordering. In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, 2\u20135 July 1999, pp. 402\u2013411. IEEE Computer Society (1999). \n                      https:\/\/doi.org\/10.1109\/LICS.1999.782635","DOI":"10.1109\/LICS.1999.782635"},{"issue":"1\u20132","key":"27_CR27","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","volume":"121","author":"J Klop","year":"1993","unstructured":"Klop, J., Oostrom, V.V., Raamsdonk, F.V.: Combinatory reduction systems: introduction and survey. Theor. Comput. Sci. 121(1\u20132), 279\u2013308 (1993). \n                      https:\/\/doi.org\/10.1016\/0304-3975(93)90091-7","journal-title":"Theor. Comput. Sci."},{"key":"27_CR28","unstructured":"Kop, C.: WANDA - a higher-order termination tool. \n                      http:\/\/wandahot.sourceforge.net\/"},{"key":"27_CR29","unstructured":"Kop, C.: Higher order termination. Ph.D. thesis, VU Amsterdam (2012)"},{"key":"27_CR30","doi-asserted-by":"publisher","unstructured":"Kop, C., van Raamsdonk, F.: Higher order dependency pairs for algebraic functional systems. In: Schmidt-Schau\u00df, M. (ed.) Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, RTA 2011. LIPIcs, vol. 10, Novi Sad, Serbia, 30 May\u20131 June 2011, pp. 203\u2013218. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2011.203","DOI":"10.4230\/LIPIcs.RTA.2011.203"},{"issue":"2","key":"27_CR31","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.2168\/LMCS-8(2:10)2012","volume":"8","author":"C Kop","year":"2012","unstructured":"Kop, C., van Raamsdonk, F.: Dynamic dependency pairs for algebraic functional systems. Logical Methods Comput. Sci. 8(2), 10:1\u201310:51 (2012). \n                      https:\/\/doi.org\/10.2168\/LMCS-8(2:10)2012","journal-title":"Logical Methods Comput. Sci."},{"key":"27_CR32","doi-asserted-by":"publisher","unstructured":"Kusakari, K.: Static dependency pair method in rewriting systems for functional programs with product, algebraic data, and ML-polymorphic types. IEICE Trans. 96-D(3), 472\u2013480 (2013). \n                      https:\/\/doi.org\/10.1587\/transinf.E96.D.472","DOI":"10.1587\/transinf.E96.D.472"},{"issue":"6","key":"27_CR33","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1587\/transinf.2017FOP0004","volume":"E101.D","author":"K Kusakari","year":"2018","unstructured":"Kusakari, K.: Static dependency pair method in functional programs. IEICE Trans. Inf. Syst. E101.D(6), 1491\u20131502 (2018). \n                      https:\/\/doi.org\/10.1587\/transinf.2017FOP0004","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"10","key":"27_CR34","doi-asserted-by":"publisher","first-page":"2007","DOI":"10.1587\/transinf.E92.D.2007","volume":"92","author":"K Kusakari","year":"2009","unstructured":"Kusakari, K., Isogai, Y., Sakai, M., Blanqui, F.: Static dependency pair method based on strong computability for higher-order rewrite systems. IEICE Trans. Inf. Syst. 92(10), 2007\u20132015 (2009). \n                      https:\/\/doi.org\/10.1587\/transinf.E92.D.2007","journal-title":"IEICE Trans. Inf. Syst."},{"key":"27_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/10704567_3","volume-title":"Principles and Practice of Declarative Programming","author":"K Kusakari","year":"1999","unstructured":"Kusakari, K., Nakamura, M., Toyama, Y.: Argument filtering transformation. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol. 1702, pp. 47\u201361. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/10704567_3"},{"issue":"1","key":"27_CR36","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3233\/JCS-1992-1102","volume":"1","author":"CA Meadows","year":"1992","unstructured":"Meadows, C.A.: Applying formal methods to the analysis of a key management protocol. J. Comput. Secur. 1(1), 5\u201336 (1992). \n                      https:\/\/doi.org\/10.3233\/JCS-1992-1102","journal-title":"J. Comput. Secur."},{"issue":"4","key":"27_CR37","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D Miller","year":"1991","unstructured":"Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. J. Logic Comput. 1(4), 497\u2013536 (1991). \n                      https:\/\/doi.org\/10.1093\/logcom\/1.4.497","journal-title":"J. Logic Comput."},{"key":"27_CR38","unstructured":"Nagele, J.: CoCo 2018 participant: CSI\n                      \n                        \n                      \n                      $$^{\\wedge }$$\n                    ho 0.2 (2018). \n                      http:\/\/project-coco.uibk.ac.at\/2018\/papers\/csiho.pdf"},{"key":"27_CR39","doi-asserted-by":"publisher","unstructured":"Nipkow, T.: Higher-order critical pairs. In: Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS 1991), Amsterdam, The Netherlands, 15\u201318 July 1991, pp. 342\u2013349. IEEE Computer Society (1991). \n                      https:\/\/doi.org\/10.1109\/LICS.1991.151658","DOI":"10.1109\/LICS.1991.151658"},{"key":"27_CR40","unstructured":"Onozawa, K., Kikuchi, K., Aoto, T., Toyama, Y.: ACPH: system description for CoCo 2017 (2017). \n                      http:\/\/project-coco.uibk.ac.at\/2017\/papers\/acph.pdf"},{"key":"27_CR41","doi-asserted-by":"publisher","unstructured":"Otto, C., Brockschmidt, M., von Essen, C., Giesl, J.: Automated termination analysis of Java Bytecode by term rewriting. In: Lynch, C. (ed.) Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010. LIPIcs, vol. 6, Edinburgh, Scottland, UK, 11\u201313 July 2010, pp. 259\u2013276. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2010.259","DOI":"10.4230\/LIPIcs.RTA.2010.259"},{"issue":"2\u20133","key":"27_CR42","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.tcs.2008.05.013","volume":"403","author":"\u00c9 Payet","year":"2008","unstructured":"Payet, \u00c9.: Loop detection in term rewriting using the eliminating unfoldings. Theor. Comput. Sci. 403(2\u20133), 307\u2013327 (2008). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2008.05.013","journal-title":"Theor. Comput. Sci."},{"key":"27_CR43","unstructured":"van de Pol, J.: Termination of higher-order rewrite systems. Ph.D. thesis, University of Utrecht (1996)"},{"key":"27_CR44","doi-asserted-by":"crossref","unstructured":"Sakai, M., Kusakari, K.: On dependency pair method for proving termination of higher-order rewrite systems. IEICE Trans. Inf. Syst. E88-D(3), 583\u2013593 (2005)","DOI":"10.1093\/ietisy\/e88-d.3.583"},{"key":"27_CR45","unstructured":"Sakai, M., Watanabe, Y., Sakabe, T.: An extension of the dependency pair method for proving termination of higher-order rewrite systems. IEICE Trans. Inf. Syst. E84-D(8), 1025\u20131032 (2001)"},{"issue":"2","key":"27_CR46","first-page":"1","volume":"4","author":"S Suzuki","year":"2011","unstructured":"Suzuki, S., Kusakari, K., Blanqui, F.: Argument filterings and usable rules in higher-order rewrite systems. IPSJ Trans. Program. 4(2), 1\u201312 (2011)","journal-title":"IPSJ Trans. Program."},{"issue":"2","key":"27_CR47","doi-asserted-by":"publisher","first-page":"187","DOI":"10.2307\/2271658","volume":"32","author":"W Tait","year":"1967","unstructured":"Tait, W.: Intensional interpretation of functionals of finite type. J. Symbolic Logic 32(2), 187\u2013199 (1967)","journal-title":"J. Symbolic Logic"},{"key":"27_CR48","unstructured":"Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)"},{"key":"27_CR49","unstructured":"Wiki: Termination Problems DataBase (TPDB). \n                      http:\/\/termination-portal.org\/wiki\/TPDB"},{"key":"27_CR50","unstructured":"Wiki: The International Termination Competition (TermComp) (2018). \n                      http:\/\/termination-portal.org\/wiki\/Termination_Competition"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17184-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:24:02Z","timestamp":1558344242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17184-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030171834","9783030171841"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17184-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"8 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/esop","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}