{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T15:55:04Z","timestamp":1767887704669,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540773948","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77395-5_11","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T06:25:53Z","timestamp":1196922353000},"page":"126-138","source":"Crossref","is-referenced-by-count":89,"title":["The Good, the Bad, and the Ugly, But How Ugly Is Ugly?"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Bauer","sequence":"first","affiliation":[]},{"given":"Martin","family":"Leucker","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Schallhart","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Arafat, O., Bauer, A., Leucker, M., Schallhart, C.: Runtime verification revisited. Technical Report TUM-I0518, Technische Universit\u00e4t M\u00fcnchen (2005)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11944836_25","volume-title":"Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)","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.\u00a04337, Springer, Heidelberg (2006)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/11513988_36","volume-title":"Computer Aided Verification","author":"M. d\u2019Amorim","year":"2005","unstructured":"d\u2019Amorim, M., Rosu, G.: Efficient monitoring of omega-languages. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 364\u2013378. Springer, Heidelberg (2005)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/10722468_19","volume-title":"SPIN","author":"D. Drusinsky","year":"2000","unstructured":"Drusinsky, D.: The temporal rover and the atg rover. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN. LNCS, vol.\u00a01885, pp. 323\u2013330. Springer, Heidelberg (2000)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-3-540-45069-6_3","volume-title":"CAV 2003","author":"C. Eisner","year":"2003","unstructured":"Eisner, C., Fisman, D., Havlicek, J., Lustig, Y., McIsaac, A., Campenhout, D.: Reasoning with temporal logic on truncated paths. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 27\u201339. Springer, Heidelberg (2003)"},{"key":"11_CR6","first-page":"412","volume-title":"ASE","author":"D. Giannakopoulou","year":"2001","unstructured":"Giannakopoulou, D., Havelund, K.: Automata-based verification of temporal properties on running programs. In: ASE, pp. 412\u2013416. IEEE Computer Society, Los Alamitos (2001)"},{"key":"11_CR7","unstructured":"Giannakopoulou, D., Havelund, K.: Runtime analysis of linear temporal logic specifications. Technical Report 01.21, RIACS\/USRA (2001)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Havelund, K., Rosu, G.: Monitoring Java Programs with Java PathExplorer. Electr. Notes Theor. Comp. Sci.\u00a055(2) (2001)","DOI":"10.1016\/S1571-0661(04)00253-1"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/ASE.2001.989799","volume-title":"ASE 2001. Proceedings of the 16th IEEE International Conference on Automated Software Engineering","author":"K. Havelund","year":"2001","unstructured":"Havelund, K., Rosu, G.: Monitoring programs using rewriting. In: ASE 2001. Proceedings of the 16th IEEE International Conference on Automated Software Engineering, Washington, DC, USA, p. 135. IEEE Computer Society, Los Alamitos (2001)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Havelund, K., Rosu, G.: Synthesizing Monitors for Safety Properties. Tools and Algorithms for Construction and Analysis of Systems, 342\u2013356 (2002)","DOI":"10.1007\/3-540-46002-0_24"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Lichtenstein, O., Pnueli, A., Zuck, L.: The Glory of the Past. In: Proceedings of the Conference on Logic of Programs, pp. 196\u2013218 (1985)","DOI":"10.1007\/3-540-15648-8_16"},{"key":"11_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4222-2","volume-title":"Temporal Verification of Reactive Systems: Safety","author":"Z. Manna","year":"1995","unstructured":"Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)"},{"key":"11_CR13","first-page":"46","volume-title":"Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (FOCS-77)","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (FOCS-77), pp. 46\u201357. IEEE, Los Alamitos (1977)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/11813040_38","volume-title":"FM 2006: Formal Methods","author":"A. Pnueli","year":"2006","unstructured":"Pnueli, A., Zaks, A.: Psl model checking and run-time verification via testers. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol.\u00a04085, pp. 573\u2013586. Springer, Heidelberg (2006)"},{"key":"11_CR15","series-title":"To be published in ENTCS","volume-title":"Fifth Workshop on Runtime Verification (RV 2005)","author":"V. Stolz","year":"2005","unstructured":"Stolz, V., Bodden, E.: Temporal Assertions using AspectJ. In: Fifth Workshop on Runtime Verification (RV 2005). To be published in ENTCS, Elsevier, Amsterdam (2005)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/3-540-60915-6_6","volume-title":"Logics for Concurrency","author":"M..Y. Vardi","year":"1996","unstructured":"Vardi, M.Y.: An Automata-Theoretic Approach to Linear Temporal Logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043, pp. 238\u2013266. Springer, Heidelberg (1996)"},{"key":"11_CR17","first-page":"332","volume-title":"Symposium on Logic in Computer Science LICS 1986","author":"M.Y. Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Symposium on Logic in Computer Science LICS 1986, pp. 332\u2013345. IEEE Computer Society Press, Washington (1986)"}],"container-title":["Lecture Notes in Computer Science","Runtime Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77395-5_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:10:31Z","timestamp":1619507431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77395-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540773948"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77395-5_11","relation":{},"subject":[]}}