{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:17:25Z","timestamp":1778498245668,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642407864","type":"print"},{"value":"9783642407871","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40787-1_4","type":"book-chapter","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T23:18:35Z","timestamp":1379546315000},"page":"59-75","source":"Crossref","is-referenced-by-count":46,"title":["From Propositional to First-Order Monitoring"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Bauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan-Christoph","family":"K\u00fcster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gil","family":"Vegliach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","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. In: Proc. 20th ACM SIGPLAN Conf. on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pp. 345\u2013364. ACM (2005)","DOI":"10.1145\/1094811.1094839"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1018985923441","volume":"22","author":"F. Bacchus","year":"1998","unstructured":"Bacchus, F., Kabanza, F.: Planning for temporally extended goals. Annals of Mathematics and Artificial Intelligence\u00a022, 5\u201327 (1998)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"4_CR3","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press (2008)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14295-6_1","volume-title":"Computer Aided Verification","author":"D. Basin","year":"2010","unstructured":"Basin, D., Klaedtke, F., M\u00fcller, S.: Policy monitoring in first-order temporal logic. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol.\u00a06174, pp. 1\u201318. Springer, Heidelberg (2010)"},{"key":"4_CR5","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., Gore, R., Tiu, A.: A first-order policy language for history-based transaction monitoring. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol.\u00a05684, pp. 96\u2013111. Springer, Heidelberg (2009)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-28891-3_18","volume-title":"NASA Formal Methods","author":"A. Bauer","year":"2012","unstructured":"Bauer, A., K\u00fcster, J.-C., Vegliach, G.: Runtime verification meets Android security. In: Goodloe, A.E., Person, S. (eds.) NFM 2012. LNCS, vol.\u00a07226, pp. 174\u2013180. Springer, Heidelberg (2012)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Bauer, A., K\u00fcster, J.-C., Vegliach, G.: From propositional to first-order monitoring. Computing Research Repository (CoRR) abs\/1303.3645. ACM (March 2013)","DOI":"10.1007\/978-3-642-40787-1_4"},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"14","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 Transactions on Software Engineering and Methodology\u00a020(4), 14 (2011)","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"4_CR9","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.\u00a05505, pp. 246\u2013261. Springer, Heidelberg (2009)"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","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.\u00a020(2), 149\u2013186 (1995)","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1006\/jcss.1995.1088","volume":"51","author":"J. Chomicki","year":"1995","unstructured":"Chomicki, J., Niwinski, D.: On the feasibility of checking temporal integrity constraints. J. Comput. Syst. Sci.\u00a051(3), 523\u2013535 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR12","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.\u00a05311, pp. 386\u2013396. Springer, Heidelberg (2008)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Dwyer, M., Avrunin, G., Corbett, J.: Patterns in property specifications for finite-state verification. In: Proc. 21st Intl. Conf. on Softw. Eng. (ICSE), pp. 411\u2013420. IEEE (1999)","DOI":"10.1145\/302405.302672"},{"key":"4_CR14","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 Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 27\u201339. Springer, Heidelberg (2003)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/11813040_37","volume-title":"FM 2006: Formal Methods","author":"A. Genon","year":"2006","unstructured":"Genon, A., Massart, T., Meuter, C.: Monitoring distributed controllers: When an efficient LTL algorithm on sequences is needed to model-check traces. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol.\u00a04085, pp. 557\u2013572. Springer, Heidelberg (2006)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Halle, S., Villemaire, R.: Runtime monitoring of message-based workflows with data. In: Proc. 12th Enterprise Distr. Object Comp. Conf. (EDOC), pp. 63\u201372. IEEE (2008)","DOI":"10.1109\/EDOC.2008.32"},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s10009-003-0117-6","volume":"6","author":"K. Havelund","year":"2004","unstructured":"Havelund, K., Rosu, G.: Efficient monitoring of safety properties. Software Tools for Technology Transfer\u00a06(2), 158\u2013173 (2004)","journal-title":"Software Tools for Technology Transfer"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Jin, D., Meredith, P.O., Lee, C., Rosu, G.: JavaMOP: Efficient parametric runtime monitoring framework. In: Proc. 34th Intl. Conf. on Softw. Eng. (ICSE), pp. 1427\u20131430. IEEE (2012)","DOI":"10.1109\/ICSE.2012.6227231"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Kuhtz, L., Finkbeiner, B.: Efficient parallel path checking for linear-time temporal logic with past and bounds. Logical Methods in Computer Science\u00a08(4) (2012)","DOI":"10.2168\/LMCS-8(4:10)2012"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer (2004)","DOI":"10.1007\/978-3-662-07003-1"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-45187-7_17","volume-title":"CONCUR 2003 - Concurrency Theory","author":"N. Markey","year":"2003","unstructured":"Markey, N., Schnoebelen, P.: Model checking a path. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 251\u2013265. Springer, Heidelberg (2003)"},{"issue":"3","key":"4_CR22","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A.P. Sistla","year":"1985","unstructured":"Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM\u00a032(3), 733\u2013749 (1985)","journal-title":"J. ACM"},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/69.390251","volume":"7","author":"A.P. Sistla","year":"1995","unstructured":"Sistla, A.P., Wolfson, O.: Temporal triggers in active databases. IEEE Trans. Knowl. Data Eng.\u00a07(3), 471\u2013486 (1995)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"4_CR24","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1093\/logcom\/exn078","volume":"20","author":"V. Stolz","year":"2010","unstructured":"Stolz, V.: Temporal assertions with parametrized propositions. J. Log. Comp.\u00a020(3), 743\u2013757 (2010)","journal-title":"J. Log. Comp."}],"container-title":["Lecture Notes in Computer Science","Runtime Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40787-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T12:00:52Z","timestamp":1558094452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40787-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642407864","9783642407871"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40787-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}