{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T09:34:05Z","timestamp":1766050445562,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031442667"},{"type":"electronic","value":"9783031442674"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"vor","delay-in-days":273,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Hyperproperties are properties that relate multiple execution traces. Previous work on monitoring hyperproperties focused on synchronous hyperproperties, usually specified in HyperLTL. When monitoring synchronous hyperproperties, all traces are assumed to proceed at the same speed. We introduce (multi-trace) <jats:italic>prefix transducers<\/jats:italic> and show how to use them for monitoring synchronous as well as, for the first time, asynchronous hyperproperties. Prefix transducers map multiple input traces into one or more output traces by incrementally matching prefixes of the input traces against expressions similar to regular expressions. The prefixes of different traces which are consumed by a single matching step of the monitor may have different lengths. The deterministic and executable nature of prefix transducers makes them more suitable as an intermediate formalism for runtime verification than logical specifications, which tend to be highly non-deterministic, especially in the case of asynchronous hyperproperties. We report on a set of experiments about monitoring asynchronous version of observational determinism.<\/jats:p>","DOI":"10.1007\/978-3-031-44267-4_9","type":"book-chapter","created":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:03:27Z","timestamp":1696118607000},"page":"168-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Monitoring Hyperproperties with\u00a0Prefix Transducers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1132-5516","authenticated-orcid":false,"given":"Marek","family":"Chalupa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2985-7724","authenticated-orcid":false,"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,1]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-75632-5","volume-title":"Lectures on Runtime Verification - Introductory and Advanced Topics","year":"2018","unstructured":"Bartocci, E., Falcone, Y. (eds.): Lectures on Runtime Verification - Introductory and Advanced Topics. LNCS, vol. 10457. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75632-5"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-08679-3_1","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"L Aceto","year":"2022","unstructured":"Aceto, L., Achilleos, A., Anastasiadi, E., Francalanza, A.: Monitoring hyperproperties with circuits. In: Mousavi, M.R., Philippou, A. (eds.) FORTE 2022. LNCS, vol. 13273, pp. 1\u201310. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08679-3_1"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Bonakdarpour, B.: Runtime verification of $$k$$-safety hyperproperties in HyperLTL. In: CSF 2016, pp. 239\u2013252. IEEE (2016). https:\/\/doi.org\/10.1109\/CSF.2016.24","DOI":"10.1109\/CSF.2016.24"},{"issue":"5","key":"9_CR4","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672\u2013713 (2002). https:\/\/doi.org\/10.1145\/585265.585270","journal-title":"J. ACM"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"VM Antimirov","year":"1996","unstructured":"Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155(2), 291\u2013319 (1996). https:\/\/doi.org\/10.1016\/0304-3975(95)00182-4","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"9_CR6","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1145\/235809.235810","volume":"43","author":"RA Baeza-Yates","year":"1996","unstructured":"Baeza-Yates, R.A., Gonnet, G.H.: Fast text searching for regular expressions or automaton searching on tries. J. ACM 43(6), 915\u2013936 (1996). https:\/\/doi.org\/10.1145\/235809.235810","journal-title":"J. ACM"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-94583-1_1","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"E Bartocci","year":"2022","unstructured":"Bartocci, E., Ferr\u00e8re, T., Henzinger, T.A., Nickovic, D., da Costa, A.O.: Flavors of sequential information flow. In: Finkbeiner, B., Wies, T. (eds.) VMCAI 2022. LNCS, vol. 13182, pp. 1\u201319. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-94583-1_1"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Bartocci, E., Henzinger, T.A., Nickovic, D., da Costa, A.O.: Hypernode automata (2023). https:\/\/doi.org\/10.48550\/arXiv.2305.02836","DOI":"10.48550\/arXiv.2305.02836"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-030-81685-8_33","volume-title":"Computer Aided Verification","author":"J Baumeister","year":"2021","unstructured":"Baumeister, J., Coenen, N., Bonakdarpour, B., Finkbeiner, B., S\u00e1nchez, C.: A temporal logic for asynchronous hyperproperties. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12759, pp. 694\u2013717. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_33"},{"key":"9_CR10","unstructured":"Berglund, M., van der Merwe, B.: Regular expressions with backreferences re-examined. In: Stringology Conference 2017, pp. 30\u201341. Czech Technical University in Prague (2017). http:\/\/www.stringology.org\/event\/2017\/p04.html"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Beutner, R., Finkbeiner, B.: A temporal logic for strategic hyperproperties. In: CONCUR 2021. LIPIcs, vol. 203, pp. 24:1\u201324:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2021.24","DOI":"10.4230\/LIPIcs.CONCUR.2021.24"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Bozzelli, L., Peron, A., S\u00e1nchez, C.: Asynchronous extensions of HyperLTL. In: LICS 2021, pp. 1\u201313. IEEE (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470583","DOI":"10.1109\/LICS52264.2021.9470583"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-662-54580-5_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N Brett","year":"2017","unstructured":"Brett, N., Siddique, U., Bonakdarpour, B.: Rewriting-based runtime verification for alternation-free HyperLTL. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10206, pp. 77\u201393. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54580-5_5"},{"issue":"4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964). https:\/\/doi.org\/10.1145\/321239.321249","journal-title":"J. ACM"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-68670-7_5","volume-title":"String Analysis for Software Verification and Security","author":"T Bultan","year":"2017","unstructured":"Bultan, T., Yu, F., Alkhalaf, M., Aydin, A.: Relational string analysis. In: Bultan, T., Yu, F., Alkhalaf, M., Aydin, A. (eds.) String Analysis for Software Verification and Security, pp. 57\u201368. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68670-7_5"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Chalupa, M., Henzinger, T.A.: Monitoring hyperproperties with prefix transducers (2023). https:\/\/doi.org\/10.48550\/arXiv.2308.03626","DOI":"10.48550\/arXiv.2308.03626"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-031-30826-0_15","volume-title":"Fundamental Approaches to Software Engineering","author":"M Chalupa","year":"2023","unstructured":"Chalupa, M., Muehlboeck, F., Lei, S.M., Henzinger, T.A.: VAMOS: middleware for best-effort third-party monitoring. In: Lambers, L., Uchitel, S. (eds.) FASE 2023. LNCS, vol. 13991, pp. 260\u2013281. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30826-0_15"},{"issue":"3","key":"9_CR18","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1145\/256167.256174","volume":"19","author":"CLA Clarke","year":"1997","unstructured":"Clarke, C.L.A., Cormack, G.V.: On the use of regular expressions for searching text. ACM Trans. Program. Lang. Syst. 19(3), 413\u2013426 (1997). https:\/\/doi.org\/10.1145\/256167.256174","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-54792-8_15","volume-title":"Principles of Security and Trust","author":"MR Clarkson","year":"2014","unstructured":"Clarkson, M.R., Finkbeiner, B., Koleini, M., Micinski, K.K., Rabe, M.N., S\u00e1nchez, C.: Temporal logics for hyperproperties. In: Abadi, M., Kremer, S. (eds.) POST 2014. LNCS, vol. 8414, pp. 265\u2013284. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54792-8_15"},{"issue":"6","key":"9_CR20","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","volume":"18","author":"MR Clarkson","year":"2010","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. J. Comput. Secur. 18(6), 1157\u20131210 (2010). https:\/\/doi.org\/10.3233\/JCS-2009-0393","journal-title":"J. Comput. Secur."},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Coenen, N., Finkbeiner, B., Hahn, C., Hofmann, J.: The hierarchy of hyperlogics. In: LICS 2019, pp. 1\u201313. IEEE (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785713","DOI":"10.1109\/LICS.2019.8785713"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Finkbeiner, B., Haas, L., Torfah, H.: Canonical representations of k-safety hyperproperties. In: CSF 2019, pp. 17\u201331. IEEE (2019). https:\/\/doi.org\/10.1109\/CSF.2019.00009","DOI":"10.1109\/CSF.2019.00009"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-319-67531-2_12","volume-title":"Runtime Verification","author":"B Finkbeiner","year":"2017","unstructured":"Finkbeiner, B., Hahn, C., Stenger, M., Tentrup, L.: Monitoring hyperproperties. In: Lahiri, S., Reger, G. (eds.) RV 2017. LNCS, vol. 10548, pp. 190\u2013207. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67531-2_12"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-319-89963-3_11","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B Finkbeiner","year":"2018","unstructured":"Finkbeiner, B., Hahn, C., Stenger, M., Tentrup, L.: RVHyper: a runtime verification tool for temporal hyperproperties. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10806, pp. 194\u2013200. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89963-3_11"},{"issue":"3","key":"9_CR25","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/s10703-019-00334-z","volume":"54","author":"B Finkbeiner","year":"2019","unstructured":"Finkbeiner, B., Hahn, C., Stenger, M., Tentrup, L.: Monitoring hyperproperties. Formal Methods Syst. Des. 54(3), 336\u2013363 (2019). https:\/\/doi.org\/10.1007\/s10703-019-00334-z","journal-title":"Formal Methods Syst. Des."},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Finkbeiner, B., Zimmermann, M.: The first-order logic of hyperproperties. In: STACS 2017. LIPIcs, vol. 66, pp. 30:1\u201330:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2017.30","DOI":"10.4230\/LIPIcs.STACS.2017.30"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Gutsfeld, J.O., M\u00fcller-Olm, M., Ohrem, C.: Automata and fixpoints for asynchronous hyperproperties. In: POPL 2021, pp. 1\u201329 (2021). https:\/\/doi.org\/10.1145\/3434319","DOI":"10.1145\/3434319"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-030-32079-9_5","volume-title":"Runtime Verification","author":"C Hahn","year":"2019","unstructured":"Hahn, C.: Algorithms for monitoring hyperproperties. In: Finkbeiner, B., Mariani, L. (eds.) RV 2019. LNCS, vol. 11757, pp. 70\u201390. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32079-9_5"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-17465-1_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Hahn","year":"2019","unstructured":"Hahn, C., Stenger, M., Tentrup, L.: Constraint-based monitoring of hyperproperties. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11428, pp. 115\u2013131. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17465-1_7"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/11496656_26","volume-title":"Combinatorial Pattern Matching","author":"Y-S Han","year":"2005","unstructured":"Han, Y.-S., Wang, Y., Wood, D.: Prefix-free regular-expression matching. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 298\u2013309. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496656_26"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-30500-2_15","volume-title":"Implementation and Application of Automata","author":"Y-S Han","year":"2005","unstructured":"Han, Y.-S., Wood, D.: The generalization of generalized automata: expression automata. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 156\u2013166. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30500-2_15"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Leucker, M., S\u00e1nchez, C., Scheffel, T., Schmitz, M., Schramm, A.: TeSSLa: runtime verification of non-synchronized real-time streams. In: SAC 2018, pp. 1925\u20131933. ACM (2018). https:\/\/doi.org\/10.1145\/3167132.3167338","DOI":"10.1145\/3167132.3167338"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"McLean, J.: Security models and information flow. In: SP 1990, pp. 180\u2013189. IEEE (1990). https:\/\/doi.org\/10.1109\/RISP.1990.63849","DOI":"10.1109\/RISP.1990.63849"},{"issue":"1","key":"9_CR34","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00236-002-0099-y","volume":"39","author":"GD Penna","year":"2003","unstructured":"Penna, G.D., Intrigila, B., Tronci, E., Zilli, M.V.: Synchronized regular expressions. Acta Informatica 39(1), 31\u201370 (2003). https:\/\/doi.org\/10.1007\/s00236-002-0099-y","journal-title":"Acta Informatica"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"S\u00e1nchez, C.: Synchronous and asynchronous stream runtime verification. In: VORTEX 2021, pp. 5\u20137. ACM (2021). https:\/\/doi.org\/10.1145\/3464974.3468453","DOI":"10.1145\/3464974.3468453"},{"key":"9_CR36","doi-asserted-by":"publisher","unstructured":"Veanes, M., Hooimeijer, P., Livshits, B., Molnar, D., Bj\u00f8rner, N.S.: Symbolic finite state transducers: algorithms and applications. In: POPL 2012, pp. 137\u2013150. ACM (2012). https:\/\/doi.org\/10.1145\/2103656.2103674","DOI":"10.1145\/2103656.2103674"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Zdancewic, S., Myers, A.C.: Observational determinism for concurrent program security. In: CSFW 2003, p. 29. IEEE (2003). https:\/\/doi.org\/10.1109\/CSFW.2003.1212703","DOI":"10.1109\/CSFW.2003.1212703"}],"container-title":["Lecture Notes in Computer Science","Runtime Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44267-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:16:22Z","timestamp":1696119382000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44267-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442667","9783031442674"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44267-4_9","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":"1 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Runtime Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"3 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rv2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rv23.csd.auth.gr","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":"39","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":"13","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":"7","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":"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 (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,15","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":"The proceedings includes also 4 Tutorial Papers and  2 Invited Papers","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)"}}]}}