{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T03:53:43Z","timestamp":1791345223055,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540402541","type":"print"},{"value":"9783540448815","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44881-0_35","type":"book-chapter","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T16:39:56Z","timestamp":1173112796000},"page":"499-514","source":"Crossref","is-referenced-by-count":19,"title":["Testing Extended Regular Language Membership Incrementally by Rewriting"],"prefix":"10.1007","author":[{"given":"Grigore","family":"Ro\u015fu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"issue":"2","key":"35_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"V.M. Antimirov","year":"1996","unstructured":"V.M. Antimirov. Partial derivatives of regular expressions and finite automaton constructions. Journal of Theoretical Computer Science, 155(2):291\u2013319, 1996.","journal-title":"Journal of Theoretical Computer Science"},{"issue":"1","key":"35_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(95)80010-7","volume":"143","author":"V.M. Antimirov","year":"1995","unstructured":"V.M. Antimirov and P.D. Mosses. Rewriting extended regular expressions. Journal of Theoretical Computer Science, 143(1):51\u201372, 1995.","journal-title":"Journal of Theoretical Computer Science"},{"issue":"1","key":"35_CR3","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. K. Chandra","year":"1981","unstructured":"A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114\u2013133, 1981.","journal-title":"Journal of the ACM"},{"key":"35_CR4","unstructured":"M. Clavel, F. Dur\u00e1n, S. Eker, P. Lincoln, N. Mart\u00ed-Oliet, J. Meseguer, and J. Quesada. Maude: specification and programming in rewriting logic. SRI International, January 1999, http:\/\/maude.csl.sri.com ."},{"key":"35_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/10722468_19","volume-title":"SPIN Model Checking and Software Verification","author":"D. Drusinsky","year":"2000","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."},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"D. Giannakopoulou and K. Havelund. Automata-Based Verification of Temporal Properties on Running Programs. In Proceedings, International Conference on Automated Software Engineering (ASE\u201901), pages 412\u2013416. Institute of Electrical and Electronics Engineers, 2001. Coronado Island, California.","DOI":"10.1109\/ASE.2001.989841"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"K. Havelund and G. Ro\u015fu. Monitoring Java Programs with Java PathExplorer. In Proceedings of Runtime Verification (RV\u201901), volume 55 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 2001.","DOI":"10.1016\/S1571-0661(04)00253-1"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"K. Havelund and G. Ro\u015fu. Monitoring Programs using Rewriting. In Proceedings, International Conference on Automated Software Engineering (ASE\u201901), pages 135\u2013143. Institute of Electrical and Electronics Engineers, 2001. Coronado Island, California.","DOI":"10.1109\/ASE.2001.989799"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"K. Havelund and G. Ro\u015fu. Runtime Verification 2001, volume 55 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 2001. Proceedings of a Computer Aided Verification (CAV\u201901) satellite workshop.","DOI":"10.1016\/S1571-0661(05)80577-8"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"K. Havelund and G. Ro\u015fu. Runtime Verification 2002, volume 70(4) of Electronic Notes in Theoretical Computer Science. Elsevier Science, 2002. Proceedings of a Computer Aided Verification (CAV\u201902) satellite workshop.","DOI":"10.1016\/S1571-0661(05)80585-7"},{"key":"35_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-46002-0_24","volume-title":"Tools and Algorithms for Construction and Analysis of Systems (TACAS\u201902)","author":"K. Havelund","year":"2002","unstructured":"K. Havelund and G. Ro\u015fu. Synthesizing monitors for safety properties. In Tools and Algorithms for Construction and Analysis of Systems (TACAS\u201902), volume 2280 of Lecture Notes in Computer Science, pages 342\u2013356. Springer, 2002."},{"key":"35_CR12","unstructured":"S. Hirst. A new algorithm solving membership of extended regular expressions. Technical report, The University of Sydney, 1989."},{"issue":"4","key":"35_CR13","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797\u2013821, 1980.","journal-title":"Journal of the ACM"},{"issue":"1\/2","key":"35_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01188587","volume":"13","author":"J.R. Knight","year":"1995","unstructured":"J.R. Knight and E.W. Myers. Super-pattern matching. Algorithmica, 13(1\/2):211\u2013243, 1995.","journal-title":"Algorithmica"},{"key":"35_CR15","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":"35_CR16","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":"35_CR17","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":"35_CR18","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":"35_CR19","first-page":"430","volume":"39","author":"G. Myers","year":"1992","unstructured":"G. Myers. A four russians algorithm for regular expression pattern matching. Journal of the ACM, 39(4):430\u2013448, 1992.","journal-title":"Journal of the ACM"},{"key":"35_CR20","unstructured":"T. O\u2019Malley, D. Richardson, and L. Dillon. Efficient Specification-Based Oracles for Critical Systems. In In Proceedings of the California Software Symposium, 1996."},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"D. J. Richardson, S. L. Aha, and T. O. O\u2019Malley. 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":"35_CR22","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":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44881-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T16:08:30Z","timestamp":1736870910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44881-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402541","9783540448815"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-44881-0_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}