A fast pattern matching algorithm derived by transformational and assertional reasoning
From MaRDI portal
Publication:911750
DOI10.1007/BF01888219zbMath0697.68025MaRDI QIDQ911750
Publication date: 1990
Published in: Formal Aspects of Computing (Search for Journal in Brave)
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Program development schemata as derived rules, Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm, Evolution of rule-based programs
Cites Work