{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:50:35Z","timestamp":1776444635642,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_10","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:25:53Z","timestamp":1196940353000},"page":"111-125","source":"Crossref","is-referenced-by-count":55,"title":["Rule Systems for Run-Time Monitoring: From Eagle to RuleR"],"prefix":"10.1007","author":[{"given":"Howard","family":"Barringer","sequence":"first","affiliation":[]},{"given":"David","family":"Rydeheard","sequence":"additional","affiliation":[]},{"given":"Klaus","family":"Havelund","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Barringer, H., Fisher, M., Gabbay, D., Owens, R., Reynolds, M.: The Imperative Future: Principles of Executable Temporal Logic. Research Studies Press (1996)"},{"key":"10_CR2","first-page":"533","volume-title":"Formal Aspects of Computing","author":"H. Barringer","year":"1995","unstructured":"Barringer, H., Fisher, M., Gabbay, D., Gough, G., Owens, R.: An Introduction. In: Formal Aspects of Computing, vol.\u00a07(5), pp. 533\u2013549. Springer, London (1995)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"VMCAI 2004, 5th Int. Conf. on 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.\u00a02937, Springer, Heidelberg (2004)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","first-page":"264","volume-title":"Rechner-Gest\u00fctzter Unterricht","author":"H. Barringer","year":"2004","unstructured":"Barringer, H., Goldberg, A., Havelund, K., Sen, K.: Run-time Monitoring in Eagle. In: Brunnstein, K., H\u00e4ndler, W., Haefner, K. (eds.) RGU 1974. LNCS, vol.\u00a017, p. 264. Springer, Heidelberg (2004)"},{"key":"10_CR5","unstructured":"Barringer, H., Rydeheard, D., Gabbay, D.: Reactive Grammars: An Initial Exploration, Draft paper(2007), see \n                    \n                      http:\/\/www.cs.man.ac.uk\/~david\/reactive.html"},{"issue":"4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1093\/logcom\/7.4.429","volume":"7","author":"M.D. Fisher","year":"1997","unstructured":"Fisher, M.D.: A Normal Form for Temporal Logics and its Applications in Theorem-Proving and Execution. Journal of Logic and Computation\u00a07(4), 429\u2013456 (1997)","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/B:FORM.0000017718.28096.48","volume":"24","author":"B. Finkbeiner","year":"2004","unstructured":"Finkbeiner, B., Sipma, H.: Checking Finite Traces Using Alternating Automata. Formal Methods in System Design\u00a024(2), 101\u2013127 (2004)","journal-title":"Formal Methods in System Design"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","first-page":"67","volume-title":"Temporal Logic in Specification","author":"D.M. Gabbay","year":"1989","unstructured":"Gabbay, D.M.: Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems. In: Banieqbal, B., Pnueli, A., Barringer, H. (eds.) Temporal Logic in Specification. LNCS, vol.\u00a0398, pp. 67\u201389. Springer, Heidelberg (1989)"},{"key":"10_CR9","unstructured":"Gabbay, D.M.: Introducing Reactive Kripke Semantics and Arc Accessibility. In: Gabbay, D.M. (ed.) To appear in Festschrift in Honour of Boaz Traktenbrot (2007)"},{"issue":"11","key":"10_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.tcs.2004.12.029","volume":"337","author":"E. Moriya","year":"2005","unstructured":"Moriya, E., Hofbauer, D., Huber, M., Otto, F.: On State-Alternating Context-Free Grammars. Theoretical Computer Science\u00a0337(11), 183\u2013216 (2005)","journal-title":"Theoretical Computer Science"}],"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_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:10:30Z","timestamp":1619521830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77395-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540773948"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77395-5_10","relation":{},"subject":[]}}