{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:56:52Z","timestamp":1725530212598},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642009815"},{"type":"electronic","value":"9783642009822"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00982-2_9","type":"book-chapter","created":{"date-parts":[[2009,3,30]],"date-time":"2009-03-30T19:51:54Z","timestamp":1238442714000},"page":"105-116","source":"Crossref","is-referenced-by-count":1,"title":["Matching Trace Patterns with Regular Policies"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Bauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alwen","family":"Tiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/3-540-46002-0_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Armoni","year":"2002","unstructured":"Armoni, R., Fix, L., Flaisher, A., Gerth, R., Ginsburg, B., Kanza, T., Landver, A., Mador-Haim, S., Singerman, E., Tiemeyer, A., Vardi, M.Y., Zbar, Y.: The forSpec temporal logic: A new temporal property-specification language. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, p. 296. Springer, Heidelberg (2002)"},{"key":"9_CR2","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.\u00a04337, pp. 260\u2013272. Springer, Heidelberg (2006)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/11901433_41","volume-title":"Formal Methods and Software Engineering","author":"A. Bauer","year":"2006","unstructured":"Bauer, A., Leucker, M., Streit, J.: SALT\u2014structured assertion language for temporal logic. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol.\u00a04260, pp. 757\u2013775. Springer, Heidelberg (2006)"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.tcs.2008.03.011","volume":"404","author":"S. Ben-David","year":"2008","unstructured":"Ben-David, S., Fisman, D., Ruah, S.: Embedding finite automata within regular expressions. Theoretical Computer Science\u00a0404, 202\u2013218 (2008)","journal-title":"Theoretical Computer Science"},{"key":"9_CR5","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0022-0000(93)90005-H","volume":"46","author":"J. Cohen","year":"1993","unstructured":"Cohen, J., Perrin, D., Pin, J.-E.: On the expressive power of temporal logic. J. Comput. System Sci.\u00a046, 271\u2013294 (1993)","journal-title":"J. Comput. System Sci."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/11498490_24","volume-title":"Model-Based Testing of Reactive Systems","author":"S. Colin","year":"2005","unstructured":"Colin, S., Mariani, L.: Run-time verification. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol.\u00a03472, pp. 525\u2013555. Springer, Heidelberg (2005)"},{"key":"9_CR8","series-title":"Series on Integrated Circuits and Systems","volume-title":"A Practical Introduction to PSL","author":"C. Eisner","year":"2006","unstructured":"Eisner, C., Fisman, D.: A Practical Introduction to PSL. Series on Integrated Circuits and Systems. Springer, Heidelberg (2006)"},{"key":"9_CR9","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":"9_CR10","volume-title":"Computers and Intractability \u2014 A guide to NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2014 A guide to NP-completeness. W. H. Freeman and Company, San Francisco (1979)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-46002-0_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Havelund","year":"2002","unstructured":"Havelund, K., Rosu, G.: Synthesizing monitors for safety properties. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, p. 342. Springer, Heidelberg (2002)"},{"key":"9_CR12","unstructured":"Kirchner, C., Kirchner, H., Santana de Oliveira, A.: Analysis of rewrite-based access control policies. In: Proc. 3rd International Workshop on Security and Rewriting Techniques (2008)"},{"key":"9_CR13","volume-title":"Proc. FOCS 1977","author":"D. Kozen","year":"1977","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: Proc. FOCS 1977. IEEE Computer Society, Los Alamitos (1977)"},{"key":"9_CR14","volume-title":"Proc. ACM Conference on Computer and Communications Security","author":"K. Krukow","year":"2005","unstructured":"Krukow, K., Nielsen, M., Sassone, V.: A framework for concrete reputation-systems with applications to history-based access control. In: Proc. ACM Conference on Computer and Communications Security. ACM, New York (2005)"},{"key":"9_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The Temporal Logic of Reactive and Concurrent Systems: Specification","author":"Z. Manna","year":"1992","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1992)"},{"key":"9_CR16","volume-title":"Handbook of Theoretical Computer Science","author":"D. Perrin","year":"1990","unstructured":"Perrin, D.: Finite Automata. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B. Elsevier, Amsterdam (1990)"},{"key":"9_CR17","volume-title":"Proc. FOCS 1999","author":"W. Plandowski","year":"1999","unstructured":"Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. In: Proc. FOCS 1999. IEEE Computer Society, Los Alamitos (1999)"},{"key":"9_CR18","volume-title":"Proc. FOCS 1977","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. FOCS 1977. IEEE Computer Society, Los Alamitos (1977)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationship between nondeterministic and deterministic tape complexities. J. of Computer and System Sciences\u00a04, 177\u2013192 (1970)","journal-title":"J. of Computer and System Sciences"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/353323.353382","volume":"3","author":"F.B. Schneider","year":"2000","unstructured":"Schneider, F.B.: Enforceable security policies. ACM Trans. Inf. Syst. Secur.\u00a03(1), 30\u201350 (2000)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55124-7_4","volume-title":"Word Equations and Related Topics","author":"K.U. Schulz","year":"1992","unstructured":"Schulz, K.U.: Makanin\u2019s algorithm for word equations - two improvements and a generalization. In: Schulz, K.U. (ed.) IWWERT 1990. LNCS, vol.\u00a0572. Springer, Heidelberg (1992)"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A. Prasad Sistla","year":"1985","unstructured":"Prasad Sistla, A., Clarke, E.C.: The complexity of propositional linear temporal logic. J. of the ACM\u00a032(3), 733\u2013749 (1985)","journal-title":"J. of the ACM"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. In: Proc. STOC 1984 (1984)","DOI":"10.1145\/800057.808711"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00982-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T08:28:53Z","timestamp":1551947333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00982-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642009815","9783642009822"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00982-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}