{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:47:59Z","timestamp":1764996479213,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031367083"},{"type":"electronic","value":"9783031367090"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36709-0_2","type":"book-chapter","created":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T18:03:02Z","timestamp":1689271382000},"page":"22-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Specification and\u00a0Verification of\u00a0a\u00a0Linear-Time Temporal Logic for\u00a0Graph Transformation"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Gadducci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Laretto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Trotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-71998-4_1","volume-title":"Recent Trends in Algebraic Development Techniques","author":"P Baldan","year":"2007","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B., Lluch Lafuente, A.: A temporal graph logic for verification of graph transformation systems. In: Fiadeiro, J.L., Schobbens, P.-Y. (eds.) WADT 2006. LNCS, vol. 4409, pp. 1\u201320. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71998-4_1"},{"key":"2_CR2","unstructured":"Belardinelli, F.: Quantified Modal Logic and the Ontology of Physical Objects. Ph.D. work, Scuola Normale Superiore of Pisa (2004\u20132005)"},{"key":"2_CR3","unstructured":"Blackburn, P., van Benthem, J., Wolter, F. (eds.): Handbook of Modal Logic, vol. 3. North Holland (2007)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"B\u00far, M., Marussy, K., Meyer, B.H., Varr\u00f3, D.: Worst-case execution time calculation for query-based monitors by witness generation. ACM Trans. Embed. Comput. Syst. 20(6), 1\u201336 (2021)","DOI":"10.1145\/3471904"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11560548_16","volume-title":"Correct Hardware Design and Verification Methods","author":"D Bustan","year":"2005","unstructured":"Bustan, D., Flaisher, A., Grumberg, O., Kupferman, O., Vardi, M.Y.: Regular vacuity. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 191\u2013206. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11560548_16"},{"key":"2_CR6","unstructured":"Coq Development Team: The Coq Proof Assistant Reference Manual (2016)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Corradini, A., Heindel, T., Hermann, F., K\u00f6nig, B.: Sesqui-pushout rewriting. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 30\u201345. Springer (2006)","DOI":"10.1007\/11841883_4"},{"issue":"6","key":"2_CR8","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1093\/logcom\/13.6.801","volume":"13","author":"S Coupet-Grimal","year":"2003","unstructured":"Coupet-Grimal, S.: An axiomatization of linear temporal logic in the calculus of inductive constructions. J. Logic Comput. 13(6), 801\u2013813 (2003)","journal-title":"J. Logic Comput."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inform. Comput. 85(1), 12\u201375 (1990)","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. XII. Planar graphs and planar maps. Theor. Comput. Sci. 237(1), 1\u201332 (2000)","DOI":"10.1016\/S0304-3975(99)00305-9"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Danielsson, N.A.: Up-to techniques using sized types. In: POPL 2018, pp. 43:1\u201343:28. ACM (2018)","DOI":"10.1145\/3158131"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.ic.2006.10.006","volume":"205","author":"A Dawar","year":"2007","unstructured":"Dawar, A., Gardner, P., Ghelli, G.: Expressiveness and complexity of graph logic. Inf. Comput. 205(3), 263\u2013310 (2007)","journal-title":"Inf. Comput."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pp. 995\u20131072. Elsevier and MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-39799-8_31","volume-title":"Computer Aided Verification","author":"J Esparza","year":"2013","unstructured":"Esparza, J., Lammich, P., Neumann, R., Nipkow, T., Schimpf, A., Smaus, J.-G.: A fully verified executable LTL model checker. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 463\u2013478. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_31"},{"key":"2_CR15","unstructured":"Franconi, E., Toman, D.: Fixpoint extensions of temporal description logics. In: Calcanese, D., De Giacomo, G., Franconi, E. (eds.) DL 2003. CEUR Workshop Proceedings, vol. 81 (2003)"},{"issue":"1\u20132","key":"2_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.3233\/FI-2012-709","volume":"118","author":"F Gadducci","year":"2012","unstructured":"Gadducci, F., Lluch-Lafuente, A., Vandin, A.: Counterpart semantics for a second-order $$\\mu $$-calculus. Fundamenta Informaticae 118(1\u20132), 177\u2013205 (2012)","journal-title":"Fundamenta Informaticae"},{"key":"2_CR17","unstructured":"Gadducci, F., Trotta, D.: A presheaf semantics for quantified temporal logics. CoRR abs\/2111.03855 (2021)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Gadducci, F., Laretto, A., Trotta, D.: Specification and verification of a linear-time temporal logic for graph transformation. CoRR abs\/2305.03832 (2023)","DOI":"10.1007\/978-3-031-36709-0_2"},{"issue":"1","key":"2_CR19","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10009-011-0186-x","volume":"14","author":"AH Ghamarian","year":"2012","unstructured":"Ghamarian, A.H., de Mol, M., Rensink, A., Zambon, E., Zimakova, M.: Modelling and analysis using GROOVE. Int. J. Softw. Tools Technol. Trans. 14(1), 15\u201340 (2012)","journal-title":"Int. J. Softw. Tools Technol. Trans."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Ghilardi, S., Meloni, G.: Modal and tense predicate logic: models in presheaves and categorical conceptualization. In: Borceux, F. (ed.) Categorical Algebra and its Applications. LNM, vol. 1348, pp. 130\u2013142. Springer (1988)","DOI":"10.1007\/BFb0081355"},{"issue":"3","key":"2_CR21","doi-asserted-by":"publisher","first-page":"843","DOI":"10.2307\/2275788","volume":"61","author":"S Ghilardi","year":"1996","unstructured":"Ghilardi, S., Meloni, G.: Relational and partial variable sets and basic predicate logic. J. Symbol. Logic 61(3), 843\u2013872 (1996)","journal-title":"J. Symbol. Logic"},{"key":"2_CR22","unstructured":"Giacomo, G.D., Vardi, M.Y.: Synthesis for LTL and LDL on finite traces. In: Yang, Q., Wooldridge, M.J. (eds.) IJCAI 2015, pp. 1558\u20131564. AAAI Press (2015)"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-030-16722-6_16","volume-title":"Fundamental Approaches to Software Engineering","author":"H Giese","year":"2019","unstructured":"Giese, H., Maximova, M., Sakizloglou, L., Schneider, S.: Metric temporal graph logic over typed attributed graphs. In: H\u00e4hnle, R., van der Aalst, W. (eds.) FASE 2019. LNCS, vol. 11424, pp. 282\u2013298. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16722-6_16"},{"key":"2_CR24","unstructured":"Girard, J., Lafont, Y., Taylor, P.: Proofs and Types, Cambridge Tracts in Theoretical Computer Science, vol. 7. Cambridge University Press (1989)"},{"issue":"6","key":"2_CR25","doi-asserted-by":"publisher","first-page":"319","DOI":"10.2307\/2025472","volume":"76","author":"A Hazen","year":"1979","unstructured":"Hazen, A.: Counterpart-theoretic semantics for modal logic. J. Philos. 76(6), 319\u2013338 (1979)","journal-title":"J. Philos."},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45653-8_1","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"I Hodkinson","year":"2001","unstructured":"Hodkinson, I., Wolter, F., Zakharyaschev, M.: Monodic fragments of first-order temporal logics: 2000\u20132001 A.D. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 1\u201323. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45653-8_1"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Huang, S., Cleaveland, R.: A tableau construction for finite linear-time temporal logic. J. Logic Algebr. Meth. Program. 125, 100743 (2022)","DOI":"10.1016\/j.jlamp.2021.100743"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Hublet, F., Basin, D., Krsti\u0107, S.: Real-time policy enforcement with metric first-order temporal logic. In: Atluri, V., Di Pietro, R., Jensen, C.D., Meng, W. (eds.) ESORICS 2022. LNCS, vol. 13555, pp. 211\u2013232. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17146-8_11","DOI":"10.1007\/978-3-031-17146-8_11"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Jeffrey, A.: LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs. In: Claessen, K., Swamy, N. (eds.) PLPV 2012, pp. 49\u201360. ACM (2012)","DOI":"10.1145\/2103776.2103783"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-319-19797-5_14","volume-title":"Mathematics of Program Construction","author":"P Kokke","year":"2015","unstructured":"Kokke, P., Swierstra, W.: Auto in Agda. In: Hinze, R., Voigtl\u00e4nder, J. (eds.) MPC 2015. LNCS, vol. 9129, pp. 276\u2013301. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19797-5_14"},{"issue":"5","key":"2_CR31","doi-asserted-by":"publisher","first-page":"113","DOI":"10.2307\/2024555","volume":"65","author":"DK Lewis","year":"1968","unstructured":"Lewis, D.K.: Counterpart theory and quantified modal logic. J. Philos. 65(5), 113\u2013126 (1968)","journal-title":"J. Philos."},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/11617990_10","volume-title":"Types for Proofs and Programs","author":"F Lindblad","year":"2006","unstructured":"Lindblad, F., Benke, M.: A tool for automated theorem proving in Agda. In: Filli\u00e2tre, J.-C., Paulin-Mohring, C., Werner, B. (eds.) TYPES 2004. LNCS, vol. 3839, pp. 154\u2013169. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11617990_10"},{"issue":"3","key":"2_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5381\/jot.2020.19.3.a12","volume":"19","author":"K Marussy","year":"2020","unstructured":"Marussy, K., Semer\u00e1th, O., Babikian, A.A., Varr\u00f3, D.: A specification language for consistent model generation based on partial models. J. Object Technol. 19(3), 1\u201322 (2020)","journal-title":"J. Object Technol."},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-030-79876-5_37","volume-title":"Automated Deduction \u2013 CADE 28","author":"L Moura","year":"2021","unstructured":"Moura, L., Ullrich, S.: The lean 4 theorem prover and programming language. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 625\u2013635. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_37"},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Huerta, Y., Munive, J.J.: Relaxing safety for metric first-order temporal logic via dynamic free variables. In: Dang, T., Stolz, V. (eds.) RV 2022. LNCS, vol. 13498, pp. 45\u201366. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17196-3_3","DOI":"10.1007\/978-3-031-17196-3_3"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL - A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283, pp. 67\u2013104. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45949-9_5","DOI":"10.1007\/3-540-45949-9_5"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Norell, U.: Dependently typed programming in Agda. In: Kennedy, A., Ahmed, A. (eds.) TLDI 2009, pp. 1\u20132. ACM (2009)","DOI":"10.1145\/1481861.1481862"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"O\u2019Connor, L.: Applications of applicative proof search. In: Chapman, J., Swierstra, W. (eds.) TyDe@ICFP 2016, pp. 43\u201355. ACM (2016)","DOI":"10.1145\/2976022.2976030"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Poskitt, C.M., Plump, D.: Monadic second-order incorrectness logic for GP 2. J. Logic Algebr. Meth. Program. 130, 100825 (2023)","DOI":"10.1016\/j.jlamp.2022.100825"},{"key":"2_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-030-32079-9_18","volume-title":"Runtime Verification","author":"J Schneider","year":"2019","unstructured":"Schneider, J., Basin, D., Krsti\u0107, S., Traytel, D.: A formally verified monitor for metric first-order temporal logic. In: Finkbeiner, B., Mariani, L. (eds.) RV 2019. LNCS, vol. 11757, pp. 310\u2013328. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32079-9_18"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Schneider, J., Traytel, D.: Formalization of a monitoring algorithm for metric first-order temporal logic. Archive of Formal Proofs (2019)","DOI":"10.1007\/978-3-030-32079-9_18"},{"issue":"3","key":"2_CR42","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10009-020-00585-w","volume":"23","author":"S Schneider","year":"2021","unstructured":"Schneider, S., Maximova, M., Sakizloglou, L., Giese, H.: Formal testing of timed graph transformation systems using metric temporal graph logic. Int. J. Softw. Tools Technol. Transf. 23(3), 411\u2013488 (2021). https:\/\/doi.org\/10.1007\/s10009-020-00585-w","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"2_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-030-51372-6_16","volume-title":"Graph Transformation","author":"S Schneider","year":"2020","unstructured":"Schneider, S., Sakizloglou, L., Maximova, M., Giese, H.: Optimistic and pessimistic on-the-fly analysis for metric temporal graph logic. In: Gadducci, F., Kehrer, T. (eds.) ICGT 2020. LNCS, vol. 12150, pp. 276\u2013294. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51372-6_16"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"Smid, W., Rensink, A.: Class diagram restructuring with GROOVE. In: Gorp, P.V., Rose, L.M., Krause, C. (eds.) TTC 2013. EPTCS, vol. 135, pp. 83\u201387 (2013)","DOI":"10.4204\/EPTCS.135.10"},{"key":"2_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0054171","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Sprenger","year":"1998","unstructured":"Sprenger, C.: A verified model checker for the modal $$\\mu $$-calculus in Coq. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 167\u2013183. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054171"},{"key":"2_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-030-78946-6_13","volume-title":"Graph Transformation","author":"GS Wulandari","year":"2021","unstructured":"Wulandari, G.S., Plump, D.: Verifying graph programs with monadic second-order logic. In: Gadducci, F., Kehrer, T. (eds.) ICGT 2021. LNCS, vol. 12741, pp. 240\u2013261. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78946-6_13"},{"key":"2_CR47","doi-asserted-by":"publisher","unstructured":"Zambon, E., Rensink, A.: Recipes for coffee: Compositional construction of JAVA control flow graphs in GROOVE. In: M\u00fcller, P., Schaefer, I. (eds.) Principled Software Development. LNCS, pp. 305\u2013323. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98047-8_19","DOI":"10.1007\/978-3-319-98047-8_19"},{"key":"2_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-33296-8_16","volume-title":"Formal Methods: Foundations and Applications","author":"D Zanarini","year":"2012","unstructured":"Zanarini, D., Luna, C., Sierra, L.: Alternating-time temporal logic in the calculus of (Co)inductive constructions. In: Gheyi, R., Naumann, D. (eds.) SBMF 2012. LNCS, vol. 7498, pp. 210\u2013225. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33296-8_16"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36709-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T01:25:56Z","timestamp":1702776356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36709-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031367083","9783031367090"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36709-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"12 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leicester","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/icgt-2023","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":"29","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":"14","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":"2","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":"48% - 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":"3.78","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)"}}]}}