{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T17:41:43Z","timestamp":1749318103992,"version":"3.40.3"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030510732"},{"type":"electronic","value":"9783030510749"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51074-9_25","type":"book-chapter","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T22:02:47Z","timestamp":1593468167000},"page":"432-453","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A Formally Verified, Optimized Monitor for Metric First-Order Dynamic Logic"],"prefix":"10.1007","author":[{"given":"David","family":"Basin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thibault","family":"Dardinier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lukas","family":"Heimes","sequence":"additional","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-0003-3018-2557","authenticated-orcid":false,"given":"Martin","family":"Raszyk","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":[[2020,6,24]]},"reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-662-49498-1_2","volume-title":"Programming Languages and Systems","author":"R Alur","year":"2016","unstructured":"Alur, R., Fisman, D., Raghothaman, M.: Regular programming for quantitative properties of data streams. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 15\u201340. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49498-1_2"},{"issue":"2","key":"25_CR2","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. Theoret. Comput. Sci. 155(2), 291\u2013319 (1996). https:\/\/doi.org\/10.1016\/0304-3975(95)00182-4","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-32759-9_9","volume-title":"FM 2012: Formal Methods","author":"H Barringer","year":"2012","unstructured":"Barringer, H., Falcone, Y., Havelund, K., Reger, G., Rydeheard, D.: Quantified event automata: towards expressive and efficient runtime monitors. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 68\u201384. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_9"},{"key":"25_CR4","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":"25_CR5","unstructured":"Basin, D., et al.: VeriMon+: implementation and case study associated with this paper (2020). https:\/\/bitbucket.org\/jshs\/monpoly\/downloads\/verimonplus.zip"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Basin, D., et al.: A formally verified, optimized monitor for metric first-order dynamic logic (extended report) (2020). https:\/\/people.inf.ethz.ch\/trayteld\/papers\/ijcar20-verimonplus\/verimonplus_report.pdf","DOI":"10.1007\/978-3-030-51074-9_25"},{"issue":"3","key":"25_CR7","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. Form Methods Syst. Des. 46(3), 262\u2013285 (2015). https:\/\/doi.org\/10.1007\/s10703-015-0222-7","journal-title":"Form Methods Syst. Des."},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/2699444","volume":"62","author":"D Basin","year":"2015","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","journal-title":"J. ACM"},{"key":"25_CR9","unstructured":"Basin, D., Klaedtke, F., Z\u0103linescu, E.: The MonPoly monitoring tool. In: Reger, G., Havelund, K. (eds.) RV-CuBES 2017. Kalpa Publications in Computing, vol. 3, pp. 19\u201328. EasyChair (2017)"},{"issue":"2","key":"25_CR10","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":"25_CR11","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.) RV-CuBES 2017. Kalpa Publications in Computing, vol. 3, pp. 29\u201336. EasyChair (2017)"},{"issue":"3","key":"25_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. Form. Methods Syst. Des. 54(3), 449\u2013478 (2019). https:\/\/doi.org\/10.1007\/s10703-018-00328-3","journal-title":"Form. Methods Syst. Des."},{"key":"25_CR13","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"},{"issue":"6","key":"25_CR14","doi-asserted-by":"publisher","first-page":"40:1","DOI":"10.1145\/3125644","volume":"64","author":"P Beame","year":"2017","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","journal-title":"J. ACM"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-94821-8_6","volume-title":"Interactive Theorem Proving","author":"V Benzaken","year":"2018","unstructured":"Benzaken, V., Contejean, \u00c9., Keller, C., Martins, E.: A Coq formalisation of SQL\u2019s execution engines. In: Avigad, J., Mahboubi, A. (eds.) ITP 2018. LNCS, vol. 10895, pp. 88\u2013107. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94821-8_6"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-642-34281-3_34","volume-title":"Formal Methods and Software Engineering","author":"JO Blech","year":"2012","unstructured":"Blech, J.O., Falcone, Y., Becker, K.: Towards certified runtime verification. In: Aoki, T., Taguchi, K. (eds.) ICFEM 2012. LNCS, vol. 7635, pp. 494\u2013509. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34281-3_34"},{"key":"25_CR17","doi-asserted-by":"publisher","unstructured":"Bohrer, B., Tan, Y.K., Mitsch, S., Myreen, M.O., Platzer, A.: VeriPhy: verified controller executables from verified cyber-physical system models. In: Foster, J.S., Grossman, D. (eds.) PLDI 2018, pp. 617\u2013630. ACM (2018). https:\/\/doi.org\/10.1145\/3192366.3192406","DOI":"10.1145\/3192366.3192406"},{"issue":"4","key":"25_CR18","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":"25_CR19","doi-asserted-by":"publisher","unstructured":"D\u2019Angelo, B., et al.: LOLA: runtime monitoring of synchronous systems. In: TIME 2005, pp. 166\u2013174. IEEE Computer Society (2005). https:\/\/doi.org\/10.1109\/TIME.2005.26","DOI":"10.1109\/TIME.2005.26"},{"key":"25_CR20","unstructured":"Dardinier, T.: Formalization of multiway-join algorithms. Archive of Formal Proofs (2019). https:\/\/isa-afp.org\/entries\/Generic_Join.html"},{"key":"25_CR21","unstructured":"Dardinier, T., Heimes, L., Raszyk, M., Schneider, J., Traytel, D.: Formalization of an optimized monitoring algorithm for metric first-order dynamic logic with aggregations. Archive of Formal Proofs (2020). https:\/\/isa-afp.org\/entries\/MFODL_Monitor_Optimized.html"},{"key":"25_CR22","unstructured":"De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: Rossi, F. (ed.) IJCAI 2013, pp. 854\u2013860. IJCAI\/AAAI (2013)"},{"issue":"2","key":"25_CR23","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10009-014-0309-2","volume":"17","author":"K Havelund","year":"2015","unstructured":"Havelund, K.: Rule-based runtime verification revisited. STTT 17(2), 143\u2013170 (2015). https:\/\/doi.org\/10.1007\/s10009-014-0309-2","journal-title":"STTT"},{"issue":"11","key":"25_CR24","doi-asserted-by":"publisher","first-page":"59","DOI":"10.4230\/DagRep.7.11.59","volume":"7","author":"K Havelund","year":"2017","unstructured":"Havelund, K., Leucker, M., Reger, G., Stolz, V.: A shared challenge in behavioural specification (Dagstuhl Seminar 17462). Dagstuhl Rep. 7(11), 59\u201385 (2017). https:\/\/doi.org\/10.4230\/DagRep.7.11.59","journal-title":"Dagstuhl Rep."},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-319-94111-0_2","volume-title":"Model Checking Software","author":"K Havelund","year":"2018","unstructured":"Havelund, K., Peled, D.: Efficient runtime verification of first-order temporal properties. In: Gallardo, M.M., Merino, P. (eds.) SPIN 2018. LNCS, vol. 10869, pp. 26\u201347. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94111-0_2"},{"key":"25_CR26","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":"25_CR27","unstructured":"Heimes, L.: Extending and optimizing a verified monitor for metric first-order temporal logic. Bachelor\u2019s thesis, Department of Computer Science, ETH Z\u00fcrich (2019)"},{"key":"25_CR28","unstructured":"Heimes, L., Schneider, J., Traytel, D.: Formalization of an algorithm for greedily computing associative aggregations on sliding windows. Archive of Formal Proofs (2020). https:\/\/isa-afp.org\/entries\/Sliding_Window_Algorithm.html"},{"key":"25_CR29","doi-asserted-by":"publisher","unstructured":"Lammich, P.: Generating verified LLVM from Isabelle\/HOL. In: Harrison, J., O\u2019Leary, J., Tolmach, A. (eds.) ITP 2019. LIPIcs, vol. 141, pp. 22:1\u201322:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ITP.2019.22","DOI":"10.4230\/LIPIcs.ITP.2019.22"},{"issue":"4","key":"25_CR30","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10817-017-9437-1","volume":"62","author":"P Lammich","year":"2019","unstructured":"Lammich, P.: Refinement to imperative HOL. J. Autom. Reasoning 62(4), 481\u2013503 (2019). https:\/\/doi.org\/10.1007\/s10817-017-9437-1","journal-title":"J. Autom. Reasoning"},{"key":"25_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-23820-3_6","volume-title":"Runtime Verification","author":"J Laurent","year":"2015","unstructured":"Laurent, J., Goodloe, A., Pike, L.: Assuring the guardians. In: Bartocci, E., Majumdar, R. (eds.) RV 2015. LNCS, vol. 9333, pp. 87\u2013101. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23820-3_6"},{"key":"25_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-642-39634-2_11","volume-title":"Interactive Theorem Proving","author":"A Lochbihler","year":"2013","unstructured":"Lochbihler, A.: Light-weight containers for Isabelle: efficient, extensible, nestable. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) ITP 2013. LNCS, vol. 7998, pp. 116\u2013132. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39634-2_11"},{"key":"25_CR33","doi-asserted-by":"publisher","unstructured":"Malecha, J.G., Morrisett, G., Shinnar, A., Wisnesky, R.: Toward a verified relational database management system. In: Hermenegildo, M.V., Palsberg, J. (eds.) POPL 2010, pp. 237\u2013248. ACM (2010. https:\/\/doi.org\/10.1145\/1706299.1706329","DOI":"10.1145\/1706299.1706329"},{"key":"25_CR34","doi-asserted-by":"publisher","unstructured":"Mamouras, K., Raghothaman, M., Alur, R., Ives, Z.G., Khanna, S.: StreamQRE: modular specification and efficient evaluation of quantitative queries over streaming data. In: Cohen, A., Vechev, M.T. (eds.) PLDI 2017, pp. 693\u2013708. ACM (2017). https:\/\/doi.org\/10.1145\/3062341.3062369","DOI":"10.1145\/3062341.3062369"},{"issue":"1","key":"25_CR35","first-page":"100","volume":"10","author":"WM McKeeman","year":"1998","unstructured":"McKeeman, W.M.: Differential testing for software. Digit. Tech. J. 10(1), 100\u2013107 (1998)","journal-title":"Digit. Tech. J."},{"issue":"1\u20132","key":"25_CR36","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10703-016-0241-z","volume":"49","author":"S Mitsch","year":"2016","unstructured":"Mitsch, S., Platzer, A.: ModelPlex: verified runtime validation of verified cyber-physical system models. Form. Methods Syst. Des. 49(1\u20132), 33\u201374 (2016). https:\/\/doi.org\/10.1007\/s10703-016-0241-z","journal-title":"Form. Methods Syst. Des."},{"key":"25_CR37","doi-asserted-by":"publisher","unstructured":"Ngo, H.Q., Porat, E., R\u00e9, C., Rudra, A.: Worst-case optimal join algorithms: [extended abstract]. In: Benedikt, M., Kr\u00f6tzsch, M., Lenzerini, M. (eds.) PODS 2012, pp. 37\u201348. ACM (2012). https:\/\/doi.org\/10.1145\/2213556.2213565","DOI":"10.1145\/2213556.2213565"},{"issue":"3","key":"25_CR38","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/3180143","volume":"65","author":"HQ Ngo","year":"2018","unstructured":"Ngo, H.Q., Porat, E., R\u00e9, C., Rudra, A.: Worst-case optimal join algorithms. J. ACM 65(3), 16:1\u201316:40 (2018). https:\/\/doi.org\/10.1145\/3180143","journal-title":"J. ACM"},{"issue":"4","key":"25_CR39","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2590989.2590991","volume":"42","author":"HQ Ngo","year":"2013","unstructured":"Ngo, H.Q., R\u00e9, C., Rudra, A.: Skew strikes back: new developments in the theory of join algorithms. SIGMOD Rec. 42(4), 5\u201316 (2013). https:\/\/doi.org\/10.1145\/2590989.2590991","journal-title":"SIGMOD Rec."},{"key":"25_CR40","unstructured":"Peycheva, G.: Real-time verification of datacenter security policies via online log analysis. Master\u2019s thesis, ETH Z\u00fcrich (2018)"},{"key":"25_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-29860-8_23","volume-title":"Runtime Verification","author":"L Pike","year":"2012","unstructured":"Pike, L., Niller, S., Wegmann, N.: Runtime verification for ultra-critical systems. In: Khurshid, S., Sen, K. (eds.) RV 2011. LNCS, vol. 7186, pp. 310\u2013324. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29860-8_23"},{"key":"25_CR42","doi-asserted-by":"publisher","unstructured":"Pike, L., Wegmann, N., Niller, S., Goodloe, A.: Experience report: a do-it-yourself high-assurance compiler. In: Thiemann, P., Findler, R.B. (eds.) ICFP 2012, pp. 335\u2013340. ACM (2012). https:\/\/doi.org\/10.1145\/2364527.2364553","DOI":"10.1145\/2364527.2364553"},{"key":"25_CR43","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":"25_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-66845-1_4","volume-title":"Integrated Formal Methods","author":"A Rizaldi","year":"2017","unstructured":"Rizaldi, A., et al.: Formalising and monitoring traffic rules for autonomous vehicles in Isabelle\/HOL. In: Polikarpova, N., Schneider, S. (eds.) IFM 2017. LNCS, vol. 10510, pp. 50\u201366. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66845-1_4"},{"key":"25_CR45","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":"25_CR46","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.entcs.2004.01.029","volume":"113","author":"P Thati","year":"2005","unstructured":"Thati, P., Rosu, G.: Monitoring algorithms for metric temporal logic specifications. Electron. Notes Theoret. Comput. Sci. 113, 145\u2013162 (2005). https:\/\/doi.org\/10.1016\/j.entcs.2004.01.029","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"25_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-319-63387-9_16","volume-title":"Computer Aided Verification","author":"D Ulus","year":"2017","unstructured":"Ulus, D.: Montre: a tool for monitoring timed regular expressions. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 329\u2013335. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_16"},{"key":"25_CR48","doi-asserted-by":"publisher","unstructured":"Veldhuizen, T.L.: Triejoin: a simple, worst-case optimal join algorithm. In: Schweikardt, N., Christophides, V., Leroy, V. (eds.) ICDT 2014, pp. 96\u2013106. OpenProceedings.org (2014). https:\/\/doi.org\/10.5441\/002\/icdt.2014.13","DOI":"10.5441\/002\/icdt.2014.13"},{"key":"25_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-319-67531-2_29","volume-title":"Runtime Verification","author":"K V\u00f6llinger","year":"2017","unstructured":"V\u00f6llinger, K.: Verifying the output of a distributed algorithm using certification. In: Lahiri, S., Reger, G. (eds.) RV 2017. LNCS, vol. 10548, pp. 424\u2013430. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67531-2_29"},{"key":"25_CR50","unstructured":"Yu, L.: A formal model of IEEE floating point arithmetic. Archive of Formal Proofs (2013). https:\/\/isa-afp.org\/entries\/IEEE_Floating_Point.html"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51074-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T21:34:08Z","timestamp":1656797648000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-51074-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030510732","9783030510749"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51074-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Automated Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcar2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijcar2020.org\/","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":"150","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":"46","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":"5","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":"31% - 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.03","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":"7.38","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11 system descriptions are also included. The conference was held virtually due to the COVID-19 pandemic.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}