Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm (Q1853605): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast string searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ''Hoare logic'' of concurrent programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast pattern matching algorithm derived by transformational and assertional reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Correct Preprocessing Algorithm for Boyer–Moore String-Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of sublinear multiple keyword pattern matching algorithms / rank
 
Normal rank

Latest revision as of 11:29, 5 June 2024

scientific article
Language Label Description Also known as
English
Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm
scientific article

    Statements

    Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm (English)
    0 references
    0 references
    21 January 2003
    0 references
    formal verification
    0 references
    linear time temporal logic
    0 references
    pattern matching
    0 references

    Identifiers