{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:41:23Z","timestamp":1742982083730,"version":"3.40.3"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030988685"},{"type":"electronic","value":"9783030988692"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-98869-2_6","type":"book-chapter","created":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T08:05:48Z","timestamp":1647072348000},"page":"92-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Substructural Property-Based Testing"],"prefix":"10.1007","author":[{"given":"Marco","family":"Mantovani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0942-4777","authenticated-orcid":false,"given":"Alberto","family":"Momigliano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,13]]},"reference":[{"issue":"2","key":"6_CR1","first-page":"1","volume":"7","author":"D Baelde","year":"2014","unstructured":"Baelde, D., et al.: Abella: a system for reasoning about relational specifications. J. Formaliz. Reason. 7(2), 1\u201389 (2014)","journal-title":"J. Formaliz. Reason."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-24364-6_2","volume-title":"Frontiers of Combining Systems","author":"JC Blanchette","year":"2011","unstructured":"Blanchette, J.C., Bulwahn, L., Nipkow, T.: Automatic proof and disproof in Isabelle\/HOL. In: Tinelli, C., Sofronie-Stokkermans, V. (eds.) FroCoS 2011. LNCS (LNAI), vol. 6989, pp. 12\u201327. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24364-6_2"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-63046-5_16","volume-title":"Automated Deduction \u2013 CADE 26","author":"R Blanco","year":"2017","unstructured":"Blanco, R., Chihani, Z., Miller, D.: Translating between implicit and explicit versions of proof. In: de Moura, L. (ed.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 255\u2013273. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63046-5_16"},{"doi-asserted-by":"crossref","unstructured":"Blanco, R., Miller, D., Momigliano, A.: Property-based testing via proof reconstruction. In: PPDP, pp. 5:1\u20135:13. ACM (2019)","key":"6_CR4","DOI":"10.1145\/3354166.3354170"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-35308-6_10","volume-title":"Certified Programs and Proofs","author":"L Bulwahn","year":"2012","unstructured":"Bulwahn, L.: The new Quickcheck for Isabelle. In: Hawblitzel, C., Miller, D. (eds.) CPP 2012. LNCS, vol. 7679, pp. 92\u2013108. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35308-6_10"},{"issue":"1\u20132","key":"6_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00173-5","volume":"232","author":"I Cervesato","year":"2000","unstructured":"Cervesato, I., Hodas, J.S., Pfenning, F.: Efficient resource management for linear logic proof search. Theor. Comput. Sci. 232(1\u20132), 133\u2013163 (2000)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Cervesato, I., Pfenning, F.: A linear logical framework. In: LICS, pp. 264\u2013275. IEEE Computer Society (1996)","key":"6_CR7","DOI":"10.1109\/LICS.1996.561339"},{"doi-asserted-by":"crossref","unstructured":"Cervesato, I., Pfenning, F., Walker, D., Watkins, K.: A concurrent logical framework ii: examples and applications. Technical report, CMU (2002)","key":"6_CR8","DOI":"10.21236\/ADA418538"},{"doi-asserted-by":"crossref","unstructured":"Cheney, J.: Toward a general theory of names: binding and scope. In: MERLIN, pp. 33\u201340. ACM (2005)","key":"6_CR9","DOI":"10.1145\/1088454.1088459"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1017\/S1471068417000035","volume":"17","author":"J Cheney","year":"2017","unstructured":"Cheney, J., Momigliano, A.: $$\\alpha $$Check: a mechanized metatheory model checker. Theory Pract. Logic Program. 17(3), 311\u2013352 (2017)","journal-title":"Theory Pract. Logic Program."},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-319-41135-4_3","volume-title":"Tests and Proofs","author":"J Cheney","year":"2016","unstructured":"Cheney, J., Momigliano, A., Pessina, M.: Advances in property-based testing for $$\\alpha $$Prolog. In: Aichernig, B.K.K., Furia, C.A.A. (eds.) TAP 2016. LNCS, vol. 9762, pp. 37\u201356. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41135-4_3"},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10817-016-9380-6","volume":"59","author":"Z Chihani","year":"2017","unstructured":"Chihani, Z., Miller, D., Renaud, F.: A semantic framework for proof evidence. J. Autom. Reason. 59(3), 287\u2013330 (2017)","journal-title":"J. Autom. Reason."},{"unstructured":"Chirimar, J.: Proof theoretic approach to specification languages. Ph.D. thesis. University of Pennsylvania (1995)","key":"6_CR13"},{"doi-asserted-by":"crossref","unstructured":"Claessen, K., Hughes, J.: QuickCheck: a lightweight tool for random testing of Haskell programs. In: Proceedings of the 2000 ACM SIGPLAN International Conference on Functional Programming (ICFP 2000), pp. 268\u2013279. ACM (2000)","key":"6_CR14","DOI":"10.1145\/357766.351266"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44659-1_9","volume-title":"Theorem Proving in Higher Order Logics","author":"C Dubois","year":"2000","unstructured":"Dubois, C.: Proving ML type soundness within Coq. In: Aagaard, M., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol. 1869, pp. 126\u2013144. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44659-1_9"},{"key":"6_CR16","volume-title":"Semantics Engineering with PLT Redex","author":"M Felleisen","year":"2009","unstructured":"Felleisen, M., Findler, R.B., Flatt, M.: Semantics Engineering with PLT Redex. The MIT Press, Cambridge (2009)"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10817-010-9194-x","volume":"48","author":"AP Felty","year":"2012","unstructured":"Felty, A.P., Momigliano, A.: Hybrid - a definitional two-level approach to reasoning with higher-order abstract syntax. J. Autom. Reason. 48(1), 43\u2013105 (2012)","journal-title":"J. Autom. Reason."},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-662-46669-8_16","volume-title":"Programming Languages and Systems","author":"B Fetscher","year":"2015","unstructured":"Fetscher, B., Claessen, K., Pa\u0142ka, M., Hughes, J., Findler, R.B.: Making random judgments: automatically generating well-typed terms from the definition of a type-system. In: Vitek, J. (ed.) ESOP 2015. LNCS, vol. 9032, pp. 383\u2013405. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46669-8_16"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10817-011-9218-1","volume":"49","author":"A Gacek","year":"2012","unstructured":"Gacek, A., Miller, D., Nadathur, G.: A two-level logic approach to reasoning about computations. J. Autom. Reason. 49(2), 241\u2013273 (2012)","journal-title":"J. Autom. Reason."},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-662-54434-1_20","volume-title":"Programming Languages and Systems","author":"AL Georges","year":"2017","unstructured":"Georges, A.L., Murawska, A., Otis, S., Pientka, B.: LINCX: a linear logical framework with first-class contexts. In: Yang, H. (ed.) ESOP 2017. LNCS, vol. 10201, pp. 530\u2013555. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54434-1_20"},{"issue":"1","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50(1), 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/inco.1994.1036","volume":"110","author":"J Hodas","year":"1994","unstructured":"Hodas, J., Miller, D.: Logic programming in a fragment of intuitionistic linear logic. Inf. Comput. 110(2), 327\u2013365 (1994)","journal-title":"Inf. Comput."},{"doi-asserted-by":"crossref","unstructured":"Hritcu, C., et al.: Testing noninterference, quickly. In: Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming, ICFP 2013, pp. 455\u2013468. ACM, New York, NY, USA (2013)","key":"6_CR23","DOI":"10.1145\/2500365.2500574"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-69611-7_1","volume-title":"Practical Aspects of Declarative Languages","author":"J Hughes","year":"2006","unstructured":"Hughes, J.: QuickCheck testing for fun and profit. In: Hanus, M. (ed.) PADL 2007. LNCS, vol. 4354, pp. 1\u201332. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/978-3-540-69611-7_1"},{"issue":"5","key":"6_CR25","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1109\/TSE.2010.62","volume":"37","author":"Y Jia","year":"2011","unstructured":"Jia, Y., Harman, M.: An analysis and survey of the development of mutation testing. IEEE Trans. Softw. Eng. 37(5), 649\u2013678 (2011)","journal-title":"IEEE Trans. Softw. Eng."},{"doi-asserted-by":"crossref","unstructured":"Klein, C., et al.: Run your research: on the effectiveness of lightweight mechanization. In: Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201912, pp. 285\u2013296. ACM, New York, NY, USA (2012)","key":"6_CR26","DOI":"10.1145\/2103656.2103691"},{"unstructured":"Leroy, X.: Mechanized semantics - with applications to program proof and compiler verification. In: Logics and Languages for Reliability and Security, volume 25 of NATO Science for Peace and Security Series - D: Information and Communication Security, pp. 195\u2013224. IOS Press (2010)","key":"6_CR27"},{"issue":"46","key":"6_CR28","doi-asserted-by":"publisher","first-page":"4747","DOI":"10.1016\/j.tcs.2009.07.041","volume":"410","author":"C Liang","year":"2009","unstructured":"Liang, C., Miller, D.: Focusing and polarization in linear, intuitionistic, and classical logics. Theor. Comput. Sci. 410(46), 4747\u20134768 (2009)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"L\u00f3pez, P., Pfenning, F., Polakow, J., Watkins, K.: Monadic concurrent linear logic programming. In: PPDP, pp. 35\u201346. ACM (2005)","key":"6_CR29","DOI":"10.1145\/1069774.1069778"},{"issue":"4","key":"6_CR30","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1007\/s10817-019-09527-x","volume":"63","author":"MY Mahmoud","year":"2019","unstructured":"Mahmoud, M.Y., Felty, A.P.: Formalization of metatheory of the quipper quantum programming language in a linear logic. J. Autom. Reason. 63(4), 967\u20131002 (2019)","journal-title":"J. Autom. Reason."},{"unstructured":"Manighetti, M., Miller, D., Momigliano, A.: Two applications of logic programming to Coq. In: TYPES, volume 188 of LIPIcs, pp. 10:1\u201310:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)","key":"6_CR31"},{"unstructured":"Martin, A.: Reasoning using higher-order abstract syntax in a higher-order logic proof environment: improvements to hybrid and a case study. Ph.D. thesis. University of Ottawa (2010). https:\/\/ruor.uottawa.ca\/handle\/10393\/19711","key":"6_CR32"},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.entcs.2007.11.016","volume":"199","author":"A McCreight","year":"2008","unstructured":"McCreight, A., Sch\u00fcrmann, C.: A meta linear logical framework. Electron. Notes Theor. Comput. Sci. 199, 129\u2013147 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"6_CR34","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/504077.504080","volume":"3","author":"R McDowell","year":"2002","unstructured":"McDowell, R., Miller, D.: Reasoning with higher-order abstract syntax in a logical framework. ACM Trans. Comput. Log. 3(1), 80\u2013136 (2002)","journal-title":"ACM Trans. Comput. Log."},{"key":"6_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BFb0013612","volume-title":"Extensions of Logic Programming","author":"S Michaylov","year":"1992","unstructured":"Michaylov, S., Pfenning, F.: Natural semantics and some of its meta-theory in Elf. In: Eriksson, L.-H., Halln\u00e4s, L., Schroeder-Heister, P. (eds.) ELP 1991. LNCS, vol. 596, pp. 299\u2013344. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0013612"},{"issue":"1","key":"6_CR36","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(96)00045-X","volume":"165","author":"D Miller","year":"1996","unstructured":"Miller, D.: Forum: a multiple-conclusion specification logic. Theor. Comput. Sci. 165(1), 201\u2013232 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR37","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D Miller","year":"1991","unstructured":"Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Ann. Pure Appl. Log. 51, 125\u2013157 (1991)","journal-title":"Ann. Pure Appl. Log."},{"unstructured":"Momigliano, A., Ornaghi, M.: The blame game for property-based testing. In: CILC, volume 2396 of CEUR Workshop Proceedings, pp. 4\u201313. CEUR-WS.org (2019)","key":"6_CR38"},{"issue":"3","key":"6_CR39","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/319301.319345","volume":"21","author":"JG Morrisett","year":"1999","unstructured":"Morrisett, J.G., Walker, D., Crary, K., Glew, N.: From system F to typed assembly language. ACM Trans. Program. Lang. Syst. 21(3), 527\u2013568 (1999)","journal-title":"ACM Trans. Program. Lang. Syst."},{"doi-asserted-by":"crossref","unstructured":"Nigam, V., Miller, D.: Algorithmic specifications in linear logic with subexponentials. In: PPDP, pp. 129\u2013140. ACM (2009)","key":"6_CR40","DOI":"10.1145\/1599410.1599427"},{"doi-asserted-by":"crossref","unstructured":"Paoli, F.: Substructural Logics: A Primer. Kluwer, Alphen aan den Rijn (2002)","key":"6_CR41","DOI":"10.1007\/978-94-017-3179-9"},{"key":"6_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-319-22102-1_22","volume-title":"Interactive Theorem Proving","author":"Z Paraskevopoulou","year":"2015","unstructured":"Paraskevopoulou, Z., Hri\u0163cu, C., D\u00e9n\u00e8s, M., Lampropoulos, L., Pierce, B.C.: Foundational property-based testing. In: Urban, C., Zhang, X. (eds.) ITP 2015. LNCS, vol. 9236, pp. 325\u2013343. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22102-1_22"},{"unstructured":"Pfenning, F.: Logical frameworks. In: Robinson, A., Voronkov, A. (eds.), Handbook of Automated Reasoning. Elsevier Science Publishers (1999)","key":"6_CR43"},{"doi-asserted-by":"crossref","unstructured":"Pfenning, F., Simmons, R.J.: Substructural operational semantics as ordered logic programming. In: LICS, pp. 101\u2013110. IEEE Computer Society (2009)","key":"6_CR44","DOI":"10.1109\/LICS.2009.8"},{"key":"6_CR45","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-14203-1_2","volume-title":"Automated Reasoning","author":"B Pientka","year":"2010","unstructured":"Pientka, B., Dunfield, J.: Beluga: a framework for programming and reasoning with deductive systems (system description). In: Giesl, J., H\u00e4hnle, R. (eds.) IJCAR 2010. LNCS (LNAI), vol. 6173, pp. 15\u201321. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14203-1_2"},{"doi-asserted-by":"crossref","unstructured":"Polakow, J.: Linear logic programming with an ordered context. In: PPDP, pp. 68\u201379. ACM (2000)","key":"6_CR46","DOI":"10.1145\/351268.351277"},{"issue":"3\u20134","key":"6_CR47","first-page":"233","volume":"6","author":"JC Reynolds","year":"1993","unstructured":"Reynolds, J.C.: The discoveries of continuations. LISP Symb. Comput. 6(3\u20134), 233\u2013248 (1993)","journal-title":"LISP Symb. Comput."},{"doi-asserted-by":"crossref","unstructured":"Roberson, M., Harries, M., Darga, P.T., Boyapati, C.: Efficient software model checking of soundness of type systems. In: Harris, G.E. (ed.), OOPSLA, pp. 493\u2013504. ACM (2008)","key":"6_CR48","DOI":"10.1145\/1449955.1449803"},{"key":"6_CR49","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-71070-7_28","volume-title":"Automated Reasoning","author":"A Schack-Nielsen","year":"2008","unstructured":"Schack-Nielsen, A., Sch\u00fcrmann, C.: Celf \u2013 a logical framework for deductive and concurrent systems (system description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 320\u2013326. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71070-7_28"},{"key":"6_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-05998-9_8","volume-title":"Practical Aspects of Declarative Languages","author":"P Tarau","year":"2019","unstructured":"Tarau, P.: A combinatorial testing framework for intuitionistic propositional theorem provers. In: Alferes, J.J., Johansson, M. (eds.) PADL 2019. LNCS, vol. 11372, pp. 115\u2013132. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05998-9_8"},{"unstructured":"Wadler, P.: Linear types can change the world! In: Programming Concepts and Methods, p. 561. North-Holland (1990)","key":"6_CR51"},{"issue":"2","key":"6_CR52","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0743-1066(91)80002-U","volume":"10","author":"E Yardeni","year":"1991","unstructured":"Yardeni, E., Shapiro, E.: A type system for logic programs. J. Log. Program. 10(2), 125\u2013153 (1991)","journal-title":"J. Log. Program."}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-98869-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T04:25:02Z","timestamp":1726806302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-98869-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030988685","9783030988692"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-98869-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tallinn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Estonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/saks.iasi.cnr.it\/lopstr21\/","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - 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 (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 Invited talk is also included in the proceedings.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}