{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:28:12Z","timestamp":1725550092360},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119989"},{"type":"electronic","value":"9783642119996"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11999-6_6","type":"book-chapter","created":{"date-parts":[[2010,3,16]],"date-time":"2010-03-16T00:52:29Z","timestamp":1268700749000},"page":"79-95","source":"Crossref","is-referenced-by-count":2,"title":["A Taxonomy of Some Right-to-Left String-Matching Algorithms"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Hern\u00e1ndez","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1137\/0215007","volume":"15","author":"A. Apostolico","year":"1986","unstructured":"Apostolico, A., Giancarlo, R.: The Boyer\u2013Moore\u2013Galil string searching strategies revisited. SIAM J. Comput.\u00a015(1), 98\u2013105 (1986)","journal-title":"SIAM J. Comput."},{"key":"6_CR2","volume-title":"Algebra of Programming","author":"R. Bird","year":"1997","unstructured":"Bird, R., de Moor, O.: Algebra of Programming. Prentice Hall, Englewood Cliffs (1997)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bird, R.: Polymorphic string matching. In: Haskell 2005, Tallinn, Estonia. Association for Computing Machinery, ACM (September 2005)","DOI":"10.1145\/1088348.1088359"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Boyer, R.S., Strother Moore, J.: A Fast String Searching Algorithm. Communications of the ACM\u00a020(10) (October 1977)","DOI":"10.1145\/359842.359859"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1093\/comjnl\/23.1.61","volume":"23","author":"K.L. Clark","year":"1978","unstructured":"Clark, K.L., Darlington, J.: Algorithm classification through synthesis. The Computer Journal\u00a023(1), 61\u201365 (1978)","journal-title":"The Computer Journal"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0020-0190(89)90113-0","volume":"30","author":"C. Consel","year":"1989","unstructured":"Consel, C., Danvy, O.: Partial Evaluation of Pattern Matching in Strings. Information Processing Letters\u00a030(2), 79\u201386 (1989)","journal-title":"Information Processing Letters"},{"key":"6_CR7","first-page":"293","volume-title":"Logic and Databases","author":"K.L. Clark","year":"1978","unstructured":"Clark, K.L.: Negation as Failure. In: Gallaire, H., Minker, J. (eds.) Logic and Databases, pp. 293\u2013322. Plenum Press, New York (1978)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Perrin, D.: Two-way string-matching. Journal of the Association for Computing Machinery\u00a038(3) (July 1991)","DOI":"10.1145\/116825.116845"},{"key":"6_CR9","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)"},{"key":"6_CR10","doi-asserted-by":"crossref","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific Publishing, Singapore (2002)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00264597","volume":"11","author":"J. Darlington","year":"1978","unstructured":"Darlington, J.: A synthesis of several sorting algorithms. Acta Informatica\u00a011, 1\u201330 (1978)","journal-title":"Acta Informatica"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Danvy, O., Korsholm, H.R.: On obtaining the boyer\u2013moore string-matching algorithm by partial evaluation. Information Processing Letters\u00a099(4) (August 2006)","DOI":"10.1016\/j.ipl.2006.04.001"},{"key":"6_CR13","volume-title":"Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (SMC 2002)","author":"F. Fioravanti","year":"2002","unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M.: Specialization with clause splitting for deriving deterministic constraint logic programs. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (SMC 2002), Hammamet, Tunisia. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Programming Language Implementation and Logic Programming","author":"M. Gergatsoulis","year":"1994","unstructured":"Gergatsoulis, M., Katzouraki, M.: Unfold\/fold Transformations for Definite Clause Programs. In: Hermenegildo, M., Penjam, J. (eds.) PLILP 1994. LNCS, vol.\u00a0844. Springer, Heidelberg (1994)"},{"issue":"6","key":"6_CR15","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"R. Nigel Horspool","year":"1980","unstructured":"Nigel Horspool, R.: Practical Fast Searching in Strings. Software\u2014Practice and experience\u00a010(6), 501\u2013506 (1980)","journal-title":"Software\u2014Practice and experience"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Hern\u00e1ndez, M., Rosenblueth, D.: Development Reuse and the Logic Program Derivation of Two String-Matching Algorithms. In: Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2001), September 2001, Florence, Italy, pp. 38\u201348 (2001)","DOI":"10.1145\/773184.773190"},{"issue":"5","key":"6_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0020-0190(03)00309-0","volume":"87","author":"M. Hern\u00e1ndez","year":"2003","unstructured":"Hern\u00e1ndez, M., Rosenblueth, D.: A Disjunctive Partial Deduction of a Right-to-Left String-Matching Algorithm. Information Proceesing Letters\u00a087(5), 235\u2013241 (2003)","journal-title":"Information Proceesing Letters"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast Pattern Matching in Strings. SIAM Journal of Computation\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM Journal of Computation"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF00263502","volume":"27","author":"K.-K. Lau","year":"1989","unstructured":"Lau, K.-K.: A Note on Synthesis and Classification of Sorting Algorithms. Acta Informatica\u00a027, 73\u201380 (1989)","journal-title":"Acta Informatica"},{"key":"6_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","first-page":"332","volume-title":"The Essence of Computation","author":"K. Malmkjr","year":"2002","unstructured":"Malmkjr, K., Amtoft, T., Consel, C., Danvy, O.: The abstraction and instantiation of string-matching programs. In: Mogensen, T.\u00c6., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol.\u00a02566, pp. 332\u2013357. Springer, Heidelberg (2002)"},{"issue":"1","key":"6_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TSE.1976.233797","volume":"2","author":"D.L. Parnas","year":"1976","unstructured":"Parnas, D.L.: On the design and development of program families. IEEE Transactions of Software Engineering\u00a0SE-2(1), 1\u20139 (1976)","journal-title":"IEEE Transactions of Software Engineering"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BFb0018271","volume-title":"Methods of Programming","author":"P. Pepper","year":"1991","unstructured":"Pepper, P.: Literate Program Derivation: A Case Study. In: Broy, M., Wirsing, M. (eds.) CIP 1991. LNCS, vol.\u00a0544, pp. 101\u2013124. Springer, Heidelberg (1991)"},{"key":"6_CR24","first-page":"697","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"A. Pettorossi","year":"1998","unstructured":"Pettorossi, A., Proietti, M.: Transformation of logic programs. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol.\u00a05, pp. 697\u2013787. Oxford University Press, Oxford (1998)"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Logic Program Synthesis and Transformation","author":"A. Pettorossi","year":"1997","unstructured":"Pettorossi, A., Proietti, M., Renault, S.: Enhancing Partial Deduction via Unfold\/Fold Rules. In: Gallagher, J.P. (ed.) LOPSTR 1996. LNCS, vol.\u00a01207. Springer, Heidelberg (1997)"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01888219","volume":"2","author":"H.A. Partsch","year":"1990","unstructured":"Partsch, H.A., Stomp, F.A.: A fast pattern matching algorithm derived by transformational and assertional reasoning. Formal Aspects of Computing\u00a02, 109\u2013122 (1990)","journal-title":"Formal Aspects of Computing"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Reif, J.H., Scherlis, W.L.: Deriving efficient graphs algorithms. In: Logic of programs (Proceedings 1983). LNCS, vol.\u00a0164, pp. 421\u2013441. Springer, Heidelberg (1983)","DOI":"10.1007\/3-540-12896-4_378"},{"issue":"6","key":"6_CR28","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1017\/S0956796800002008","volume":"6","author":"M.H. S\u00f8rensen","year":"1996","unstructured":"S\u00f8rensen, M.H., Gl\u00fcck, R., Jones, N.D.: A positive supercompiler. Journal of Functional Programming\u00a06(6), 811\u2013838 (1996)","journal-title":"Journal of Functional Programming"},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/115865.115873","volume-title":"Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM 1991","author":"D.A. Smith","year":"1991","unstructured":"Smith, D.A.: Partial Evaluation of Pattern Matching in Constraint Logic Programming Language. In: Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM 1991, Connecticut, USA, pp. 62\u201371. ACM Press, New York (1991)"},{"key":"6_CR30","series-title":"Lecture Notes Series on Computing","doi-asserted-by":"crossref","DOI":"10.1142\/2418","volume-title":"String Searching Algorithms","author":"G.A. Stephen","year":"1994","unstructured":"Stephen, G.A.: String Searching Algorithms. Lecture Notes Series on Computing, vol.\u00a03. World Scientific Publishing, Singapore (1994)"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Sunday, D.M.: A very fast substring search algorithm. Communications of the ACM\u00a033(8) (August 1990)","DOI":"10.1145\/79173.79184"},{"issue":"2","key":"6_CR32","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0167-6423(96)00008-1","volume":"27","author":"B.W. Watson","year":"1996","unstructured":"Watson, B.W., Zwaan, G.: A taxonomy of sublinear multiple keyword pattern matching algorithms. Science of Computer Programming\u00a027(2), 85\u2013118 (1996)","journal-title":"Science of Computer Programming"}],"container-title":["Lecture Notes in Computer Science","Functional and Constraint Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11999-6_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:46:16Z","timestamp":1606167976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11999-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119989","9783642119996"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11999-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}