{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T20:00:45Z","timestamp":1770753645885,"version":"3.50.0"},"publisher-location":"Cham","reference-count":64,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319756318","type":"print"},{"value":"9783319756325","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-75632-5_3","type":"book-chapter","created":{"date-parts":[[2018,2,10]],"date-time":"2018-02-10T01:09:21Z","timestamp":1518224961000},"page":"61-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Monitoring Events that Carry Data"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Havelund","sequence":"first","affiliation":[]},{"given":"Giles","family":"Reger","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Thoma","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2312-5661","authenticated-orcid":false,"given":"Eugen","family":"Z\u0103linescu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,11]]},"reference":[{"key":"3_CR1","unstructured":"Clips website. http:\/\/clipsrules.sourceforge.net"},{"key":"3_CR2","unstructured":"Drools website. http:\/\/www.jboss.org\/drools"},{"key":"3_CR3","unstructured":"Rooscaloo website. https:\/\/github.com\/daveray\/rooscaloo"},{"key":"3_CR4","volume-title":"Foundations of Databases: The Logical Level","author":"S Abiteboul","year":"1994","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases: The Logical Level. Addison Wesley, Boston (1994)"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/1103845.1094839","volume":"40","author":"C Allan","year":"2005","unstructured":"Allan, C., Avgustinov, P., Christensen, A.S., Hendren, L., Kuzins, S., Lhot\u00e1k, O., de Moor, O., Sereni, D., Sittampalam, G., Tibble, J.: Adding trace matching with free variables to AspectJ. SIGPLAN Not. 40, 345\u2013364 (2005)","journal-title":"SIGPLAN Not."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-540-24730-2_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Alur","year":"2004","unstructured":"Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 467\u2013481. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24730-2_35"},{"issue":"1","key":"3_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/174644.174651","volume":"41","author":"R Alur","year":"1994","unstructured":"Alur, R., Henzinger, T.A.: A really temporal logic. J. ACM 41(1), 181\u2013204 (1994)","journal-title":"J. ACM"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-11164-3_3","volume-title":"Runtime Verification","author":"C Ballarin","year":"2014","unstructured":"Ballarin, C.: Two generalisations of Ro\u015fu and Chen\u2019s trace slicing algorithm A. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 15\u201330. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_3"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-77395-5_10","volume-title":"Runtime Verification","author":"H Barringer","year":"2007","unstructured":"Barringer, H., Rydeheard, D., Havelund, K.: Rule systems for run-time monitoring: from Eagle to Ruler. In: Sokolsky, O., Ta\u015f\u0131ran, S. (eds.) RV 2007. LNCS, vol. 4839, pp. 111\u2013125. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77395-5_10"},{"key":"3_CR10","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":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-24622-0_5","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"H Barringer","year":"2004","unstructured":"Barringer, H., Goldberg, A., Havelund, K., Sen, K.: Rule-based runtime verification. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 44\u201357. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24622-0_5"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-21437-0_7","volume-title":"FM 2011: Formal Methods","author":"H Barringer","year":"2011","unstructured":"Barringer, H., Havelund, K.: TraceContract: a Scala DSL for trace analysis. In: Butler, M., Schulte, W. (eds.) FM 2011. LNCS, vol. 6664, pp. 57\u201372. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21437-0_7"},{"issue":"3","key":"3_CR13","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1093\/logcom\/exn076","volume":"20","author":"H Barringer","year":"2010","unstructured":"Barringer, H., Rydeheard, D.E., Havelund, K.: Rule systems for run-time monitoring: from Eagle to RuleR. J. Log. Comput. 20(3), 675\u2013706 (2010)","journal-title":"J. Log. Comput."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Bartocci, E., Falcone, Y., Bonakdarpour, B., Colombo, C., Decker, N., Havelund, K., Joshi, Y., Klaedtke, F., Milewicz, R., Reger, G., Rosu, G., Signoles, J., Thoma, D., Zalinescu, E., Zhang, Y.: First international competition on runtime verification: rules, benchmarks, tools, and final results of CRV 2014. Int. J. Softw. Tools Technol. Trans. 1\u201340 (2017)","DOI":"10.1007\/s10009-017-0454-5"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-642-29860-8_27","volume-title":"Runtime Verification","author":"D Basin","year":"2012","unstructured":"Basin, D., Harvan, M., Klaedtke, F., Z\u0103linescu, E.: MONPOLY: monitoring usage-control policies. In: Khurshid, S., Sen, K. (eds.) RV 2011. LNCS, vol. 7186, pp. 360\u2013364. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29860-8_27"},{"issue":"3","key":"3_CR16","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/s10703-015-0222-7","volume":"46","author":"DA Basin","year":"2015","unstructured":"Basin, D.A., Klaedtke, F., Marinovic, S., Z\u0103linescu, E.: Monitoring of temporal first-order properties with aggregations. Form. Method. Syst. Des. 46(3), 262\u2013285 (2015)","journal-title":"Form. Method. Syst. Des."},{"issue":"2","key":"3_CR17","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/2699444","volume":"62","author":"DA Basin","year":"2015","unstructured":"Basin, D.A., Klaedtke, F., M\u00fcller, S., Z\u0103linescu, E.: Monitoring metric first-order temporal properties. J. ACM 62(2), 15 (2015)","journal-title":"J. ACM"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-03466-4_6","volume-title":"Theoretical Aspects of Computing - ICTAC 2009","author":"A Bauer","year":"2009","unstructured":"Bauer, A., Gor\u00e9, R., Tiu, A.: A first-order policy language for history-based transaction monitoring. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol. 5684, pp. 96\u2013111. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03466-4_6"},{"issue":"3","key":"3_CR19","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/s10703-015-0227-2","volume":"46","author":"A Bauer","year":"2015","unstructured":"Bauer, A., K\u00fcster, J., Vegliach, G.: The ins and outs of first-order runtime verification. Form. Method. Syst. Des. 46(3), 286\u2013316 (2015)","journal-title":"Form. Method. Syst. Des."},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/11944836_25","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"A Bauer","year":"2006","unstructured":"Bauer, A., Leucker, M., Schallhart, C.: Monitoring of real-time properties. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 260\u2013272. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11944836_25"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-77395-5_11","volume-title":"Runtime Verification","author":"A Bauer","year":"2007","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"},{"issue":"4","key":"3_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2000799.2000800","volume":"20","author":"A Bauer","year":"2011","unstructured":"Bauer, A., Leucker, M., Schallhart, C.: Runtime verification for LTL and TLTL. ACM Trans. Softw. Eng. Methodol. 20(4), 1\u201364 (2011)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"3_CR23","doi-asserted-by":"crossref","first-page":"425","DOI":"10.7551\/mitpress\/5641.003.0021","volume-title":"Proof, Language, and Interaction","author":"G Berry","year":"2000","unstructured":"Berry, G.: The foundations of Esterel. In: Plotkin, G., Stirling, C., Tofte, M. (eds.) Proof, Language, and Interaction, pp. 425\u2013454. MIT Press, Cambridge (2000)"},{"key":"3_CR24","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.tcs.2016.04.019","volume":"631","author":"L Bozzelli","year":"2016","unstructured":"Bozzelli, L., S\u00e1nchez, C.: Foundations of Boolean stream runtime verification. Theoret. Comput. Sci. 631, 118\u2013138 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-00768-2_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F Chen","year":"2009","unstructured":"Chen, F., Ro\u015fu, G.: Parametric trace slicing and monitoring. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 246\u2013261. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00768-2_23"},{"issue":"2","key":"3_CR26","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 Trans. Database Syst. 20(2), 149\u2013186 (1995)","journal-title":"ACM Trans. Database Syst."},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-319-08867-9_9","volume-title":"Computer Aided Verification","author":"O Chowdhury","year":"2014","unstructured":"Chowdhury, O., Jia, L., Garg, D., Datta, A.: Temporal mode-checking for runtime monitoring of privacy policies. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 131\u2013149. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_9"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Colombo, C., Pace, G.J., Schneider, G.: LARVA \u2014 safer monitoring of real-time Java programs (tool paper). In: Proceedings of the 7th IEEE International Conference on Software Engineering and Formal Methods, SEFM 2009, pp. 33\u201337. IEEE Computer Society (2009)","DOI":"10.1109\/SEFM.2009.13"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, B., Sankaranarayanan, S., S\u00e1nchez, C., Robinson, W., Finkbeiner, B., Sipma, H.B., Mehrotra, S., Manna, Z.: LOLA: runtime monitoring of synchronous systems. In: Proceedings of the 12th International Symposium on Temporal Representation and Reasoning, pp. 166\u2013174. IEEE Computer Society (2005)","DOI":"10.1109\/TIME.2005.26"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-662-49674-9_54","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N Decker","year":"2016","unstructured":"Decker, N., Harder, J., Scheffel, T., Schmitz, M., Thoma, D.: Runtime monitoring with union-find structures. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 868\u2013884. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_54"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-40787-1_11","volume-title":"Runtime Verification","author":"N Decker","year":"2013","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"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-642-38088-4_34","volume-title":"NASA Formal Methods","author":"N Decker","year":"2013","unstructured":"Decker, N., Leucker, M., Thoma, D.: jUnitRV\u2013adding runtime verification to jUnit. In: Brat, G., Rungta, N., Venet, A. (eds.) NFM 2013. LNCS, vol. 7871, pp. 459\u2013464. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38088-4_34"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-54862-8_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N Decker","year":"2014","unstructured":"Decker, N., Leucker, M., Thoma, D.: Monitoring modulo theories. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 341\u2013356. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_23"},{"issue":"2","key":"3_CR34","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10009-015-0380-3","volume":"18","author":"N Decker","year":"2016","unstructured":"Decker, N., Leucker, M., Thoma, D.: Monitoring modulo theories. Int. J. Softw. Tools Technol. Trans. 18(2), 205\u2013225 (2016)","journal-title":"Int. J. Softw. Tools Technol. Trans."},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-88387-6_33","volume-title":"Automated Technology for Verification and Analysis","author":"W Dong","year":"2008","unstructured":"Dong, W., Leucker, M., Schallhart, C.: Impartial anticipation in runtime-verification. In: Cha, S.S., Choi, J.-Y., Kim, M., Lee, I., Viswanathan, M. (eds.) ATVA 2008. LNCS, vol. 5311, pp. 386\u2013396. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88387-6_33"},{"key":"3_CR36","unstructured":"Doorenbos, R.B.: Production matching for large learning systems. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA (1995)"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-45069-6_3","volume-title":"Computer Aided Verification","author":"C Eisner","year":"2003","unstructured":"Eisner, C., Fisman, D., Havlicek, J., Lustig, Y., McIsaac, A., Van Campenhout, D.: 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"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-319-23820-3_27","volume-title":"Runtime Verification","author":"Y Falcone","year":"2015","unstructured":"Falcone, Y., Ni\u010dkovi\u0107, D., Reger, G., Thoma, D.: Second international competition on runtime verification. In: Bartocci, E., Majumdar, R. (eds.) RV 2015. LNCS, vol. 9333, pp. 405\u2013422. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23820-3_27"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-319-46982-9_10","volume-title":"Runtime Verification","author":"P Faymonville","year":"2016","unstructured":"Faymonville, P., Finkbeiner, B., Schirmer, S., Torfah, H.: A stream-based specification language for network monitoring. In: Falcone, Y., S\u00e1nchez, C. (eds.) RV 2016. LNCS, vol. 10012, pp. 152\u2013168. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46982-9_10"},{"key":"3_CR40","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0004-3702(82)90020-0","volume":"19","author":"C Forgy","year":"1982","unstructured":"Forgy, C.: Rete: a fast algorithm for the many pattern\/many object pattern match problem. Artif. Intell. 19, 17\u201337 (1982)","journal-title":"Artif. Intell."},{"key":"3_CR41","unstructured":"Fusco, M.: Hammurabi - a Scala rule engine. In: Scala Days 2011, Stanford University, California (2011)"},{"key":"3_CR42","volume-title":"Database Systems: The Complete Book","author":"H Garcia-Molina","year":"2009","unstructured":"Garcia-Molina, H., Ullman, J.D., Widom, J.: Database Systems: The Complete Book. Pearson Education, Upper Saddle River (2009)"},{"key":"3_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-89247-2_1","volume-title":"Runtime Verification","author":"J Goubault-Larrecq","year":"2008","unstructured":"Goubault-Larrecq, J., Olivain, J.: A smell of ORCHIDS. In: Leucker, M. (ed.) RV 2008. LNCS, vol. 5289, pp. 1\u201320. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89247-2_1"},{"issue":"4","key":"3_CR44","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/s10009-003-0107-8","volume":"4","author":"J H\u00e5kansson","year":"2003","unstructured":"H\u00e5kansson, J., Jonsson, B., Lundqvist, O.: Generating online test oracles from temporal logic specifications. Int. J. Softw. Tools Technol. Trans. 4(4), 456\u2013471 (2003)","journal-title":"Int. J. Softw. Tools Technol. Trans."},{"issue":"9","key":"3_CR45","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1109\/5.97300","volume":"79","author":"N Halbwachs","year":"1991","unstructured":"Halbwachs, N., Caspi, P., Raymond, P., Pilaud, D.: The synchronous dataflow programming language Lustre. Proc. IEEE 79(9), 1305\u20131320 (1991)","journal-title":"Proc. IEEE"},{"issue":"2","key":"3_CR46","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TSC.2011.10","volume":"5","author":"S Hall\u00e9","year":"2012","unstructured":"Hall\u00e9, S., Villemaire, R.: Runtime enforcement of web service message contracts with data. IEEE Trans. Servic. Comput. 5(2), 192\u2013206 (2012)","journal-title":"IEEE Trans. Servic. Comput."},{"issue":"2","key":"3_CR47","doi-asserted-by":"crossref","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. Trans. 17(2), 143\u2013170 (2015)","journal-title":"Int. J. Softw. Tools Technol. Trans."},{"key":"3_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-319-63121-9_16","volume-title":"Models, Algorithms, Logics and Tools: Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday","author":"K Havelund","year":"2017","unstructured":"Havelund, K., Reger, G.: Runtime verification logics - a language design perspective. In: Aceto, L., Bacci, G., Bacci, G., Ing\u00f3lfsd\u00f3ttir, A., Legay, A., Mardare, R. (eds.) Models, Algorithms, Logics and Tools: Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday. LNCS, vol. 10460, pp. 310\u2013338. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63121-9_16"},{"key":"3_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-77395-5_5","volume-title":"Runtime Verification","author":"C Herzeel","year":"2007","unstructured":"Herzeel, C., Gybels, K., Costanza, P.: Escaping with future variables in HALO. In: Sokolsky, O., Ta\u015f\u0131ran, S. (eds.) RV 2007. LNCS, vol. 4839, pp. 51\u201362. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77395-5_5"},{"issue":"1\u20133","key":"3_CR50","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0168-0072(00)00018-X","volume":"106","author":"IM Hodkinson","year":"2000","unstructured":"Hodkinson, I.M., Wolter, F., Zakharyaschev, M.: Decidable fragment of first-order temporal logics. Ann. Pure Appl. Log. 106(1\u20133), 85\u2013134 (2000)","journal-title":"Ann. Pure Appl. Log."},{"key":"3_CR51","volume-title":"The Spin Model Checker - Primer and Reference Manual","author":"GJ Holzmann","year":"2004","unstructured":"Holzmann, G.J.: The Spin Model Checker - Primer and Reference Manual. Addison-Wesley, Boston (2004)"},{"key":"3_CR52","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. (2007)"},{"issue":"4","key":"3_CR53","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01995674","volume":"2","author":"R Koymans","year":"1990","unstructured":"Koymans, R.: Specifying real-time properties with metric temporal logic. Real-Time Syst. 2(4), 255\u2013299 (1990)","journal-title":"Real-Time Syst."},{"key":"3_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-75292-9_20","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2007","author":"M Leucker","year":"2007","unstructured":"Leucker, M., S\u00e1nchez, C.: Regular linear temporal logic. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 291\u2013305. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75292-9_20"},{"issue":"5","key":"3_CR55","doi-asserted-by":"crossref","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. Algebr. Program. 78(5), 293\u2013303 (2009)","journal-title":"J. Log. Algebr. Program."},{"issue":"3","key":"3_CR56","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10009-011-0198-6","volume":"14","author":"PO Meredith","year":"2012","unstructured":"Meredith, P.O., Jin, D., Griffith, D., Chen, F., Ro\u015fu, G.: An overview of the MOP runtime verification framework. Int. J. Softw. Tools Technol. Trans. 14(3), 249\u2013289 (2012)","journal-title":"Int. J. Softw. Tools Technol. Trans."},{"key":"3_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-642-29860-8_31","volume-title":"Runtime Verification","author":"R Purandare","year":"2012","unstructured":"Purandare, R., Dwyer, M.B., Elbaum, S.: Monitoring finite state properties: algorithmic approaches and their relative strengths. In: Khurshid, S., Sen, K. (eds.) RV 2011. LNCS, vol. 7186, pp. 381\u2013395. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29860-8_31"},{"key":"3_CR58","unstructured":"Reger, G.: Automata based monitoring and mining of execution traces. Ph.D. thesis, University of Manchester (2014)"},{"key":"3_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-662-46681-0_55","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Reger","year":"2015","unstructured":"Reger, G., Cruz, H.C., Rydeheard, D.: MarQ: monitoring at runtime with QEA. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 596\u2013610. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_55"},{"key":"3_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-46982-9_3","volume-title":"Runtime Verification","author":"G Reger","year":"2016","unstructured":"Reger, G., Hall\u00e9, S., Falcone, Y.: Third international competition on runtime verification. In: Falcone, Y., S\u00e1nchez, C. (eds.) RV 2016. LNCS, vol. 10012, pp. 21\u201337. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46982-9_3"},{"key":"3_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-319-23820-3_14","volume-title":"Runtime Verification","author":"G Reger","year":"2015","unstructured":"Reger, G., Rydeheard, D.: From first-order temporal logic to parametric trace slicing. In: Bartocci, E., Majumdar, R. (eds.) RV 2015. LNCS, vol. 9333, pp. 216\u2013232. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23820-3_14"},{"issue":"1","key":"3_CR62","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-8(1:9)2012","volume":"8","author":"G Ro\u015fu","year":"2012","unstructured":"Ro\u015fu, G., Chen, F.: Semantics and algorithms for parametric monitoring. Log. Methods Comput. Sci. 8(1), 1\u201347 (2012)","journal-title":"Log. Methods Comput. Sci."},{"issue":"3","key":"3_CR63","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1093\/logcom\/exn078","volume":"20","author":"V Stolz","year":"2010","unstructured":"Stolz, V.: Temporal assertions with parameterized propositions. J. Logic Comput. 20(3), 743\u2013757 (2010)","journal-title":"J. Logic Comput."},{"key":"3_CR64","doi-asserted-by":"crossref","unstructured":"Stolz, V., Bodden, E.: Temporal assertions using AspectJ. In: Proceeding of the 5th International Workshop on Runtime Verification (RV 2005). ENTCS, vol. 144(4), pp. 109\u2013124. Elsevier (2006)","DOI":"10.1016\/j.entcs.2006.02.007"}],"container-title":["Lecture Notes in Computer Science","Lectures on Runtime Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75632-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T03:20:44Z","timestamp":1719804044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-75632-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319756318","9783319756325"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75632-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}