Development reuse and the logic program derivation of two string-matching algorithms

Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn , Issue , 2001, Pages 38-48

  Hernández, Manuel ^a   Rosenblueth, David A ^a  

^a UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

Boyer Moore; Knuth Morris Pratt; Program derivation

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE MAINTENANCE; COMPUTER SOFTWARE REUSABILITY; SEMANTICS;

PROGRAM TRANSFORMATIONS;

LOGIC PROGRAMMING;

EID: 0035790490     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773184.773190     Document Type: Conference Paper

References (25)

1. A. V. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 5, pages 255-300. Elsevier Science Publishers B.V., 1990.
2. T. Amtoft, C. Consel, O. Danvy, and K. Malmkjær. The abstraction and instantiation of string-matching programs. Technical Report BRICS RS-01-12, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, April 2001. http://www.brics.dk/RS/01/12/.
3. R. A. Baeza-Yates, C. Choffrut, and G. H. Gonnet. On Boyer-Moore automata. Algorithmica, 12:268-292, 1994.
4. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Communications of the ACM, 20(10):762-772, 1977.
5. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994.
6. J. P. Gallagher. Tutorial on specialisation of logic programs. In Proc. PEPM'93, pages 88-98, Copenhagen, Denmark, 1993. ACM Press.
7. M. Gergatsoulis and M. Katzouraki. Unfold/fold transformations for definite clause programs. In M. Hermenegildo and J. Penjam, editors, Proc. 6th International Symposium, Programming Language Implementation and Logic Programming, pages 340-354, Madrid, Spain, 1994. Springer-Verlag. Lecture Notes in Computer Science No. 844.
8. C. J. Hogger. Logical analysis of some string-matching algorithms. Technical report, Department of Civil Engineering, Imperial College of Science and Technology, October 1979.
9. A. Hume and D. Sunday. Fast string searching. Software - Practice and Experience, 21(11):1221-1248, 1991.
10. D. E. Knuth, J. H. Morris Jr., and V. R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6(2):323-350, 1977.
11. R. Kowalski. Logic for Problem-Solving. Elsevier North-Holland, 1979.
12. J. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1987.
13. R. Paige. Future directions in program transformations. ACM Computing Surveys, 28(4es), 1996. http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a170-paige/.
14. H. A. Partsch and F. A. Stomp. A fast pattern matching algorithm derived by transformational and assertional reasoning. Formal Aspects of Computing, 2:109-122, 1990. Also in: Helmut A. Partsch. Specification and Transformation of Programs, Springer-Verlag, pages 417-427, 1990.
15. H. A. Partsch and F. A. Stomp. A fast pattern matching algorithm derived by transformational and assertional reasoning. Formal Aspects of Computing, 2:109-122, 1990. Also in: Helmut A. Partsch. Specification and Transformation of Programs, Springer-Verlag, pages 417-427, 1990.
16. H. A. Partsch and H. Völker. Another case study on reusability of transformational developments. Pattern matching according to Knuth, Morris, and Pratt. In M. Broy and M. Wirsing, editors, Methods of Programming. Selected Papers on the CIP-Project, pages 35-48. Springer-Verlag, 1991. Lecture Notes in Computer Science No. 544.
17. P. Pepper. Literate program development: A case study. In M. Broy and M. Wirsing, editors, Methods of Programming. Selected Papers on the CIP-Project, pages 101-124. Springer-Verlag, 1991. Lecture Notes in Computer Science No. 544.
18. D. Perrin. Finite automata. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 1, pages 1-57. Elsevier Science Publishers B.V., 1990.
19. A. Pettorossi and M. Proietti. Transformation of logic programs. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5, pages 697-787. Oxford University Press, 1998.
20. A. Pettorossi, M. Proietti, and S. Renault. Enhancing partial deduction via unfold/fold rules. In Proc. 6th Int. Workshop on Logic Program Synthesis and Transformation, pages 146-168, Stockholm, Sweden, 1996. Springer-Verlag. Lecture Notes in Computer Science Vol. 1207.
21. D. A. Rosenblueth. Chain programs for writing deterministic metainterpreters. Theory and Practice of Logic Programming. (to appear) http://leibniz.iimas.unam.mx/̃drosenbl/detmeta/.
22. G. A. Stephen. String Searching Algorithms, volume 3 of Lecture Notes Series on Computing. World Scientific Publishing, 1994.
23. H. Tamaki. Stream-based compilation of ground I/O Prolog into committed-choice languages. In Proc. Fourth International Conference on Logic Programming, pages 376-393, Melbourne, Australia, 1987.
24. H. Tamaki and T. Sato. Unfold/fold transformation of logic programs. In Proc. Second International Logic Programming Conference, pages 127-138, 1984.
25. K. Ueda. Making exhaustive search programs deterministic. New Generation Computing, 5:29-44, 1987.