{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T03:22:40Z","timestamp":1779074560065,"version":"3.51.4"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031171956","type":"print"},{"value":"9783031171963","type":"electronic"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T00:00:00Z","timestamp":1663891200000},"content-version":"vor","delay-in-days":265,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Quantitative monitoring can be universal and approximate: For every finite sequence of observations, the specification provides a value and the monitor outputs a best-effort approximation of it. The quality of the approximation may depend on the resources that are available to the monitor. By taking to the limit the sequences of specification values and monitor outputs, we obtain precision-resource trade-offs also for limit monitoring. This paper provides a formal framework for studying such trade-offs using an abstract interpretation for monitors: For each natural number\u00a0<jats:italic>n<\/jats:italic>, the aggregate semantics of a monitor at time <jats:italic>n<\/jats:italic> is an equivalence relation over all sequences of at most <jats:italic>n<\/jats:italic> observations so that two equivalent sequences are indistinguishable to the monitor and thus mapped to the same output. This abstract interpretation of quantitative monitors allows us to measure the number of equivalence classes (or \u201cresource use\u201d) that is necessary for a certain precision up to a certain time, or at any time. Our framework offers several insights. For example, we identify a family of specifications for which any resource-optimal exact limit monitor is independent of any error permitted over finite traces. Moreover, we present a specification for which any resource-optimal approximate limit monitor does not minimize its resource use at any time.<\/jats:p>","DOI":"10.1007\/978-3-031-17196-3_11","type":"book-chapter","created":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T22:03:09Z","timestamp":1663884189000},"page":"200-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Abstract Monitors for\u00a0Quantitative Specifications"],"prefix":"10.1007","author":[{"given":"Thomas A.","family":"Henzinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Mazzocchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. Ege","family":"Sara\u00e7","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,23]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Aceto, L., Achilleos, A., Francalanza, A., Ing\u00f3lfsd\u00f3ttir, A., Lehtinen, K.: The best a monitor can do. In: Baier, C., Goubault-Larrecq, J. (eds.) 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, 25\u201328 Jan 2021, Ljubljana, Slovenia (Virtual Conference), LIPIcs, vol. 183, pp 1\u201323. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2021.7","DOI":"10.4230\/LIPIcs.CSL.2021.7"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Aceto, L., Achilleos, A., Francalanza, A., Ing\u00f3lfsd\u00f3ttir, A., Lehtinen, K.: An operational guide to monitorability with applications to regular properties. Softw. Syst. Model. 20(2), 335\u2013361 (2021). https:\/\/doi.org\/10.1007\/s10270-020-00860-z","DOI":"10.1007\/s10270-020-00860-z"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Albers, S.: Online algorithms: a survey. Math. Program. 97(1), 3\u201326 (2003)","DOI":"10.1007\/s10107-003-0436-0"},{"key":"11_CR4","unstructured":"Alechina, N., Dastani, M., Logan, B.: Norm approximation for imperfect monitors. In: Bazzan, A.L.C., Huhns, M.N., Lomuscio, A., Scerri, P. (eds.) International conference on Autonomous Agents and Multi-Agent Systems, AAMAS 2014, Paris, France, 5\u20139 May 2014, pp. 117\u2013124. IFAAMAS\/ACM (2014). http:\/\/dl.acm.org\/citation.cfm?id=2615753"},{"key":"11_CR5","unstructured":"Alur, R., Mamouras, K., Stanford, C.: Automata-based stream processing. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Alur, R., Mamouras, K., Stanford, C.: Modular quantitative monitoring. In: Proceedings of the ACM on Programming Languages, vol. 3 (POPL), pp. 1\u201331 (2019). https:\/\/doi.org\/10.1145\/3290363","DOI":"10.1145\/3290363"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Aminof, B., Kupferman, O., Lampert, R.: Rigorous approximated determinization of weighted automata. Theor. Comput. Sci. 480, 104\u2013117 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.02.005","DOI":"10.1016\/j.tcs.2013.02.005"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Audrito, G., Casadei, R., Damiani, F., Stolz, V., Viroli, M.: Adaptive distributed monitors of spatial properties for cyber-physical systems. J. Syst. Softw. 175, 110908 (2021). https:\/\/doi.org\/10.1016\/j.jss.2021.110908","DOI":"10.1016\/j.jss.2021.110908"},{"key":"11_CR9","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-642-32759-9_9"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Bartocci, E., Falcone, Y. (eds.): Lectures on Runtime Verification. LNCS, vol. 10457. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75632-5","DOI":"10.1007\/978-3-319-75632-5"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Bartocci, E., Falcone, Y., Francalanza, A., Reger, G.: Introduction to runtime verification. In: Bartocci, E., Falcone, Y. (eds.) Lectures on Runtime Verification. LNCS, vol. 10457, pp. 1\u201333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75632-5_1","DOI":"10.1007\/978-3-319-75632-5_1"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Basin, D., Klaedtke, F., M\u00fcller, S., Z\u0103linescu, E.: Monitoring metric first-order temporal properties. J. ACM (JACM) 62(2), 1\u201345 (2015)","DOI":"10.1145\/2699444"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Bauer, A., Leucker, M., Schallhart, C.: The good, the bad, and the ugly, but how ugly is ugly? In: Sokolsky, O., Ta\u015f\u0131ran, S. (eds.) RV 2007. LNCS, vol. 4839, pp. 126\u2013138. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77395-5_11","DOI":"10.1007\/978-3-540-77395-5_11"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Bauer, A., Leucker, M., Schallhart, C.: Comparing LTL semantics for runtime verification. J. Log. Comput. 20(3), 651\u2013674 (2010). https:\/\/doi.org\/10.1093\/logcom\/exn075","DOI":"10.1093\/logcom\/exn075"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Bauer, A., Leucker, M., Schallhart, C.: Runtime verification for LTL and TLTL. ACM Trans. Softw. Eng. Methodol. 20(4), 14 (2011). https:\/\/doi.org\/10.1145\/2000799.2000800","DOI":"10.1145\/2000799.2000800"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Boker, U., Henzinger, T.A.: Approximate determinization of quantitative automata. In: D\u2019Souza, D., Kavitha, T., Radhakrishnan, J. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, 15\u201317 Dec 2012, Hyderabad, India. LIPIcs, vol. 18, pp. 362\u2013373. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2012). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2012.362","DOI":"10.4230\/LIPIcs.FSTTCS.2012.362"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Forejt, V., Ku\u010dera, A.: MultiGain: a controller synthesis tool for mdps with multiple mean-payoff objectives. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 181\u2013187. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_12","DOI":"10.1007\/978-3-662-46681-0_12"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Calinescu, R., Gerasimou, S., Johnson, K., Paterson, C.: Using runtime quantitative verification to provide assurance evidence for self-adaptive software. In: de Lemos, R., Garlan, D., Ghezzi, C., Giese, H. (eds.) Software Engineering for Self-Adaptive Systems III. Assurances. LNCS, vol. 9640, pp. 223\u2013248. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-74183-3_8","DOI":"10.1007\/978-3-319-74183-3_8"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Chang, E., Manna, Z., Pnueli, A.: The safety-progress classification. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) LAS. NATO ASI Series, vol. 94, pp. 143\u2013202. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/978-3-642-58041-3_5","DOI":"10.1007\/978-3-642-58041-3_5"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Doyen, L.: Energy and mean-payoff parity Markov decision processes. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 206\u2013218. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22993-0_21","DOI":"10.1007\/978-3-642-22993-0_21"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. ACM Trans. Comput. Logic 11(4) (2010). https:\/\/doi.org\/10.1145\/1805950.1805953","DOI":"10.1145\/1805950.1805953"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Henzinger, T.A., Otop, J.: Quantitative monitor automata. In: Rival, X. (ed.) SAS 2016. LNCS, vol. 9837, pp. 23\u201338. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53413-7_2","DOI":"10.1007\/978-3-662-53413-7_2"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Cimatti, A., Tian, C., Tonetta, S.: Assumption-based runtime verification of infinite-state systems. In: Feng, L., Fisman, D. (eds.) RV 2021. LNCS, vol. 12974, pp. 207\u2013227. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88494-9_11","DOI":"10.1007\/978-3-030-88494-9_11"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Considine, J., Li, F., Kollios, G., Byers, J.W.: Approximate aggregation techniques for sensor databases. In: \u00d6zsoyoglu, Z.M., Zdonik, S.B. (eds.) Proceedings of the 20th International Conference on Data Engineering, ICDE 2004, 30 March - 2 April 2004, Boston, MA, USA, pp. 449\u2013460. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/ICDE.2004.1320018","DOI":"10.1109\/ICDE.2004.1320018"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Cousot, P.: Abstract interpretation. ACM Comput. Surv. (CSUR) 28(2), 324\u2013328 (1996)","DOI":"10.1145\/234528.234740"},{"key":"11_CR26","unstructured":"d\u2019Angelo, B., et al.: Lola: runtime monitoring of synchronous systems. In: 12th International Symposium on Temporal Representation and Reasoning (TIME2005), pp. 166\u2013174. IEEE (2005)"},{"key":"11_CR27","unstructured":"De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: IJCAI2013 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence, pp. 854\u2013860. Association for Computing Machinery (2013)"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Decker, N., Leucker, M., Thoma, D.: Impartiality and anticipation for monitoring of visibly context-free properties. In: Legay, A., Bensalem, S. (eds.) RV 2013. LNCS, vol. 8174, pp. 183\u2013200. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40787-1_11","DOI":"10.1007\/978-3-642-40787-1_11"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Eisner, C., et al.: Reasoning with temporal logic on truncated paths. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 27\u201339. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_3","DOI":"10.1007\/978-3-540-45069-6_3"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Falcone, Y., Fernandez, J.C., Mounier, L.: What can you verify and enforce at runtime? Int. J. Softw. Tools Technol. Transfer 14(3), 349\u2013382 (2012)","DOI":"10.1007\/s10009-011-0196-8"},{"key":"11_CR31","unstructured":"Ferr\u00e8re, T., Henzinger, T.A., Kragl, B.: Monitoring event frequencies. In: 28th EACSL Annual Conference on Computer Science Logic (CSL 2020), Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Ferr\u00e8re, T., Henzinger, T.A., Sara\u00e7, N.E.: A theory of register monitors. In: Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 394\u2013403 (2018)","DOI":"10.1145\/3209108.3209194"},{"key":"11_CR33","doi-asserted-by":"publisher","unstructured":"Forejt, V., Kwiatkowska, M., Norman, G., Parker, D., Qu, H.: Quantitative multi-objective verification for probabilistic systems. In: Abdulla, P., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 112\u2013127. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19835-9_11","DOI":"10.1007\/978-3-642-19835-9_11"},{"key":"11_CR34","doi-asserted-by":"publisher","unstructured":"Francalanza, A., et al.: A foundation for runtime monitoring. In: Lahiri, S., Reger, G. (eds.) Runtime Verification. RV 2017. LNCS, vol. 10548. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67531-2_2","DOI":"10.1007\/978-3-319-67531-2_2"},{"key":"11_CR35","doi-asserted-by":"publisher","unstructured":"Halamish, S., Kupferman, O.: Approximating deterministic lattice automata. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, pp. 27\u201341. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33386-6_4","DOI":"10.1007\/978-3-642-33386-6_4"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"Henzinger, T.A., Sara\u00e7, N.E.: Monitorability under assumptions. In: Deshmukh, J., Nickovic, D. (eds.) Runtime Verification. RV 2020. LNCS, vol. 12399. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-60508-7_1","DOI":"10.1007\/978-3-030-60508-7_1"},{"key":"11_CR37","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Sara\u00e7, N.E.: Quantitative and approximate monitoring. In: 2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201314. IEEE (2021)","DOI":"10.1109\/LICS52264.2021.9470547"},{"key":"11_CR38","doi-asserted-by":"publisher","unstructured":"Ho, H.-M., Ouaknine, J., Worrell, J.: Online monitoring of metric temporal logic. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 178\u2013192. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_15","DOI":"10.1007\/978-3-319-11164-3_15"},{"key":"11_CR39","doi-asserted-by":"publisher","unstructured":"Holzmann, G.J., Smith, M.H.: Automating software feature verification. Bell Labs Tech. J. 5(2), 72\u201387 (2000). https:\/\/doi.org\/10.1002\/bltj.2223","DOI":"10.1002\/bltj.2223"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Jak\u0161i\u0107, S., Bartocci, E., Grosu, R., Nguyen, T., Ni\u010dkovi\u0107, D.: Quantitative monitoring of STL with edit distance. Formal Methods Syst. Des. 53(1), 83\u2013112 (2018)","DOI":"10.1007\/s10703-018-0319-x"},{"key":"11_CR41","doi-asserted-by":"publisher","unstructured":"Kwiatkowska, M.: Quantitative verification: models techniques and tools. In: Proceedings of the the 6th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on The Foundations of Software Engineering, pp. 449\u2013458. ESEC-FSE 2007, Association for Computing Machinery, New York, NY, USA (2007). https:\/\/doi.org\/10.1145\/1287624.1287688","DOI":"10.1145\/1287624.1287688"},{"key":"11_CR42","doi-asserted-by":"publisher","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(3), 183\u2013191 (1961). https:\/\/doi.org\/10.1147\/rd.53.0183","DOI":"10.1147\/rd.53.0183"},{"key":"11_CR43","doi-asserted-by":"publisher","unstructured":"Maler, O., Nickovic, D.: Monitoring temporal properties of continuous signals. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS\/FTRTFT -2004. LNCS, vol. 3253, pp. 152\u2013166. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30206-3_12","DOI":"10.1007\/978-3-540-30206-3_12"},{"key":"11_CR44","doi-asserted-by":"publisher","unstructured":"Mamouras, K., Chattopadhyay, A., Wang, Z.: Algebraic quantitative semantics for efficient online temporal monitoring. In: TACAS 2021. LNCS, vol. 12651, pp. 330\u2013348. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72016-2_18","DOI":"10.1007\/978-3-030-72016-2_18"},{"key":"11_CR45","doi-asserted-by":"publisher","unstructured":"Mamouras, K., Chattopadhyay, A., Wang, Z.: A compositional framework for\u00a0quantitative online monitoring over\u00a0continuous-time signals. In: Feng, L., Fisman, D. (eds.) RV 2021. LNCS, vol. 12974, pp. 142\u2013163. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88494-9_8","DOI":"10.1007\/978-3-030-88494-9_8"},{"key":"11_CR46","doi-asserted-by":"publisher","unstructured":"Mostafa, M., Bonakdarpour, B.: Decentralized runtime verification of LTL specifications in distributed systems. In: 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, 25\u201329 May 2015, pp. 494\u2013503. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/IPDPS.2015.95","DOI":"10.1109\/IPDPS.2015.95"},{"key":"11_CR47","doi-asserted-by":"publisher","unstructured":"Nia, M.A., Kargahi, M., Faghih, F.: Probabilistic approximation of runtime quantitative verification in self-adaptive systems. Microprocess. Microsyst. 72, 102943 (2020). https:\/\/doi.org\/10.1016\/j.micpro.2019.102943","DOI":"10.1016\/j.micpro.2019.102943"},{"key":"11_CR48","doi-asserted-by":"publisher","unstructured":"Piterman, N., Pnueli, A.: Temporal logic and fair discrete systems. In: Handbook of Model Checking, pp. 27\u201373. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_2","DOI":"10.1007\/978-3-319-10575-8_2"},{"key":"11_CR49","doi-asserted-by":"publisher","unstructured":"Shrivastava, N., Buragohain, C., Agrawal, D., Suri, S.: Medians and beyond: new aggregation techniques for sensor networks. In: Stankovic, J.A., Arora, A., Govindan, R. (eds.) Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems, SenSys 2004, Baltimore, MD, USA, 3\u20135 Nov 2004, pp. 239\u2013249. ACM (2004). https:\/\/doi.org\/10.1145\/1031495.1031524","DOI":"10.1145\/1031495.1031524"},{"key":"11_CR50","doi-asserted-by":"publisher","unstructured":"Silberstein, A., Braynard, R., Yang, J.: Constraint chaining: on energy-efficient continuous monitoring in sensor networks. In: Chaudhuri, S., Hristidis, V., Polyzotis, N. (eds.) Proceedings of the ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, 27\u201329 June 2006, pp. 157\u2013168. ACM (2006). https:\/\/doi.org\/10.1145\/1142473.1142492","DOI":"10.1145\/1142473.1142492"},{"key":"11_CR51","doi-asserted-by":"publisher","unstructured":"Stucki, S., S\u00e1nchez, C., Schneider, G., Bonakdarpour, B.: Gray-box monitoring of hyperproperties with an application to privacy. Formal Methods Syst. Des. 58(1), 126\u2013159 (2021). https:\/\/doi.org\/10.1007\/s10703-020-00358-w","DOI":"10.1007\/s10703-020-00358-w"},{"key":"11_CR52","doi-asserted-by":"publisher","unstructured":"Toffoli, T.: Reversible computing. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 632\u2013644. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_104","DOI":"10.1007\/3-540-10003-2_104"},{"key":"11_CR53","doi-asserted-by":"publisher","unstructured":"Wang, C., Yang, Y., Gupta, A., Gopalakrishnan, G.: Dynamic model checking with property driven pruning to detect race conditions. In: Cha, S., Choi, J.-Y., Kim, M., Lee, I., Viswanathan, M. (eds.) ATVA 2008. LNCS, vol. 5311, pp. 126\u2013140. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88387-6_11","DOI":"10.1007\/978-3-540-88387-6_11"},{"key":"11_CR54","doi-asserted-by":"publisher","unstructured":"Zhang, X., Leucker, M., Dong, W.: Runtime verification with predictive semantics. In: Goodloe, A.E., Person, S. (eds.) NFM 2012. LNCS, vol. 7226, pp. 418\u2013432. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28891-3_37","DOI":"10.1007\/978-3-642-28891-3_37"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T14:07:02Z","timestamp":1672841222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17196-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031171956","9783031171963"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17196-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}