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

DOI10.1016/S0304-3975(00)00421-7zbMath1018.68050MaRDI QIDQ1853605

Frank Stomp

Publication date: 21 January 2003

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

zbMATH Keywords

formal verificationpattern matchinglinear time temporal logic

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (1)

A complete mechanization of correctness of a string-preprocessing algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Hoare logic of concurrent programs
• A fast pattern matching algorithm derived by transformational and assertional reasoning
• A taxonomy of sublinear multiple keyword pattern matching algorithms
• A fast string searching algorithm
• A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
• Fast Pattern Matching in Strings

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