A complete mechanization of correctness of a string-preprocessing algorithm

DOI10.1007/S10703-005-2243-0zbMath1085.68149OpenAlexW2008530822MaRDI QIDQ816208

Milos Besta, Frank Stomp

Publication date: 20 February 2006

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-005-2243-0

zbMATH Keywords

theorem provingformal methodspattern matchingPVS

Mathematics Subject Classification ID

Searching and sorting (68P10)

Uses Software

• ML
• PVS
• HOL
• Nuprl
• UNITY

Cites Work

• Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm
• 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
• Algorithms on Strings, Trees and Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A complete mechanization of correctness of a string-preprocessing algorithm