{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:29:54Z","timestamp":1766449794998,"version":"3.40.3"},"publisher-location":"Cham","reference-count":102,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031453281"},{"type":"electronic","value":"9783031453298"}],"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-45329-8_1","type":"book-chapter","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T18:02:40Z","timestamp":1697911360000},"page":"3-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Correct and\u00a0Efficient Policy Monitoring, a\u00a0Retrospective"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2952-939X","authenticated-orcid":false,"given":"David","family":"Basin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8314-2589","authenticated-orcid":false,"given":"Sr\u0111an","family":"Krsti\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8253-4513","authenticated-orcid":false,"given":"Joshua","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7982-2768","authenticated-orcid":false,"given":"Dmitriy","family":"Traytel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,22]]},"reference":[{"key":"1_CR1","volume-title":"Foundations of Databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)"},{"key":"1_CR2","volume-title":"C++ Template Metaprogramming: Concepts, Tools, and Techniques from Boost and Beyond","author":"D Abrahams","year":"2004","unstructured":"Abrahams, D., Gurtovoy, A.: C++ Template Metaprogramming: Concepts, Tools, and Techniques from Boost and Beyond. Addison-Wesley, Boston (2004)"},{"issue":"9","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1109\/TKDE.2011.47","volume":"23","author":"FN Afrati","year":"2011","unstructured":"Afrati, F.N., Ullman, J.D.: Optimizing multiway joins in a map-reduce environment. IEEE Trans. Knowl. Data Eng. 23(9), 1282\u20131298 (2011). https:\/\/doi.org\/10.1109\/TKDE.2011.47","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"1_CR4","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1007\/s00778-014-0357-y","volume":"23","author":"A Alexandrov","year":"2014","unstructured":"Alexandrov, A., et al.: The Stratosphere platform for big data analytics. VLDB J. 23(6), 939\u2013964 (2014). https:\/\/doi.org\/10.1007\/s00778-014-0357-y","journal-title":"VLDB J."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/3-540-15216-4_12","volume-title":"Distributed Systems: Methods and Tools for Specification, An Advanced Course","author":"MW Alford","year":"1984","unstructured":"Alford, M.W., Lamport, L., Mullery, G.P.: Basic concepts. In: Paul, M., Siegert, H.J. (eds.) Distributed Systems: Methods and Tools for Specification, An Advanced Course. LNCS, vol. 190, pp. 7\u201343. Springer, Cham (1984). https:\/\/doi.org\/10.1007\/3-540-15216-4_12"},{"issue":"2","key":"1_CR6","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."},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Arasu, A., et al.: FastVer2: a provably correct monitor for concurrent, key-value stores. In: Krebbers, R., Traytel, D., Pientka, B., Zdancewic, S. (eds.) 12th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP 2023), pp. 30\u201346. ACM (2023). https:\/\/doi.org\/10.1145\/3573105.3575687","DOI":"10.1145\/3573105.3575687"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-030-29959-0_33","volume-title":"Computer Security \u2013 ESORICS 2019","author":"E Arfelt","year":"2019","unstructured":"Arfelt, E., Basin, D., Debois, S.: Monitoring the GDPR. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11735, pp. 681\u2013699. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29959-0_33"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Popa, L., Abiteboul, S., Kolaitis, P.G. (eds.) 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2002), pp. 1\u201316. ACM (2002). https:\/\/doi.org\/10.1145\/543613.543615","DOI":"10.1145\/543613.543615"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-35632-2_20","volume-title":"Runtime Verification","author":"B Barre","year":"2013","unstructured":"Barre, B., Klein, M., Soucy-Boivin, M., Ollivier, P.-A., Hall\u00e9, S.: MapReduce for parallel trace validation of LTL properties. In: Qadeer, S., Tasiran, S. (eds.) RV 2012. LNCS, vol. 7687, pp. 184\u2013198. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35632-2_20"},{"key":"1_CR11","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"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10703-018-00328-3","volume":"54","author":"D Basin","year":"2019","unstructured":"Basin, D., Bhatt, B.N., Krsti\u0107, S., Traytel, D.: Almost event-rate independent monitoring. Formal Methods Syst. Des. 54(3), 449\u2013478 (2019). https:\/\/doi.org\/10.1007\/s10703-018-00328-3","journal-title":"Formal Methods Syst. Des."},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-030-01090-4_3","volume-title":"Automated Technology for Verification and Analysis","author":"D Basin","year":"2018","unstructured":"Basin, D., Bhatt, B.N., Traytel, D.: Optimal proofs for linear temporal logic on lasso words. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 37\u201355. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_3"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-11164-3_4","volume-title":"Runtime Verification","author":"D Basin","year":"2014","unstructured":"Basin, D., Caronni, G., Ereth, S., Harvan, M., Klaedtke, F., Mantel, H.: Scalable offline monitoring. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 31\u201347. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_4"},{"issue":"1\u20132","key":"1_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10703-016-0242-y","volume":"49","author":"D Basin","year":"2016","unstructured":"Basin, D., Caronni, G., Ereth, S., Harvan, M., Klaedtke, F., Mantel, H.: Scalable offline monitoring of temporal specifications. Formal Methods Syst. Des. 49(1\u20132), 75\u2013108 (2016). https:\/\/doi.org\/10.1007\/s10703-016-0242-y","journal-title":"Formal Methods Syst. Des."},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-17715-6_1","volume-title":"Theoretical Aspects of Computing (ICTAC 2022)","author":"D Basin","year":"2022","unstructured":"Basin, D., et al.: VeriMon: a formally verified monitoring tool. In: Seidl, H., Liu, Z., Pasareanu, C.S. (eds.) ICTAC 2022. LNCS, vol. 13572, pp. 1\u20136. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17715-6_1"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-030-51074-9_25","volume-title":"Automated Reasoning","author":"D Basin","year":"2020","unstructured":"Basin, D., et al.: A formally verified, optimized monitor for metric first-order dynamic logic. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12166, pp. 432\u2013453. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51074-9_25"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-031-27481-7_22","volume-title":"Formal Methods (FM 2023)","author":"D Basin","year":"2023","unstructured":"Basin, D., et al.: Monitoring the internet computer. In: Chechik, M., Katoen, J.-P., Leucker, M. (eds.) FM 2023. LNCS, vol. 14000, pp. 383\u2013402. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-27481-7_22"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-030-60508-7_11","volume-title":"Runtime Verification","author":"D Basin","year":"2020","unstructured":"Basin, D., Gras, M., Krsti\u0107, S., Schneider, J.: Scalable online monitoring of distributed systems. In: Deshmukh, J., Ni\u010dkovi\u0107, D. (eds.) RV 2020. LNCS, vol. 12399, pp. 197\u2013220. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60508-7_11"},{"key":"1_CR20","unstructured":"Basin, D., et al.: MonPoly and VeriMon. https:\/\/bitbucket.org\/jshs\/monpoly"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Basin, D., Harvan, M., Klaedtke, F., Z\u0103linescu, E.: Monitoring usage-control policies in distributed systems. In: Combi, C., Leucker, M., Wolter, F. (eds.) 18th International Symposium on Temporal Representation and Reasoning (TIME 2011), pp. 88\u201395. IEEE (2011). https:\/\/doi.org\/10.1109\/TIME.2011.14","DOI":"10.1109\/TIME.2011.14"},{"issue":"10","key":"1_CR22","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1109\/TSE.2013.18","volume":"39","author":"D Basin","year":"2013","unstructured":"Basin, D., Harvan, M., Klaedtke, F., Z\u0103linescu, E.: Monitoring data usage in distributed systems. IEEE Trans. Softw. Eng. 39(10), 1403\u20131426 (2013). https:\/\/doi.org\/10.1109\/TSE.2013.18","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-11164-3_16","volume-title":"Runtime Verification","author":"D Basin","year":"2014","unstructured":"Basin, D., Klaedtke, F., Marinovic, S., Z\u0103linescu, E.: On real-time monitoring with imprecise\u00a0timestamps. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 193\u2013198. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_16"},{"issue":"3","key":"1_CR24","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/s10703-015-0222-7","volume":"46","author":"D Basin","year":"2015","unstructured":"Basin, D., Klaedtke, F., Marinovic, S., Z\u0103linescu, E.: Monitoring of temporal first-order properties with aggregations. Formal Methods Syst. Des. 46(3), 262\u2013285 (2015). https:\/\/doi.org\/10.1007\/s10703-015-0222-7","journal-title":"Formal Methods Syst. Des."},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Basin, D., Klaedtke, F., M\u00fcller, S.: Monitoring security policies with metric first-order temporal logic. In: Joshi, J.B.D., Carminati, B. (eds.) 15th ACM Symposium on Access Control Models and Technologies (SACMAT 2010), pp. 23\u201334. ACM (2010). https:\/\/doi.org\/10.1109\/TSE.2013.18","DOI":"10.1109\/TSE.2013.18"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14295-6_1","volume-title":"Computer Aided Verification","author":"D Basin","year":"2010","unstructured":"Basin, D., Klaedtke, F., M\u00fcller, S.: Policy monitoring in first-order temporal logic. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 1\u201318. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_1"},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Basin, D., Klaedtke, F., M\u00fcller, S., Pfitzmann, B.: Runtime monitoring of metric first-order temporal properties. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2008), Volume 2 of LIPIcs, pp. 49\u201360. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2008). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2008.1740","DOI":"10.4230\/LIPIcs.FSTTCS.2008.1740"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Basin, D., Klaedtke, F., M\u00fcller, S., Z\u0103linescu, E.: Monitoring metric first-order temporal properties. J. ACM 62(2), 15:1\u201315:45 (2015). https:\/\/doi.org\/10.1145\/2699444","DOI":"10.1145\/2699444"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-29860-8_20","volume-title":"Runtime Verification","author":"D Basin","year":"2012","unstructured":"Basin, D., Klaedtke, F., Z\u0103linescu, E.: Algorithms for monitoring real-time properties. In: Khurshid, S., Sen, K. (eds.) RV 2011. LNCS, vol. 7186, pp. 260\u2013275. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29860-8_20"},{"issue":"2","key":"1_CR30","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.ipl.2014.09.009","volume":"115","author":"D Basin","year":"2015","unstructured":"Basin, D., Klaedtke, F., Z\u0103linescu, E.: Greedily computing associative aggregations on sliding windows. Inf. Process. Lett. 115(2), 186\u2013192 (2015). https:\/\/doi.org\/10.1016\/j.ipl.2014.09.009","journal-title":"Inf. Process. Lett."},{"key":"1_CR31","doi-asserted-by":"publisher","unstructured":"Basin, D., Klaedtke, F., Z\u0103linescu, E.: The MonPoly monitoring tool. In: Reger, G., Havelund, K. (eds.) International Workshop on Competitions, Usability, Benchmarks, Evaluation, and Standardisation for Runtime Verification Tools (RV-CuBES 2017), Volume 3 of Kalpa Publications in Computing, pp. 19\u201328. EasyChair (2017). https:\/\/doi.org\/10.29007\/89hs","DOI":"10.29007\/89hs"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-319-63387-9_18","volume-title":"Computer Aided Verification","author":"D Basin","year":"2017","unstructured":"Basin, D., Klaedtke, F., Z\u0103linescu, E.: Runtime verification of temporal properties over out-of-order data streams. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 356\u2013376. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_18"},{"issue":"4","key":"1_CR33","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s00236-017-0295-4","volume":"55","author":"D Basin","year":"2018","unstructured":"Basin, D., Klaedtke, F., Z\u0103linescu, E.: Algorithms for monitoring real-time properties. Acta Informatica 55(4), 309\u2013338 (2018). https:\/\/doi.org\/10.1007\/s00236-017-0295-4","journal-title":"Acta Informatica"},{"key":"1_CR34","doi-asserted-by":"publisher","unstructured":"Basin, D., Klaedtke, F., Z\u0103linescu, E.: Runtime verification over out-of-order streams. ACM Trans. Comput. Log. 21(1), 5:1\u20135:43 (2020). https:\/\/doi.org\/10.1145\/3355609","DOI":"10.1145\/3355609"},{"key":"1_CR35","doi-asserted-by":"publisher","unstructured":"Basin, D., Krsti\u0107, S., Traytel, D.: AERIAL: almost event-rate independent algorithms for monitoring metric regular properties. In: Reger, G., Havelund, K. (eds.) International Workshop on Competitions, Usability, Benchmarks, Evaluation, and Standardisation for Runtime Verification Tools (RV-CuBES 2017), Volume 3 of Kalpa Publications in Computing, pp. 29\u201336. EasyChair (2017). https:\/\/doi.org\/10.29007\/bm4c","DOI":"10.29007\/bm4c"},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-67531-2_6","volume-title":"Runtime Verification","author":"D Basin","year":"2017","unstructured":"Basin, D., Krsti\u0107, S., Traytel, D.: Almost event-rate independent monitoring of metric dynamic logic. In: Lahiri, S., Reger, G. (eds.) RV 2017. LNCS, vol. 10548, pp. 85\u2013102. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67531-2_6"},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-40787-1_4","volume-title":"Runtime Verification","author":"A Bauer","year":"2013","unstructured":"Bauer, A., K\u00fcster, J.-C., Vegliach, G.: From propositional to first-order monitoring. In: Legay, A., Bensalem, S. (eds.) RV 2013. LNCS, vol. 8174, pp. 59\u201375. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40787-1_4"},{"key":"1_CR38","doi-asserted-by":"publisher","unstructured":"Beame, P., Koutris, P., Suciu, D.: Communication steps for parallel query processing. J. ACM 64(6), 40:1\u201340:58 (2017). https:\/\/doi.org\/10.1145\/3125644","DOI":"10.1145\/3125644"},{"issue":"12","key":"1_CR39","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.parco.2008.12.012","volume":"35","author":"D Becker","year":"2009","unstructured":"Becker, D., Rabenseifner, R., Wolf, F., Linford, J.C.: Scalable timestamp synchronization for event traces of message-passing applications. Parallel Comput. 35(12), 595\u2013607 (2009). https:\/\/doi.org\/10.1016\/j.parco.2008.12.012","journal-title":"Parallel Comput."},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"Bersani, M.M., Bianculli, D., Ghezzi, C., Krsti\u0107, S., San Pietro, P.: Efficient large-scale trace checking using MapReduce. In: Dillon, L.K., Visser, W., Williams, L.A. (eds.) 38th International Conference on Software Engineering (ICSE 2016), pp. 888\u2013898. ACM (2016). https:\/\/doi.org\/10.1145\/2884781.2884832","DOI":"10.1145\/2884781.2884832"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-319-10431-7_11","volume-title":"Software Engineering and Formal Methods","author":"D Bianculli","year":"2014","unstructured":"Bianculli, D., Ghezzi, C., Krsti\u0107, S.: Trace checking of metric temporal logic with aggregating modalities using MapReduce. In: Giannakopoulou, D., Sala\u00fcn, G. (eds.) SEFM 2014. LNCS, vol. 8702, pp. 144\u2013158. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10431-7_11"},{"key":"1_CR42","doi-asserted-by":"publisher","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic structures. In: 15th Annual IEEE Symposium on Logic in Computer Science (LICS 2000), pp. 51\u201362. IEEE Computer Society (2000). https:\/\/doi.org\/10.1109\/LICS.2000.855755","DOI":"10.1109\/LICS.2000.855755"},{"key":"1_CR43","unstructured":"Brix, F., Fania, C., Gras, M., Krsti\u0107, S., Schneider, J.: Scalable online monitor. https:\/\/bitbucket.org\/krle\/scalable-online-monitor"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-662-43951-7_8","volume-title":"Automata, Languages, and Programming","author":"D Bundala","year":"2014","unstructured":"Bundala, D., Ouaknine, J.: On the complexity of temporal-logic path checking. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 86\u201397. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_8"},{"issue":"12","key":"1_CR45","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.14778\/3137765.3137777","volume":"10","author":"P Carbone","year":"2017","unstructured":"Carbone, P., Ewen, S., F\u00f3ra, G., Haridi, S., Richter, S., Tzoumas, K.: State management in Apache Flink\u00ae: consistent stateful distributed stream processing. Proc. VLDB Endow. 10(12), 1718\u20131729 (2017). https:\/\/doi.org\/10.14778\/3137765.3137777","journal-title":"Proc. VLDB Endow."},{"key":"1_CR46","doi-asserted-by":"publisher","unstructured":"Carney, D., et al.: Monitoring streams - a new class of data management applications. In: 28th VLDB Conference (VLDB 2002), pp. 215\u2013226. Morgan Kaufmann (2002). https:\/\/doi.org\/10.1016\/B978-155860869-6\/50027-5","DOI":"10.1016\/B978-155860869-6\/50027-5"},{"issue":"3","key":"1_CR47","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1006\/jcss.1995.1088","volume":"51","author":"J Chomicki","year":"1995","unstructured":"Chomicki, J., Niwinski, D.: On the feasibility of checking temporal integrity constraints. J. Comput. Syst. Sci. 51(3), 523\u2013535 (1995). https:\/\/doi.org\/10.1006\/jcss.1995.1088","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR48","unstructured":"Codd, E.F.: Relational completeness of data base sublanguages. Technical report RJ987, IBM Research Laboratory, San Jose, California (1972)"},{"key":"1_CR49","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: Brewer, E.A., Chen, P. (eds.) 6th Symposium on Operating System Design and Implementation (OSDI 2004), pp. 137\u2013150. USENIX Association (2004). http:\/\/www.usenix.org\/events\/osdi04\/tech\/dean.html"},{"key":"1_CR50","unstructured":"DFINITY Team: The Internet Computer for geeks. Cryptology ePrint Archive, Paper 2022\/087 (2022). https:\/\/eprint.iacr.org\/2022\/087"},{"issue":"4","key":"1_CR51","doi-asserted-by":"publisher","first-page":"952","DOI":"10.1145\/322344.322347","volume":"29","author":"R Fagin","year":"1982","unstructured":"Fagin, R.: Horn clauses and database dependencies. J. ACM 29(4), 952\u2013985 (1982). https:\/\/doi.org\/10.1145\/322344.322347","journal-title":"J. ACM"},{"issue":"2","key":"1_CR52","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10009-021-00609-z","volume":"23","author":"Y Falcone","year":"2021","unstructured":"Falcone, Y., Krsti\u0107, S., Reger, G., Traytel, D.: A taxonomy for classifying runtime verification tools. Int. J. Softw. Tools Technol. Transfer 23(2), 255\u2013284 (2021). https:\/\/doi.org\/10.1007\/s10009-021-00609-z","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"issue":"2","key":"1_CR53","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/B:FORM.0000017718.28096.48","volume":"24","author":"B Finkbeiner","year":"2004","unstructured":"Finkbeiner, B., Sipma, H.: Checking finite traces using alternating automata. Formal Methods Syst. Des. 24(2), 101\u2013127 (2004). https:\/\/doi.org\/10.1023\/B:FORM.0000017718.28096.48","journal-title":"Formal Methods Syst. Des."},{"key":"1_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-319-75632-5_6","volume-title":"Lectures on Runtime Verification","author":"A Francalanza","year":"2018","unstructured":"Francalanza, A., P\u00e9rez, J.A., S\u00e1nchez, C.: Runtime verification for decentralised and distributed systems. In: Bartocci, E., Falcone, Y. (eds.) Lectures on Runtime Verification. LNCS, vol. 10457, pp. 176\u2013210. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75632-5_6"},{"issue":"2","key":"1_CR55","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/114325.103712","volume":"16","author":"A Van Gelder","year":"1991","unstructured":"Van Gelder, A., Topor, R.W.: Safety and translation of relational calculus queries. ACM Trans. Database Syst. 16(2), 235\u2013278 (1991)","journal-title":"ACM Trans. Database Syst."},{"key":"1_CR56","unstructured":"Gras, M.: CPPMon. https:\/\/github.com\/matthieugras\/cppmon"},{"key":"1_CR57","unstructured":"Gras, M.: StaticMon. https:\/\/github.com\/matthieugras\/staticmon"},{"key":"1_CR58","unstructured":"Gras, M.: Explicit meets implicit monitoring. Master\u2019s thesis, ETH Zurich, Switzerland (2022)"},{"key":"1_CR59","unstructured":"Haftmann, F.: Code generation from specifications in higher-order logic. Ph.D. thesis, Technical University Munich, Germany (2009). http:\/\/mediatum2.ub.tum.de\/node?id=886023"},{"key":"1_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-030-03769-7_7","volume-title":"Runtime Verification","author":"K Havelund","year":"2018","unstructured":"Havelund, K., Peled, D.: Runtime verification: from propositional to first-order temporal logic. In: Colombo, C., Leucker, M. (eds.) RV 2018. LNCS, vol. 11237, pp. 90\u2013112. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03769-7_7"},{"key":"1_CR61","doi-asserted-by":"publisher","unstructured":"Havelund, K., Peled, D., Ulus, D.: DejaVu: a monitoring tool for first-order temporal logic. In: 3rd Workshop on Monitoring and Testing of Cyber-Physical Systems (MT@CPSWeek 2018), pp. 12\u201313. IEEE (2018). https:\/\/doi.org\/10.1109\/MT-CPS.2018.00013","DOI":"10.1109\/MT-CPS.2018.00013"},{"issue":"1","key":"1_CR62","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10703-018-00327-4","volume":"56","author":"K Havelund","year":"2020","unstructured":"Havelund, K., Peled, D., Ulus, D.: First-order temporal logic monitoring with BDDs. Formal Methods Syst. Des. 56(1), 1\u201321 (2020). https:\/\/doi.org\/10.1007\/s10703-018-00327-4","journal-title":"Formal Methods Syst. Des."},{"key":"1_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-46002-0_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Havelund","year":"2002","unstructured":"Havelund, K., Ro\u015fu, G.: Synthesizing monitors for safety properties. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 342\u2013356. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46002-0_24"},{"key":"1_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-60630-0_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"JG Henriksen","year":"1995","unstructured":"Henriksen, J.G., et al.: Mona: monadic second-order logic in practice. In: Brinksma, E., Cleaveland, W.R., Larsen, K.G., Margaria, T., Steffen, B. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 89\u2013110. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60630-0_5"},{"key":"1_CR65","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.eswa.2016.03.020","volume":"58","author":"A Heydari","year":"2016","unstructured":"Heydari, A., Tavakoli, M., Salim, N.: Detection of fake opinions using time series. Expert Syst. Appl. 58, 83\u201392 (2016). https:\/\/doi.org\/10.1016\/j.eswa.2016.03.020","journal-title":"Expert Syst. Appl."},{"key":"1_CR66","doi-asserted-by":"crossref","unstructured":"Hublet, F., Basin, D., Krsti\u0107, S.: User-controlled privacy: taint, track, and control. Proc. Priv. Enhancing Technol. 2024(1) (2024, to appear)","DOI":"10.56553\/popets-2024-0034"},{"key":"1_CR67","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-031-17146-8_11","volume-title":"Research in Computer Security (ESORICS 2022), Part II","author":"F Hublet","year":"2022","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, Part II. LNCS, vol. 13555, pp. 211\u2013232. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17146-8_11"},{"key":"1_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 367\u2013392. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60178-3_93"},{"key":"1_CR69","unstructured":"Krsti\u0107, S., Traytel, D.: Aerial. https:\/\/bitbucket.org\/traytel\/aerial"},{"key":"1_CR70","doi-asserted-by":"publisher","unstructured":"Kuhtz, L., Finkbeiner, B.: Efficient parallel path checking for linear-time temporal logic with past and bounds. Log. Methods Comput. Sci. 8(4), 10:1\u201310:24 (2012). https:\/\/doi.org\/10.2168\/LMCS-8(4:10)2012","DOI":"10.2168\/LMCS-8(4:10)2012"},{"key":"1_CR71","doi-asserted-by":"publisher","unstructured":"Lammich, P.: Refinement of parallel algorithms down to LLVM. In: Andronick, J., de Moura, L. (eds.) 13th International Conference on Interactive Theorem Proving (ITP 2022), Volume 237 of LIPIcs, pp. 24:1\u201324:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ITP.2022.24","DOI":"10.4230\/LIPIcs.ITP.2022.24"},{"issue":"5","key":"1_CR72","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.jlap.2008.08.004","volume":"78","author":"M Leucker","year":"2009","unstructured":"Leucker, M., Schallhart, C.: A brief account of runtime verification. J. Log. Algebraic Methods Program. 78(5), 293\u2013303 (2009). https:\/\/doi.org\/10.1016\/j.jlap.2008.08.004","journal-title":"J. Log. Algebraic Methods Program."},{"key":"1_CR73","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-031-30820-8_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2023), Part II","author":"L Lima","year":"2023","unstructured":"Lima, L., Herasimau, A., Raszyk, M., Traytel, D., Yuan, S.: Explainable online monitoring of metric temporal logic. In: Sankaranarayanan, S., Sharygina, N. (eds.) TACAS 2023, Part II. LNCS, vol. 13994, pp. 473\u2013491. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_28"},{"key":"1_CR74","doi-asserted-by":"publisher","unstructured":"Graf, J.L., Krsti\u0107, S., Schneider, J.: Metric first-order temporal logic with complex data types. In: Katsaros, P., Nenzi, L. (eds.) RV 2023, LNCS 14245, pp. 126\u2013147. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-44267-4_7","DOI":"10.1007\/978-3-031-44267-4_7"},{"key":"1_CR75","doi-asserted-by":"publisher","unstructured":"Mostafa, M., Bonakdarpour, B.: Decentralized runtime verification of LTL specifications in distributed systems. In: 29th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2015), pp. 494\u2013503. IEEE (2015). https:\/\/doi.org\/10.1109\/IPDPS.2015.95","DOI":"10.1109\/IPDPS.2015.95"},{"key":"1_CR76","doi-asserted-by":"publisher","unstructured":"Murray, D.G., McSherry, F., Isaacs, R., Isard, M., Barham, P., Abadi, M.: Naiad: a timely dataflow system. In: Kaminsky, M., Dahlin, M. (eds.) 24th ACM SIGOPS Symposium on Operating Systems Principles (SOSP 2013), pp. 439\u2013455. ACM (2013). https:\/\/doi.org\/10.1145\/2517349.2522738","DOI":"10.1145\/2517349.2522738"},{"key":"1_CR77","doi-asserted-by":"crossref","unstructured":"Ni, J., Li, J., McAuley, J.J.: Justifying recommendations using distantly-labeled reviews and fine-grained aspects. In: Inui, K., Jiang, J., Ng, V., Wan, X. (eds.) Conference on Empirical Methods in Natural Language Processing (EMNLP-IJCNLP 2019), pp. 188\u2013197. Association for Computational Linguistics (2019). https:\/\/nijianmo.github.io\/amazon\/index.html","DOI":"10.18653\/v1\/D19-1018"},{"key":"1_CR78","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL: A Proof Assistant for Higher-Order Logic","author":"T Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL: A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Cham (2002). https:\/\/doi.org\/10.1007\/3-540-45949-9"},{"key":"1_CR79","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-7091-7557-6_48","volume-title":"Database and Expert Systems Applications (DEXA 1992)","author":"MA Orgun","year":"1992","unstructured":"Orgun, M.A., Wadge, W.W.: A relational algebra as a query language for temporal DATALOG. In: Tjoa, A., Ramos, I. (eds.) DEXA 1992, pp. 276\u2013281. Springer, Vienna (1992). https:\/\/doi.org\/10.1007\/978-3-7091-7557-6_48"},{"key":"1_CR80","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/11813040_38","volume-title":"FM 2006: Formal Methods","author":"A Pnueli","year":"2006","unstructured":"Pnueli, A., Zaks, A.: PSL model checking and run-time verification via testers. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 573\u2013586. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11813040_38"},{"key":"1_CR81","unstructured":"Raszyk, M.: Hydra and Vydra. https:\/\/github.com\/mraszyk\/hydra"},{"key":"1_CR82","unstructured":"Raszyk, M.: MFOTL2RANF. https:\/\/github.com\/mraszyk\/mfotl2ranf"},{"key":"1_CR83","doi-asserted-by":"publisher","unstructured":"Raszyk, M.: Efficient, expressive, and verified temporal query evaluation. Ph.D. thesis, ETH Zurich, Switzerland (2022). https:\/\/doi.org\/10.3929\/ethz-b-000553221","DOI":"10.3929\/ethz-b-000553221"},{"key":"1_CR84","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-31784-3_9","volume-title":"Automated Technology for Verification and Analysis","author":"M Raszyk","year":"2019","unstructured":"Raszyk, M., Basin, D., Krsti\u0107, S., Traytel, D.: Multi-head monitoring of metric temporal logic. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 151\u2013170. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_9"},{"key":"1_CR85","doi-asserted-by":"publisher","unstructured":"Raszyk, M., Basin, D., Krsti\u0107, S., Traytel, D.: Practical relational calculus query evaluation. In: Olteanu, D., Vortmeier, N. (eds.) 25th International Conference on Database Theory (ICDT 2022), Volume 220 of LIPIcs, pp. 11:1\u201311:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2022.11","DOI":"10.4230\/LIPIcs.ICDT.2022.11"},{"key":"1_CR86","doi-asserted-by":"publisher","unstructured":"Raszyk, M., Basin, D., Traytel, D.: From nondeterministic to multi-head deterministic finite-state transducers. In: Baier, C., Chatzigiannakis, I., Flocchini, P., Leonardi, S. (eds.) 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Volume 132 of LIPIcs, pp. 127:1\u2013127:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.127","DOI":"10.4230\/LIPIcs.ICALP.2019.127"},{"key":"1_CR87","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-030-59152-6_13","volume-title":"Automated Technology for Verification and Analysis","author":"M Raszyk","year":"2020","unstructured":"Raszyk, M., Basin, D., Traytel, D.: Multi-head monitoring of metric dynamic logic. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 233\u2013250. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_13"},{"key":"1_CR88","unstructured":"Reese, L., Silva, R.C.G., Traytel, D.: TimelyMon. https:\/\/git.ku.dk\/kfx532\/timelymon"},{"issue":"2","key":"1_CR89","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10515-005-6205-y","volume":"12","author":"G Ro\u015fu","year":"2005","unstructured":"Ro\u015fu, G., Havelund, K.: Rewriting-based techniques for runtime verification. Autom. Softw. Eng. 12(2), 151\u2013197 (2005). https:\/\/doi.org\/10.1007\/s10515-005-6205-y","journal-title":"Autom. Softw. Eng."},{"issue":"3","key":"1_CR90","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10703-019-00337-w","volume":"54","author":"C S\u00e1nchez","year":"2019","unstructured":"S\u00e1nchez, C., et al.: A survey of challenges for runtime verification from advanced application domains (beyond software). Formal Methods Syst. Des. 54(3), 279\u2013335 (2019). https:\/\/doi.org\/10.1007\/s10703-019-00337-w","journal-title":"Formal Methods Syst. Des."},{"key":"1_CR91","unstructured":"Schneider, J.: HashMon. https:\/\/bitbucket.org\/jshs\/hashmon"},{"key":"1_CR92","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-17196-3_1","volume-title":"Runtime Verification (RV 2022)","author":"J Schneider","year":"2022","unstructured":"Schneider, J.: Randomized first-order monitoring with hashing. In: Dang, T., Stolz, V. (eds.) RV 2022. LNCS, vol. 13498, pp. 3\u201324. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17196-3_1"},{"key":"1_CR93","doi-asserted-by":"publisher","unstructured":"Schneider, J.: Scalable and trustworthy monitoring. Ph.D. thesis, ETH Zurich, Switzerland (2023). https:\/\/doi.org\/10.3929\/ethz-b-000614295","DOI":"10.3929\/ethz-b-000614295"},{"key":"1_CR94","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-030-03769-7_20","volume-title":"Runtime Verification","author":"J Schneider","year":"2018","unstructured":"Schneider, J., Basin, D., Brix, F., Krsti\u0107, S., Traytel, D.: Scalable online first-order monitoring. In: Colombo, C., Leucker, M. (eds.) RV 2018. LNCS, vol. 11237, pp. 353\u2013371. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03769-7_20"},{"key":"1_CR95","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-030-31784-3_8","volume-title":"Automated Technology for Verification and Analysis","author":"J Schneider","year":"2019","unstructured":"Schneider, J., Basin, D., Brix, F., Krsti\u0107, S., Traytel, D.: Adaptive online first-order monitoring. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 133\u2013150. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_8"},{"issue":"2","key":"1_CR96","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10009-021-00607-1","volume":"23","author":"J Schneider","year":"2021","unstructured":"Schneider, J., Basin, D., Brix, F., Krsti\u0107, S., Traytel, D.: Scalable online first-order monitoring. Int. J. Softw. Tools Technol. Transfer 23(2), 185\u2013208 (2021). https:\/\/doi.org\/10.1007\/s10009-021-00607-1","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"1_CR97","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"},{"issue":"2","key":"1_CR98","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s004460050069","volume":"13","author":"SD Stoller","year":"2000","unstructured":"Stoller, S.D.: Detecting global predicates in distributed systems with clocks. Distrib. Comput. 13(2), 85\u201398 (2000). https:\/\/doi.org\/10.1007\/s004460050069","journal-title":"Distrib. Comput."},{"key":"1_CR99","doi-asserted-by":"crossref","unstructured":"Thati, P., Ro\u015fu, G.: Monitoring algorithms for metric temporal logic specifications. In: Havelund, K., Ro\u015fu, G. (eds.) 4th Workshop on Runtime Verification (RV 2004), Volume 113 of Electronic Notes in Theoretical Computer Science, pp. 145\u2013162. Elsevier (2004)","DOI":"10.1016\/j.entcs.2004.01.029"},{"key":"1_CR100","unstructured":"Tuzhilin, A., Clifford, J.: A temporal relational algebra as basis for temporal relational completeness. In: McLeod, D., Sacks-Davis, R., Schek, H.-J. (eds.) 16th International Conference on Very Large Data Bases (VLDB 1990), pp. 13\u201323. Morgan Kaufmann (1990)"},{"key":"1_CR101","doi-asserted-by":"publisher","unstructured":"Xing, Y., Zdonik, S.B., Hwang, J.-H.: Dynamic load distribution in the Borealis stream processor. In: Aberer, K., Franklin, M.J., Nishio, S. (eds.) 21st International Conference on Data Engineering (ICDE 2005), pp. 791\u2013802. IEEE Computer Society (2005). https:\/\/doi.org\/10.1109\/ICDE.2005.53","DOI":"10.1109\/ICDE.2005.53"},{"key":"1_CR102","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-030-99527-0_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Zingg","year":"2022","unstructured":"Zingg, S., Krsti\u0107, S., Raszyk, M., Schneider, J., Traytel, D.: Verified first-order monitoring with recursive rules. In: Fisman, D., Rosu, G. (eds.) TACAS 2022. LNCS, vol. 13244, pp. 236\u2013253. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_13"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45329-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T15:05:27Z","timestamp":1703430327000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45329-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031453281","9783031453298"],"references-count":102,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45329-8_1","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":"22 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","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":"24 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/atva-conference.org\/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":"115","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":"30","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":"26% - 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.05","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)"}},{"value":"7 tool 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)"}}]}}