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.
CrossRef5.
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.
6.
R.S. Boyer and Y. Yu, “Automated correctness proofs of machine code programs for a commercial microprocessor,” in D. Kapur (Ed.), Proceedings of the 11
th
International Conference on Automated Deduction (CADE-11), Vol. 607 of Lecture Notes in Computer Science, Saratoga Springs, NY, 1992, pp. 416–430.
7.
K.M. Chandy and J. Misra, Parallel Program Design: A Foundation, Addison-Wesley, 1988.
8.
R.L. Constable, S.F. Allen, H.M. Bromley, W.R. Cleaveland, J.F. Cremer, R.W. Harper, D.J. Howe, T.B. Knoblock, N.P. Mendler, P. Panangaden, J.T. Sasaki, and S.F. Smith, Implementing Mathematics with the Nuprl Proof Development System, Prentice-Hall, 1986.
9.
T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, McGraw-Hill, 1990.
10.
A.P. Felty, D.J. Howe, and F.A. Stomp, “Protocol verification in Nuprl,” in A.J. Hu and M.Y. Vardi (Eds.), Proceedings of the 10th International Conference on Computer-Aided Verification (CAV ‘98), Vol. 1427 of Lecture Notes in Computer Science, Vancouver, BC, 1998, pp. 428–439.
11.
M.J.C. Gordon and T.F. Melham, Introduction to HOL: A Theorem Proving Environment for Higher Order Logic, Cambridge University Press, 1993.
12.
D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, 1997.
13.
M. Kaufmann, P. Manolios, and J.S. Moore, Computer-Aided Reasoning: An Approach, Kluwer Academic Publishers, 2000.
14.
D.E. Knuth, J.H. Morris, and V.R. Pratt, “Fast pattern matching in strings,”
SIAM Journal on Computing, Vol. 6, No. 2, pp. 323–350, 1977.
MathSciNetCrossRef15.
Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Springer-Verlag, 1992.
16.
S.P. Miller and M.K. Srivas, “Formal verification of the AAMP5 microcode: A case study in the industrial use of formal methods,”
Formal Methods in System Design, Vol. 8, No. 2, pp. 153–188, 1996.
CrossRef17.
S. Owre, N. Shankar, J.M. Rushby, and D.W.J. Stringer-Calvert, PVS Language Reference, Computer Science Laboratory, SRI International, Menlo Park, CA, 2001.
18.
S. Owre, N. Shankar, J.M. Rushby, and D.W.J. Stringer-Calvert, PVS Prover Guide, Computer Science Laboratory, SRI International, Menlo Park, CA, 2001.
19.
S. Owre, N. Shankar, J.M. Rushby, and D.W.J. Stringer-Calvert, PVS System Guide, Computer Science Laboratory, SRI International, Menlo Park, CA, 2001.
20.
W. Rytter, “A correct preprocessing algorithm for Boyer-Moore string searching,”
SIAM Journal on Computing, Vol. 9, No. 3, pp. 509–512, 1990.
MathSciNetCrossRef21.
F. Stomp, “Correctness of substring-preprocessing in Boyer-Moore’s pattern matching algorithm,”
Theoretical Computer Science, Vol. 290, No. 1, pp. 59–78, 2003.
MATHMathSciNetCrossRef22.
B.W. Watson and G. Zwaan, “A taxonomy of sublinear multiple keyword pattern matching algorithms,”
Science of Computer Programming, Vol. 27, No. 2, pp. 85–118, 1996.
MathSciNetCrossRef