{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:47Z","timestamp":1761610367788,"version":"build-2065373602"},"reference-count":32,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3589,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["F30602-00-2-0586","F33615-01-C-1907"],"award-info":[{"award-number":["F30602-00-2-0586","F33615-01-C-1907"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-02-1-0715"],"award-info":[{"award-number":["N00014-02-1-0715"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s1571-0661(04)81051-x","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"226-245","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":43,"title":["Generating Optimal Monitors for Extended Regular Expressions"],"prefix":"10.1016","volume":"89","author":[{"given":"Koushik","family":"Sen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grigore","family":"Ro\u015fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S1571-0661(04)81051-X_NEWBIB1","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","article-title":"Partial derivatives of regular expressions and finite automaton constructions","volume":"155","author":"Antimirov","year":"1996","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10.1016\/S1571-0661(04)81051-X_NEWBIB2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(95)80024-4","article-title":"Rewriting extended regular expressions","volume":"143","author":"Antimirov","year":"1995","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10.1016\/S1571-0661(04)81051-X_NEWBIB3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB4","series-title":"3rd International Workshop on Rewriting Logic and its Applications (WRLA'00), volume 36 of Electronic Notes in Theoretical Computer Science","article-title":"Towards Maude 2.0","author":"Clavel","year":"2000"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB5","doi-asserted-by":"crossref","unstructured":"D. Drusinsky. The Temporal Rover and the ATG Rover. In SPIN Model Checking and Software Verification, volume 1885 of Lecture Notes in Computer Science, pages 323\u2013330. Springer, 2000.","DOI":"10.1007\/10722468_19"},{"issue":"1","key":"10.1016\/S1571-0661(04)81051-X_NEWBIB6","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1002\/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N","article-title":"An open graph visualization system and its applications to software engineering","volume":"30","author":"Gansner","year":"2000","journal-title":"Software Practice and Experience"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB7","unstructured":"D. Giannakopoulou and K. Havelund. Automata-Based Verification of Temporal Properties on Running Programs. In Proceedings, International Conference on Automated Software Engineering (ASE'01), pages 412\u2013416. Institute of Electrical and Electronics Engineers, 2001. Coronado Island, California."},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB8","doi-asserted-by":"crossref","unstructured":"J. Goguen, K. Lin, and G. Ro\u015fu. Circular coinductive rewriting. In Proceedings, Automated Software Engineering '00, pages 123\u2013131. IEEE, 2000. (Grenoble, France).","DOI":"10.1109\/ASE.2000.873657"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB9","doi-asserted-by":"crossref","unstructured":"J. Goguen, K. Lin, and G. Rosu. Conditional circular coinductive rewriting with case analysis. In Recent Trends in Algebraic Development Techniques (WADT'02), Lecture Notes in Computer Science, to appear, Frauenchiemsee, Germany, September 2002. Springer-Verlag.","DOI":"10.1007\/978-3-540-40020-2_12"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB10","unstructured":"K. Havelund and G. Ro\u015fu. Java PathExplorer \u2013 A Runtime Verification Tool. In The 6th International Symposium on Artificial Intelligence, Robotics and Automation in Space: A New Space Odyssey, Montreal, Canada, June 18 \u2013 21, 2001."},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB11","doi-asserted-by":"crossref","unstructured":"K. Havelund and G. Ro\u015fu. Monitoring Programs using Rewriting. In Proceedings, International Conference on Automated Software Engineering (ASE'01), pages 135\u2013143. Institute of Electrical and Electronics Engineers, 2001. Coronado Island, California.","DOI":"10.1109\/ASE.2001.989799"},{"key":"#cr-split#-10.1016\/S1571-0661(04)81051-X_NEWBIB12.1","unstructured":"K. Havelund and G. Ro\u015fu. Runtime Verification 2002, volume 70"},{"key":"#cr-split#-10.1016\/S1571-0661(04)81051-X_NEWBIB12.2","unstructured":"(4) of Electronic Notes in Theoretical Computer Science. Elsevier Science, 2002. Proceedings of a Computer Aided Verification (CAV'02) satellite workshop."},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB13","doi-asserted-by":"crossref","unstructured":"K. Havelund and G. Ro\u015fu. Synthesizing monitors for safety properties. In Tools and Algorithms for Construction and Analysis of Systems (TACAS'02), volume 2280 of Lecture Notes in Computer Science, pages 342\u2013356. Springer, 2002.","DOI":"10.1007\/3-540-46002-0_24"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB14","unstructured":"S. Hirst. A new algorithm solving membership of extended regular expressions. Technical report, The University of Sydney, 1989."},{"year":"1979","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","key":"10.1016\/S1571-0661(04)81051-X_NEWBIB15"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB16","doi-asserted-by":"crossref","unstructured":"L. Ilie, B. Shan, and S. Yu. Fast algorithms for extended regular expression matching and searching. In H. Alt and M. Habib, editors, Proceedings of the 20th International Symposium on Theoretical Aspects of Computer (STACS 03), volume 2607 of Lecture Notes in Computer Science, page 179. Springer-Verlag, Berlin, 2003.","DOI":"10.1007\/3-540-36494-3_17"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB17","doi-asserted-by":"crossref","unstructured":"M. Kim, S. Kannan, I. Lee, and O. Sokolsky. Java-MaC: a Run-time Assurance Tool for Java. In Proceedings of Runtime Verification (RV'01), volume 55 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 2001.","DOI":"10.1016\/S1571-0661(04)00254-3"},{"issue":"1\/2","key":"10.1016\/S1571-0661(04)81051-X_NEWBIB18","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01188587","article-title":"Super-pattern matching","volume":"13","author":"Knight","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB19","doi-asserted-by":"crossref","unstructured":"O. Kupferman and M. Y. Vardi. Freedom, Weakness, and Determinism: From linear-time to branching-time. In Proceedings of the IEEE Symposium on Logic in Computer Science, pages 81\u201392, 1998.","DOI":"10.1109\/LICS.1998.705645"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB20","doi-asserted-by":"crossref","unstructured":"O. Kupferman and M. Y. Vardi. Model Checking of Safety Properties. In Proceedings of the Conference on Computer-Aided Verification, 1999.","DOI":"10.1007\/3-540-48683-6_17"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB21","doi-asserted-by":"crossref","unstructured":"O. Kupferman and S. Zuhovitzky. An Improved Algorithm for the Membership Problem for Extended Regular Expressions. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science, 2002.","DOI":"10.1007\/3-540-45687-2_37"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB22","unstructured":"I. Lee, S. Kannan, M. Kim, O. Sokolsky, and M. Viswanathan. Runtime Assurance Based on Formal Specifications. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999."},{"issue":"4","key":"10.1016\/S1571-0661(04)81051-X_NEWBIB23","first-page":"430","article-title":"A four russians algorithm for regular expression pattern matching","volume":"39","author":"Myers","year":"1992","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB24","unstructured":"T. O'Malley, D. Richardson, and L. Dillon. Efficient Specification-Based Oracles for Critical Systems. In In Proceedings of the California Software Symposium, 1996."},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB25","doi-asserted-by":"crossref","unstructured":"D. J. Richardson, S. L. Aha, and, T. O. O'Malley. Specification-Based Test Oracles for Reactive Systems. In Proceedings of the Fourteenth International Conference on Software Engineering, Melbourne, Australia, pages 105\u2013118, 1992.","DOI":"10.1109\/ICSE.1992.753494"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB26","unstructured":"G. Ro\u015fu. Hidden Logic. PhD thesis, University of California at San Diego, 2000."},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB27","series-title":"Rewriting Techniques and Applications (RTA'03), Lecture Notes in Computer Science, to appear","article-title":"Testing extended regular language membership incrementally by rewriting","author":"Ro\u015fu","year":"2003"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB28","doi-asserted-by":"crossref","unstructured":"J. J. M. M. Rutten. Automata and coinduction (an exercise in coalgebra). In Proceedings of the 9th International Conference on Concurrency Theory (CONCUR 98), volume 1466 of Lecture Notes in Computer Science, pages 194\u2013218. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0055624"},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB29","unstructured":"K. Sen, G. Ro\u015fu, and G. Agha. Runtime safety analysis of multithreaded programs. Technical Report UIUCDCS-R-2003\u20132334, University of Illinois at Urnaba Champaign, April 2003."},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB30","unstructured":"B. Watson. A taxonomy of deterministic finite automata minimization algorithms. Technical Report ISSN 0926\u20134515, Eindhoven University of Technology, Eindhoven, The Netherlands, 1993."},{"key":"10.1016\/S1571-0661(04)81051-X_NEWBIB31","doi-asserted-by":"crossref","unstructured":"H. Yamamoto. An automata-based recognition algorithm for semi-extended regular expressions. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science, pages 699\u2013708, 2000.","DOI":"10.1007\/3-540-44612-5_65"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610481051X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610481051X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:53Z","timestamp":1761610013000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610481051X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S157106610481051X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)81051-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generating Optimal Monitors for Extended Regular Expressions","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)81051-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}