A complete mechanization of correctness of a string-preprocessing algorithm
From MaRDI portal
(Redirected from Publication:816208)
Recommendations
- Completeness of string analysis for dynamic languages
- Fast string correction with Levenshtein automata
- Computational and proof complexity of partial string avoidability
- scientific article; zbMATH DE number 6851884
- An Evaluation of Automata Algorithms for String Analysis
- Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm
- Termination of string rewriting proved automatically
- Symbolic String Verification: Combining String Analysis and Size Analysis
- On a cyclic string-to-string correction problem
Cites work
- A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
- A fast string searching algorithm
- A taxonomy of sublinear multiple keyword pattern matching algorithms
- Algorithms on Strings, Trees and Sequences
- Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 1142294 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 234014 (Why is no real title available?)
Cited in
(3)
This page was built for publication: A complete mechanization of correctness of a string-preprocessing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q816208)
