Correctness and efficiency of pattern matching algorithms (Q1183611): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4174692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast string searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion As an Effective Step in Program Development / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3899466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving Space in Fast String-Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic definition of the programming language Pascal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank

Latest revision as of 14:50, 15 May 2024

scientific article
Language Label Description Also known as
English
Correctness and efficiency of pattern matching algorithms
scientific article

    Statements

    Correctness and efficiency of pattern matching algorithms (English)
    0 references
    0 references
    28 June 1992
    0 references
    algorithm of Knuth, Morris, and Pratt
    0 references
    worst case
    0 references
    program correctness
    0 references
    program efficiency
    0 references
    formal verification of programs
    0 references
    Hoare axiomatic semantics
    0 references
    correctness proofs
    0 references
    program development
    0 references

    Identifiers