{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:13:33Z","timestamp":1773148413263,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642367410","type":"print"},{"value":"9783642367427","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","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":[[2013]]},"DOI":"10.1007\/978-3-642-36742-7_19","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:41:56Z","timestamp":1361216516000},"page":"260-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Runtime Verification Based on Register Automata"],"prefix":"10.1007","author":[{"given":"Radu","family":"Grigore","sequence":"first","affiliation":[]},{"given":"Dino","family":"Distefano","sequence":"additional","affiliation":[]},{"given":"Rasmus Lerchedahl","family":"Petersen","sequence":"additional","affiliation":[]},{"given":"Nikos","family":"Tzevelekos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","first-page":"45","volume":"197","author":"I. Aktug","year":"2008","unstructured":"Aktug, I., Naliuka, K.: ConSpec \u2013 a formal language for policy specification. ENTCS\u00a0197(1), 45\u201358 (2008)","journal-title":"ENTCS"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Allan, C., Avgustinov, P., Christensen, A.S., Hendren, L.J., Kuzins, S., Lhot\u00e1k, O., de Moor, O., Sereni, D., Sittampalam, G., Tibble, J.: Adding trace matching with free variables to AspectJ. In: OOPSLA, pp. 345\u2013364 (2005)","DOI":"10.1145\/1103845.1094839"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Arnold, M., Vechev, M., Yahav, E.: QVM: an efficient runtime for detecting defects in deployed systems. In: OOPSLA, pp. 143\u2013162 (2008)","DOI":"10.1145\/1449955.1449776"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-44585-4_25","volume-title":"Computer Aided Verification","author":"T. Ball","year":"2001","unstructured":"Ball, T., Rajamani, S.K.: The SLAM Toolkit. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 260\u2013264. Springer, Heidelberg (2001)"},{"key":"19_CR5","unstructured":"Ball, T., Rajamani, S.K.: Slic: a specification language for interface checking (of C). Technical Report MSR-TR-2001-21, Microsoft Research (2002)"},{"key":"19_CR6","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.\u00a07436, pp. 68\u201384. Springer, Heidelberg (2012)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Barringer, H., Groce, A., Havelund, K., Smith, M.: Formal Analysis of Log Files. Journal of Aerospace Computing, Information, and Communication\u00a07(11) (2010)","DOI":"10.2514\/1.49356"},{"key":"19_CR8","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.\u00a06664, pp. 57\u201372. Springer, Heidelberg (2011)"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","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.\u00a020(3), 675\u2013706 (2010)","journal-title":"J. Log. Comput."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Bierhoff, K., Aldrich, J.: Lightweight object specification with typestates. In: ESEC\/ SIGSOFT FSE, pp. 217\u2013226 (2005)","DOI":"10.1145\/1095430.1081741"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Bierhoff, K., Aldrich, J.: Modular typestate checking of aliased objects. In: OOPSLA, pp.\u00a0301\u2013320 (2007)","DOI":"10.1145\/1297105.1297050"},{"issue":"4-5","key":"19_CR12","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.tcs.2009.10.009","volume":"411","author":"H. Bj\u00f6rklund","year":"2010","unstructured":"Bj\u00f6rklund, H., Schwentick, T.: On notions of regularity for data languages. Theor. Comput. Sci.\u00a0411(4-5), 702\u2013715 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Blackburn, S.M., Garner, R., Hoffmann, C., Khan, A.M., McKinley, K.S., Bentzur, R., Diwan, A., Feinberg, D., Frampton, D., Guyer, S.Z., Hirzel, M., Hosking, A.L., Jump, M., Lee, H.B., Moss, J.E.B., Phansalkar, A., Stefanovic, D., VanDrunen, T., von Dincklage, D., Wiedermann, B.: The DaCapo benchmarks: Java benchmarking development and analysis. In: OOPSLA, pp.\u00a0169\u2013190 (2006)","DOI":"10.1145\/1167515.1167488"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-Variable Logic on Words with Data. In: LICS, pp.\u00a07\u201316 (2006)","DOI":"10.1109\/LICS.2006.51"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-540-24851-4_21","volume-title":"ECOOP 2004 \u2013 Object-Oriented Programming","author":"R. DeLine","year":"2004","unstructured":"DeLine, R., F\u00e4hndrich, M.: Typestates for Objects. In: Odersky, M. (ed.) ECOOP 2004. LNCS, vol.\u00a03086, pp. 465\u2013490. Springer, Heidelberg (2004)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Disney, T., Flanagan, C., McCarthy, J.: Temporal higher-order contracts. In: ICFP, pp.\u00a0176\u2013188 (2011)","DOI":"10.1145\/2034574.2034800"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Fink, S.J., Yahav, E., Dor, N., Ramalingam, G., Geay, E.: Effective typestate verification in the presence of aliasing. In: ISSTA, pp.\u00a0133\u2013144 (2006)","DOI":"10.1145\/1146238.1146254"},{"key":"19_CR18","unstructured":"Grigore, R., Petersen, R.L., Distefano, D.: TOPL: A language for specifying safety temporal properties of object-oriented programs. In: FOOL (2011)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Havelund, K., Rosu, G.: Monitoring Programs Using Rewriting. In: ASE, pp.\u00a0135\u2013143 (2001)","DOI":"10.1109\/ASE.2001.989799"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Jin, D., Meredith, P., Lee, C., Rosu, G.: JavaMOP: Efficient parametric runtime monitoring framework. In: ICSE, pp. 1427\u20131430 (2012)","DOI":"10.1109\/ICSE.2012.6227231"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci.\u00a0134(2) (1994)","DOI":"10.1016\/0304-3975(94)90242-9"},{"issue":"5","key":"19_CR22","doi-asserted-by":"publisher","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.\u00a078(5), 293\u2013303 (2009)","journal-title":"J. Log. Algebr. Program."},{"issue":"3","key":"19_CR23","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10009-011-0198-6","volume":"14","author":"P.O. Meredith","year":"2012","unstructured":"Meredith, P.O., Jin, D., Griffith, D., Chen, F., Rosu, G.: An overview of the MOP runtime verification framework. STTT\u00a014(3), 249\u2013289 (2012)","journal-title":"STTT"},{"issue":"3","key":"19_CR24","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F. Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans.\u00a0Comput.\u00a0Logic\u00a05(3), 403\u2013435 (2004)","journal-title":"ACM Trans.\u00a0Comput.\u00a0Logic"},{"key":"19_CR25","unstructured":"Newsome, J., Song, D.X.: Dynamic Taint Analysis for automatic detection, analysis, and signature generation of exploits on commodity software. In: NDSS (2005)"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Rosu, G., Chen, F.: Semantics and algorithms for parametric monitoring. LMCS\u00a08(1) (2012)","DOI":"10.2168\/LMCS-8(1:9)2012"},{"issue":"2","key":"19_CR27","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(99)00105-X","volume":"231","author":"H. Sakamoto","year":"2000","unstructured":"Sakamoto, H., Ikeda, D.: Intractability of decision problems for finite-memory automata. Theor. Comput. Sci.\u00a0231(2), 297\u2013308 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L. Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and Logics for Words and Trees over an Infinite Alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 41\u201357. Springer, Heidelberg (2006)"},{"issue":"1","key":"19_CR29","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/TSE.1986.6312929","volume":"12","author":"R.E. Strom","year":"1986","unstructured":"Strom, R.E., Yemini, S.: Typestate: A programming language concept for enhancing software reliability. IEEE Trans. Software Eng.\u00a012(1), 157\u2013171 (1986)","journal-title":"IEEE Trans. Software Eng."}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36742-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T21:32:49Z","timestamp":1745962369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36742-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367410","9783642367427"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36742-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}