Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm

DOI10.1016/S0304-3975(00)00421-7MaRDI QIDQ1853605zbMATH OpenFDO

Authors Frank Stomp

Publication date 21 January 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

pattern matchingformal verificationlinear time temporal logic

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Recommendations

• A complete mechanization of correctness of a string-preprocessing algorithm
• Fastest Pattern Matching in Strings
• A Boyer-Moore-style algorithm for regular expression pattern matching.
• Correctness and efficiency of pattern matching algorithms
• scientific article; zbMATH DE number 8792

Cites work

• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 52331 (Why is no real title available?)
• A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
• A fast pattern matching algorithm derived by transformational and assertional reasoning
• A fast string searching algorithm
• A taxonomy of sublinear multiple keyword pattern matching algorithms
• Fast Pattern Matching in Strings
• The Hoare logic of concurrent programs

Cited in

(2)

• A fast pattern matching algorithm derived by transformational and assertional reasoning
• A complete mechanization of correctness of a string-preprocessing algorithm

This page was built for publication: Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853605)