{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:06:52Z","timestamp":1770275212423,"version":"3.49.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030992521","type":"print"},{"value":"9783030992538","type":"electronic"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:00:00Z","timestamp":1648512000000},"content-version":"vor","delay-in-days":87,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Temporal stream logic (TSL) extends LTL with updates and predicates over arbitrary function terms. This allows for specifying data-intensive systems for which LTL is not expressive enough. In the semantics of TSL, functions and predicates are left uninterpreted. In this paper, we extend TSL with first-order theories, enabling us to specify systems using interpreted functions and predicates such as incrementation or equality. We investigate the satisfiability problem of TSL modulo the standard underlying theory of uninterpreted functions as well as with respect to Presburger arithmetic and the theory of equality: For all three theories, TSL satisfiability is neither semi-decidable nor co-semi-decidable. Nevertheless, we identify three fragments of TSL for which the satisfiability problem is (semi-)decidable in the theory of uninterpreted functions. Despite the undecidability, we present an algorithm \u2013 which is not guaranteed to terminate \u2013 for checking the satisfiability of a TSL formula in the theory of uninterpreted functions and evaluate it: It scales well and is able to validate assumptions in a real-world system design.<\/jats:p>","DOI":"10.1007\/978-3-030-99253-8_17","type":"book-chapter","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T20:02:48Z","timestamp":1648497768000},"page":"325-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Temporal Stream Logic modulo Theories"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4280-8441","authenticated-orcid":false,"given":"Bernd","family":"Finkbeiner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5433-8133","authenticated-orcid":false,"given":"Philippe","family":"Heim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7781-043X","authenticated-orcid":false,"given":"Noemi","family":"Passing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,29]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"D\u2019Antoni, L., Ferreira, T., Sammartino, M., Silva, A.: Symbolic Register Automata. In: Dillig, I., Tasiran, S. (eds.) Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I. Lecture Notes in Computer Science, vol. 11561, pp. 3\u201321. Springer (2019), https:\/\/doi.org\/10.1007\/978-3-030-25540-4_1","DOI":"10.1007\/978-3-030-25540-4_1"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"D\u2019Antoni, L., Veanes, M.: The Power of Symbolic Automata and Transducers. In: Majumdar, R., Kuncak, V. (eds.) Computer Aided Verification - 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part I. Lecture Notes in Computer Science, vol. 10426, pp. 47\u201367. Springer (2017), https:\/\/doi.org\/10.1007\/978-3-319-63387-9_3","DOI":"10.1007\/978-3-319-63387-9_3"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"D\u2019Antoni, L., Veanes, M.: Automata modulo Theories. Commun. ACM 64(5), 86\u201395 (2021), https:\/\/doi.org\/10.1145\/3419404","DOI":"10.1145\/3419404"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Demri, S.: Linear-time Temporal Logics with Presburger Constraints: An Overview. J. Appl. Non Class. Logics 16(3-4), 311\u2013348 (2006), https:\/\/doi.org\/10.3166\/jancl.16.311-347","DOI":"10.3166\/jancl.16.311-347"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Demri, S.: LTL Over Integer Periodicity Constraints. Theor. Comput. Sci. 360(1-3), 96\u2013123 (2006), https:\/\/doi.org\/10.1016\/j.tcs.2006.02.019","DOI":"10.1016\/j.tcs.2006.02.019"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Demri, S., D\u2019Souza, D.: An Automata-Theoretic Approach to Constraint LTL. Inf. Comput. 205(3), 380\u2013415 (2007), https:\/\/doi.org\/10.1016\/j.ic.2006.09.006","DOI":"10.1016\/j.ic.2006.09.006"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Demri, S., D\u2019Souza, D., Gascon, R.: A Decidable Temporal Logic of Repeating Values. In: Art\u00ebmov, S.N., Nerode, A. (eds.) Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings. Lecture Notes in Computer Science, vol.\u00a04514, pp. 180\u2013194. Springer (2007), https:\/\/doi.org\/10.1007\/978-3-540-72734-7_13","DOI":"10.1007\/978-3-540-72734-7_13"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Demri, S., Lazic, R.: LTL with the Freeze Quantifier and Register Automata. In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings. pp. 17\u201326. IEEE Computer Society (2006), https:\/\/doi.org\/10.1109\/LICS.2006.31","DOI":"10.1109\/LICS.2006.31"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Demri, S., Lazic, R., Nowak, D.: On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. In: 12th International Symposium on Temporal Representation and Reasoning (TIME 2005), 23-25 June 2005, Burlington, Vermont, USA. pp. 113\u2013121. IEEE Computer Society (2005), https:\/\/doi.org\/10.1109\/TIME.2005.28","DOI":"10.1109\/TIME.2005.28"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Demri, S., Lazic, R., Nowak, D.: On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. In: 12th International Symposium on Temporal Representation and Reasoning (TIME 2005), 23-25 June 2005, Burlington, Vermont, USA. pp. 113\u2013121. IEEE Computer Society (2005), https:\/\/doi.org\/10.1109\/TIME.2005.28","DOI":"10.1109\/TIME.2005.28"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Duret-Lutz, A., Lewkowicz, A., Fauchille, A., Michaud, T., Renault, E., Xu, L.: Spot 2.0 - A Framework for LTL and $$\\omega $$-Automata Manipulation. In: Artho, C., Legay, A., Peled, D. (eds.) Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016, Chiba, Japan, October 17-20, 2016, Proceedings. Lecture Notes in Computer Science, vol. 9938, pp. 122\u2013129 (2016), https:\/\/doi.org\/10.1007\/978-3-319-46520-3_8","DOI":"10.1007\/978-3-319-46520-3_8"},{"key":"17_CR12","unstructured":"Exibard, L., Filiot, E., Reynier, P.: Synthesis of Data Word Transducers. Log. Methods Comput. Sci. 17(1) (2021), https:\/\/lmcs.episciences.org\/7279"},{"key":"17_CR13","unstructured":"Finkbeiner, B., Heim, P., Passing, N.: Temporal Stream Logic modulo Theories. CoRR abs\/2104.14988v1 (2021), https:\/\/arxiv.org\/abs\/2104.14988v1"},{"key":"17_CR14","unstructured":"Finkbeiner, B., Heim, P., Passing, N.: Temporal Stream Logic modulo Theories (Full Version). CoRR abs\/2104.14988v2 (2021), https:\/\/arxiv.org\/abs\/2104.14988v2"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Finkbeiner, B., Klein, F., Piskac, R., Santolucito, M.: Temporal Stream Logic: Synthesis Beyond the Bools. In: Dillig, I., Tasiran, S. (eds.) Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I. Lecture Notes in Computer Science, vol. 11561, pp. 609\u2013629. Springer (2019), https:\/\/doi.org\/10.1007\/978-3-030-25540-4_35","DOI":"10.1007\/978-3-030-25540-4_35"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional Dynamic Logic of Regular Programs. J. Comput. Syst. Sci. 18(2), 194\u2013211 (1979), https:\/\/doi.org\/10.1016\/0022-0000(79)90046-1","DOI":"10.1016\/0022-0000(79)90046-1"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Geier, G., Heim, P., Klein, F., Finkbeiner, B.: Syntroids: Synthesizing a Game for FPGAs using Temporal Logic Specifications. In: 2019 Formal Methods in Computer Aided Design, FMCAD 2019, San Jose, CA, USA, October 22-25, 2019. pp. 138\u2013146. IEEE (2019), https:\/\/doi.org\/10.23919\/FMCAD.2019.8894261","DOI":"10.23919\/FMCAD.2019.8894261"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Harel, D.: First-Order Dynamic Logic, Lecture Notes in Computer Science, vol. 68. Springer (1979), https:\/\/doi.org\/10.1007\/3-540-09237-4","DOI":"10.1007\/3-540-09237-4"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Harel, D., Meyer, A.R., Pratt, V.R.: Computability and Completeness in Logics of Programs (Preliminary Report). In: Hopcroft, J.E., Friedman, E.P., Harrison, M.A. (eds.) Proceedings of the 9th Annual ACM Symposium on Theory of Computing, May 4-6, 1977, Boulder, Colorado, USA. pp. 261\u2013268. ACM (1977), https:\/\/doi.org\/10.1145\/800105.803416","DOI":"10.1145\/800105.803416"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Jacobs, S., Klein, F., Schirmer, S.: A High-level LTL Synthesis Format: TLSF v1.1. In: Piskac, R., Dimitrova, R. (eds.) Proceedings Fifth Workshop on Synthesis, SYNT@CAV 2016, Toronto, Canada, July 17-18, 2016. EPTCS, vol. 229, pp. 112\u2013132 (2016), https:\/\/doi.org\/10.4204\/EPTCS.229.10","DOI":"10.4204\/EPTCS.229.10"},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"Kaminski, M., Francez, N.: Finite-Memory Automata. Theor. Comput. Sci. 134(2), 329\u2013363 (1994), https:\/\/doi.org\/10.1016\/0304-3975(94)90242-9","DOI":"10.1016\/0304-3975(94)90242-9"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Khalimov, A., Maderbacher, B., Bloem, R.: Bounded Synthesis of Register Transducers. In: Lahiri, S.K., Wang, C. (eds.) Automated Technology for Verification and Analysis - 16th International Symposium, ATVA 2018, Los Angeles, CA, USA, October 7-10, 2018, Proceedings. Lecture Notes in Computer Science, vol. 11138, pp. 494\u2013510. Springer (2018), https:\/\/doi.org\/10.1007\/978-3-030-01090-4_29","DOI":"10.1007\/978-3-030-01090-4_29"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Krogmeier, P., Mathur, U., Murali, A., Madhusudan, P., Viswanathan, M.: Decidable Synthesis of Programs with Uninterpreted Functions. In: Lahiri, S.K., Wang, C. (eds.) Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part II. Lecture Notes in Computer Science, vol. 12225, pp. 634\u2013657. Springer (2020), https:\/\/doi.org\/10.1007\/978-3-030-53291-8_32","DOI":"10.1007\/978-3-030-53291-8_32"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Lamport, L.: The Temporal Logic of Actions. ACM Trans. Program. Lang. Syst. 16(3), 872\u2013923 (1994), https:\/\/doi.org\/10.1145\/177492.177726","DOI":"10.1145\/177492.177726"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Li, J., Zhang, L., Pu, G., Vardi, M.Y., He, J.: LTL Satisfiability Checking Revisited. In: S\u00e1nchez, C., Venable, K.B., Zim\u00e1nyi, E. (eds.) 2013 20th International Symposium on Temporal Representation and Reasoning, Pensacola, FL, USA, September 26-28, 2013. pp. 91\u201398. IEEE Computer Society (2013), https:\/\/doi.org\/10.1109\/TIME.2013.19","DOI":"10.1109\/TIME.2013.19"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Lisitsa, A., Potapov, I.: Temporal Logic with Predicate $$\\lambda $$-Abstraction. In: 12th International Symposium on Temporal Representation and Reasoning (TIME 2005), 23-25 June 2005, Burlington, Vermont, USA. pp. 147\u2013155. IEEE Computer Society (2005), https:\/\/doi.org\/10.1109\/TIME.2005.34","DOI":"10.1109\/TIME.2005.34"},{"key":"17_CR27","unstructured":"Maderbacher, B., Bloem, R.: Reactive Synthesis Modulo Theories Using Abstraction Refinement. CoRR abs\/2108.00090 (2021), https:\/\/arxiv.org\/abs\/2108.00090"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: Verification of Concurrent Programs: The Temporal Framework. In: Boyer, R.S., Moore, J.S. (eds.) The Correctness Problem in Computer Science. Academic Press, London (1981)","DOI":"10.21236\/ADA106750"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Mathur, U., Madhusudan, P., Viswanathan, M.: Decidable Verification of Uninterpreted Programs. Proc. ACM Program. Lang. 3(POPL), 46:1\u201346:29 (2019), https:\/\/doi.org\/10.1145\/3290359","DOI":"10.1145\/3290359"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Mathur, U., Madhusudan, P., Viswanathan, M.: What\u2019s Decidable About Program Verification Modulo Axioms? In: Biere, A., Parker, D. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Part II. Lecture Notes in Computer Science, vol. 12079, pp. 158\u2013177. Springer (2020), https:\/\/doi.org\/10.1007\/978-3-030-45237-7_10","DOI":"10.1007\/978-3-030-45237-7_10"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"de Moura, L.M., Bj\u00f8rner, N.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings. Lecture Notes in Computer Science, vol. 4963, pp. 337\u2013340. Springer (2008), https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The Temporal Logic of Programs. In: Annual Symposium on Foundations of Computer Science, 1977. pp. 46\u201357. IEEE Computer Society (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Semantical Considerations on Floyd-Hoare Logic. In: 17th Annual Symposium on Foundations of Computer Science, Houston, Texas, USA, 25-27 October 1976. pp. 109\u2013121. IEEE Computer Society (1976), https:\/\/doi.org\/10.1109\/SFCS.1976.27","DOI":"10.1109\/SFCS.1976.27"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: A Practical Decision Method for Propositional Dynamic Logic: Preliminary Report. In: Lipton, R.J., Burkhard, W.A., Savitch, W.J., Friedman, E.P., Aho, A.V. (eds.) Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA. pp. 326\u2013337. ACM (1978), https:\/\/doi.org\/10.1145\/800133.804362","DOI":"10.1145\/800133.804362"},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Ramakrishna, Y.S.: On the Satisfiability Problem for Lamport\u2019s Propositional Temporal Logic of Actions and Some of Its Extensions. Fundam. Informaticae 24(4), 387\u2013405 (1995), https:\/\/doi.org\/10.3233\/FI-1995-2444","DOI":"10.3233\/FI-1995-2444"},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"Rozier, K.Y., Vardi, M.Y.: LTL Satisfiability Checking. In: Bosnacki, D., Edelkamp, S. (eds.) Model Checking Software, 14th International SPIN Workshop, Berlin, Germany, July 1-3, 2007, Proceedings. Lecture Notes in Computer Science, vol.\u00a04595, pp. 149\u2013167. Springer (2007), https:\/\/doi.org\/10.1007\/978-3-540-73370-6_11","DOI":"10.1007\/978-3-540-73370-6_11"},{"key":"17_CR37","doi-asserted-by":"crossref","unstructured":"Sistla, A.P., Clarke, E.M.: The Complexity of Propositional Linear Temporal Logics. J. ACM 32(3), 733\u2013749 (1985), https:\/\/doi.org\/10.1145\/3828.3837","DOI":"10.1145\/3828.3837"},{"key":"17_CR38","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning About Infinite Computations. Inf. Comput. 115(1), 1\u201337 (1994), https:\/\/doi.org\/10.1006\/inco.1994.1092","DOI":"10.1006\/inco.1994.1092"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-99253-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T20:09:30Z","timestamp":1648498170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-99253-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030992521","9783030992538"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-99253-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2022\/fossacs","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":"77","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":"23","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":"30% - 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":"9","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)"}}]}}