A fast pattern matching algorithm derived by transformational and assertional reasoning

DOI10.1007/BF01888219zbMath0697.68025OpenAlexW1971267380MaRDI QIDQ911750

F. A. Stomp, Helmut Partsch

Publication date: 1990

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01888219

zbMATH Keywords

program transformationpattern matchingtransformational programmingassertional reasoning

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Evolution of rule-based programs ⋮ Non-deterministic expressions and predicate transformers ⋮ Program development schemata as derived rules ⋮ Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm

Cites Work

• Unnamed Item
• Formal derivation of a pattern matching algorithm
• Playing with patterns, searching for strings
• A fast string searching algorithm
• Fast Pattern Matching in Strings

This page was built for publication: A fast pattern matching algorithm derived by transformational and assertional reasoning