{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:50:09Z","timestamp":1742971809672,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"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:\/\/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-44267-4_7","type":"book-chapter","created":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:03:27Z","timestamp":1696118607000},"page":"126-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Metric First-Order Temporal Logic with\u00a0Complex Data Types"],"prefix":"10.1007","author":[{"given":"Jeniffer","family":"Lima Graf","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8314-2589","authenticated-orcid":false,"given":"Sr\u0111an","family":"Krsti\u0107","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8253-4513","authenticated-orcid":false,"given":"Joshua","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,1]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/inco.1993.1025","volume":"104","author":"R Alur","year":"1993","unstructured":"Alur, R., Henzinger, T.A.: Real-time logics: complexity and expressiveness. Inf. Comput. 104(1), 35\u201377 (1993). https:\/\/doi.org\/10.1006\/inco.1993.1025","journal-title":"Inf. Comput."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","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":"7_CR3","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":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-031-27481-7_22","volume-title":"Formal Methods","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"},{"issue":"3","key":"7_CR5","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":"7_CR6","doi-asserted-by":"publisher","unstructured":"Basin, D., Klaedtke, F., M\u00fcller, S., Zalinescu, 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":"7_CR7","doi-asserted-by":"publisher","unstructured":"Basin, D., Klaedtke, F., Zalinescu, E.: The MonPoly monitoring tool. In: Reger, G., Havelund, K. (eds.) Workshop on Competitions, Usability, Benchmarks, Evaluation, and Standardisation for Runtime Verification Tools (RV-CuBES). Kalpa, vol. 3, pp. 19\u201328. EasyChair (2017). https:\/\/doi.org\/10.29007\/89hs","DOI":"10.29007\/89hs"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Blein, Y., Ledru, Y., du Bousquet, L., Groz, R.: Extending specification patterns for verification of parametric traces. In: Gnesi, S., Plat, N., Spoletini, P., Pelliccione, P. (eds.) Conference on Formal Methods in Software Engineering (FormaliSE), pp. 10\u201319. ACM (2018). https:\/\/doi.org\/10.1145\/3193992.3193998","DOI":"10.1145\/3193992.3193998"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-030-03769-7_26","volume-title":"Runtime Verification","author":"A Ben Cheikh","year":"2018","unstructured":"Ben Cheikh, A., Blein, Y., Chehida, S., Vega, G., Ledru, Y., du Bousquet, L.: An environment for the ParTraP trace property language (tool demonstration). In: Colombo, C., Leucker, M. (eds.) RV 2018. LNCS, vol. 11237, pp. 437\u2013446. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03769-7_26"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Chen, K., Hudak, P., Odersky, M.: Parametric type classes. In: White, J.L. (ed.) Conference on Lisp and Functional Programming (LFP), pp. 170\u2013181. ACM (1992). https:\/\/doi.org\/10.1145\/141471.141536","DOI":"10.1145\/141471.141536"},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/210197.210200","volume":"20","author":"J Chomicki","year":"1995","unstructured":"Chomicki, J.: Efficient checking of temporal integrity constraints using bounded history encoding. ACM Trans. Database Syst. 20(2), 149\u2013186 (1995). https:\/\/doi.org\/10.1145\/210197.210200","journal-title":"ACM Trans. Database Syst."},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Cok, D.R.: OpenJML: software verification for Java 7 using JML, OpenJDK, and eclipse. In: Dubois, C., Giannakopoulou, D., M\u00e9ry, D. (eds.) Workshop on Formal Integrated Development Environment (F-IDE). EPTCS, vol. 149, pp. 79\u201392 (2014). https:\/\/doi.org\/10.4204\/EPTCS.149.8","DOI":"10.4204\/EPTCS.149.8"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Damas, L., Milner, R.: Principal type-schemes for functional programs. In: DeMillo, R.A. (ed.) ACM Symposium on Principles of Programming Languages (POPL), pp. 207\u2013212. ACM Press (1982). https:\/\/doi.org\/10.1145\/582153.582176","DOI":"10.1145\/582153.582176"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"D\u2019Angelo, B., et al.: LOLA: runtime monitoring of synchronous systems. In: Symposium on Temporal Representation and Reasoning (TIME), pp. 166\u2013174. IEEE (2005). https:\/\/doi.org\/10.1109\/TIME.2005.26","DOI":"10.1109\/TIME.2005.26"},{"issue":"1\u20132","key":"7_CR15","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0304-3975(96)00145-4","volume":"176","author":"P Dybjer","year":"1997","unstructured":"Dybjer, P.: Representing inductively defined sets by wellorderings in Martin-L\u00f6f\u2019s type theory. Theor. Comp. Sci. 176(1\u20132), 329\u2013335 (1997). https:\/\/doi.org\/10.1016\/S0304-3975(96)00145-4","journal-title":"Theor. Comp. Sci."},{"key":"7_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09724-4","volume-title":"Edinburgh LCF: A Mechanised Logic of Computation","author":"MJ Gordon","year":"1979","unstructured":"Gordon, M.J., Milner, A.J., Wadsworth, C.P.: Edinburgh LCF: A Mechanised Logic of Computation. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09724-4"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-72013-1_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F Gorostiaga","year":"2021","unstructured":"Gorostiaga, F., S\u00e1nchez, C.: HLola: a very functional tool for extensible stream runtime verification. In: TACAS 2021. LNCS, vol. 12652, pp. 349\u2013356. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72013-1_18"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Hall\u00e9, S., Khoury, R.: Event stream processing with BeepBeep 3. In: Reger, G., Havelund, K. (eds.) Workshop on Competitions, Usability, Benchmarks, Evaluation, and Standardisation for Runtime Verification Tools (RV-CuBES). Kalpa, vol. 3, pp. 81\u201388. EasyChair (2017). https:\/\/doi.org\/10.29007\/4cth","DOI":"10.29007\/4cth"},{"key":"7_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316576892","volume-title":"Practical Foundations for Programming Languages","author":"R Harper","year":"2016","unstructured":"Harper, R.: Practical Foundations for Programming Languages, 2nd edn. Cambridge University Press, Cambridge (2016)","edition":"2"},{"issue":"2","key":"7_CR20","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. Int. J. Softw. Tools Technol. Transf. 17(2), 143\u2013170 (2015). https:\/\/doi.org\/10.1007\/s10009-014-0309-2","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Havelund, K., Peled, D., Ulus, D.: DejaVu: a monitoring tool for first-order temporal logic. In: Workshop on Monitoring and Testing of Cyber-Physical Systems (MT@CPSWeek), pp. 12\u201313. IEEE (2018). https:\/\/doi.org\/10.1109\/MT-CPS.2018.00013","DOI":"10.1109\/MT-CPS.2018.00013"},{"key":"7_CR22","unstructured":"Kaletsch, N.: Formalizing typing rules for VeriMon. Bachelor thesis, ETH Z\u00fcrich (2021)"},{"key":"7_CR23","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: Haddad, H.M., Wainwright, R.L., Chbeir, R. (eds.) ACM Symposium on Applied Computing (SAC), pp. 1925\u20131933. ACM (2018). https:\/\/doi.org\/10.1145\/3167132.3167338","DOI":"10.1145\/3167132.3167338"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Lima Graf, J., Krsti\u0107, S., Schneider, J.: Metric first-order temporal logic with complex data types. Technical report, ETH Z\u00fcrich (2023), https:\/\/bitbucket.org\/jshs\/monpoly\/src\/cmfodl2\/paper.pdf","DOI":"10.1007\/978-3-031-44267-4_7"},{"key":"7_CR25","unstructured":"Lima Graf, J., Krsti\u0107, S., Schneider, J.: MonPoly extended with complex data types (2023). https:\/\/bitbucket.org\/jshs\/monpoly\/src\/cmfodl2\/"},{"issue":"3","key":"7_CR26","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R Milner","year":"1978","unstructured":"Milner, R.: A theory of type polymorphism in programming. J. Comput. Syst. Sci. 17(3), 348\u2013375 (1978). https:\/\/doi.org\/10.1016\/0022-0000(78)90014-4","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR27","unstructured":"Morris Jr, J.H.: Lambda-calculus models of programming languages. Ph.D. thesis, MIT (1969)"},{"issue":"6","key":"7_CR28","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/218570.218572","volume":"17","author":"A Ohori","year":"1995","unstructured":"Ohori, A.: A polymorphic record calculus and its compilation. ACM Trans. Program. Lang. Syst. 17(6), 844\u2013895 (1995). https:\/\/doi.org\/10.1145\/218570.218572","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"7_CR29","volume-title":"Types and Programming Languages","author":"BC Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-16612-9_26","volume-title":"Runtime Verification","author":"L Pike","year":"2010","unstructured":"Pike, L., Goodloe, A., Morisset, R., Niller, S.: Copilot: a hard real-time runtime monitor. In: Barringer, H., Falcone, Y., Finkbeiner, B., Havelund, K., Lee, I., Pace, G., Ro\u015fu, G., Sokolsky, O., Tillmann, N. (eds.) RV 2010. LNCS, vol. 6418, pp. 345\u2013359. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16612-9_26"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Signoles, J., Kosmatov, N., Vorobyov, K.: E-ACSL, a runtime verification tool for safety and security of C programs (tool paper). In: Reger, G., Havelund, K. (eds.) Workshop on Competitions, Usability, Benchmarks, Evaluation, and Standardisation for Runtime Verification Tools (RV-CuBES). Kalpa, vol. 3, pp. 164\u2013173. EasyChair (2017). https:\/\/doi.org\/10.29007\/fpdh","DOI":"10.29007\/fpdh"},{"issue":"2\/3","key":"7_CR32","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0019-9958(85)80001-2","volume":"65","author":"R Statman","year":"1985","unstructured":"Statman, R.: Logical relations and the typed $$\\lambda $$-calculus. Inf. Control 65(2\/3), 85\u201397 (1985). https:\/\/doi.org\/10.1016\/S0019-9958(85)80001-2","journal-title":"Inf. Control"},{"key":"7_CR33","doi-asserted-by":"publisher","unstructured":"Wadler, P., Blott, S.: How to make ad-hoc polymorphism less ad-hoc. In: Symposium on Principles of Programming Languages (POPL), pp. 60\u201376. ACM Press (1989). https:\/\/doi.org\/10.1145\/75277.75283","DOI":"10.1145\/75277.75283"},{"key":"7_CR34","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: TACAS 2022. LNCS, vol. 13244, pp. 236\u2013253. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_13"},{"key":"7_CR35","unstructured":"Zumsteg, R.: Monitoring complex data types. Bachelor thesis, ETH Z\u00fcrich (2022)"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,23]],"date-time":"2023-12-23T04:40:30Z","timestamp":1703306430000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44267-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442667","9783031442674"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44267-4_7","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)"}}]}}