{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:46:26Z","timestamp":1764996386208,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031171956"},{"type":"electronic","value":"9783031171963"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-17196-3_3","type":"book-chapter","created":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T22:03:09Z","timestamp":1663884189000},"page":"45-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Relaxing Safety for\u00a0Metric First-Order Temporal Logic via\u00a0Dynamic Free Variables"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3279-3685","authenticated-orcid":false,"given":"Jonathan Juli\u00e1n","family":"Huerta y Munive","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,23]]},"reference":[{"key":"3_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995). http:\/\/webdam.inria.fr\/Alice\/"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Avron, A., Hirshfeld, Y.: On first order database query languages. In: LICS 1991, pp. 226\u2013231. IEEE Computer Society (1991)","DOI":"10.1109\/LICS.1991.151647"},{"key":"3_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":"3_CR4","doi-asserted-by":"crossref","unstructured":"Basin, D.A., Klaedtke, F., M\u00fcller, S., Zalinescu, E.: Monitoring metric first-order temporal properties. J. ACM 62(2), 15:1\u201315:45 (2015)","DOI":"10.1145\/2699444"},{"issue":"2","key":"3_CR5","doi-asserted-by":"crossref","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 TDS 20(2), 149\u2013186 (1995)","journal-title":"ACM TDS"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/147508.147520","volume":"39","author":"R Demolombe","year":"1992","unstructured":"Demolombe, R.: Syntactical characterization of a subset of domain-independent formulas. J. ACM 39(1), 71\u201394 (1992)","journal-title":"J. ACM"},{"issue":"2","key":"3_CR7","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. Transf. 23(2), 255\u2013284 (2021). https:\/\/doi.org\/10.1007\/s10009-021-00609-z","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/114325.103712","volume":"16","author":"AV Gelder","year":"1991","unstructured":"Gelder, A.V., 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":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-12251-4_9","volume-title":"Functional and Logic Programming","author":"F Haftmann","year":"2010","unstructured":"Haftmann, F., Nipkow, T.: Code generation via higher-order rewrite systems. In: Blume, M., Kobayashi, N., Vidal, G. (eds.) FLOPS 2010. LNCS, vol. 6009, pp. 103\u2013117. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12251-4_9"},{"key":"3_CR10","unstructured":"Hauser, N.: Safe evaluation of MFOTL dual temporal operators (2021)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Havelund, K., Peled, D., Ulus, D.: First order temporal logic monitoring with BDDs. In: FMCAD 2017, pp. 116\u2013123. IEEE (2017)","DOI":"10.23919\/FMCAD.2017.8102249"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Hublet, F., Basin, D., Krstic, S.: Real-time policy enforcement with metric first-order temporal logic (ext. rep.). In: ESORICS 2022 (2022). (to appear - link https:\/\/krledmno1.github.io\/assets\/papers\/esorics22.pdf)","DOI":"10.1007\/978-3-031-17146-8_11"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Kifer, M.: On safety, domain independence, and capturability of database queries (preliminary report). In: Beeri, C., Schmidt, J.W., Dayal, U. (eds.) Proceedings of the Third International Conference on Data and Knowledge Bases, pp. 405\u2013415. Morgan Kaufmann, Burlington (1988)","DOI":"10.1016\/B978-1-4832-1313-2.50037-8"},{"issue":"4","key":"3_CR14","first-page":"255","volume":"2","author":"R Koymans","year":"1990","unstructured":"Koymans, R.: Specifying real-time properties with metric temporal logic. RTS 2(4), 255\u2013299 (1990)","journal-title":"RTS"},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1023\/A:1011254632723","volume":"19","author":"O Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y.: Model checking of safety properties. Formal Methods Syst. Des. 19(3), 291\u2013314 (2001)","journal-title":"Formal Methods Syst. Des."},{"issue":"5","key":"3_CR16","first-page":"293","volume":"78","author":"M Leucker","year":"2009","unstructured":"Leucker, M., Schallhart, C.: A brief account of runtime verification. JLAMP 78(5), 293\u2013303 (2009)","journal-title":"JLAMP"},{"key":"3_CR17","unstructured":"Raszyk, M.: Efficient, expressive, and verified temporal query evaluation. Ph.D. thesis, ETH Z\u00fcrich (2022, to appear)"},{"key":"3_CR18","unstructured":"Raszyk, M., Basin, D.A., Krstic, S., Traytel, D.: Practical relational calculus query evaluation. In: ICDT 2022. LIPIcs, vol. 220, pp. 11:1\u201311:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"3_CR19","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":"3_CR20","doi-asserted-by":"crossref","unstructured":"Schneider, J., Traytel, D.: Formalization of a monitoring algorithm for metric first-order temporal logic. Arch. Formal Proofs (2019). https:\/\/isa-afp.org\/entries\/MFOTL_Monitor.html, Formal proof development","DOI":"10.1007\/978-3-030-32079-9_18"},{"key":"3_CR21","unstructured":"Ullman, J.D.: Principles of Database and Knowledge-Base Systems, Volume I. Principles of Computer Science Series, vol. 14. Computer Science Press (1988)"},{"key":"3_CR22","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"}],"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-17196-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T12:42:44Z","timestamp":1728045764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17196-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031171956","9783031171963"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17196-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 September 2022","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":"Tbilsi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rv2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rv22.gitlab.io","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":"40","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":"12","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":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","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)"}}]}}