Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Theoretical Computer Science,Software
Reference22 articles.
1. A.V. Aho, “Algorithms for finding patterns in strings,” in J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science (Vol. A): Algorithms and Complexity, MIT Press, 1990, pp. 255–300.
2. S. Baase and A.V. Gelder, Computer Algorithms—Introduction to Design and Analysis, Addison-Wesley, 2000, third edition.
3. M. Besta and F. Stomp, “Mechanization of a proof of string-preprocessing in Boyer-Moore’s pattern matching algorithm,”in Proceedings of the 8th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS ‘02), Greenbelt, MD, 2002, pp. 68–77.
4. R.S. Boyer and J.S. Moore, “A fast string searching algorithm,” Communications of the ACM, Vol. 20, No. 10, pp. 762–772, 1977.
5. R.S. Boyer and J.S. Moore, “A verification condition generator for FORTRAN,” in The Correctness Problem in Computer Science, Academic Press, London, 1981, pp. 9–101.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献