Using correctness-by-construction to derive dead-zone algorithms

B.W. Watson, L.G. Cleophas, D.G. Kourie

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)
45 Downloads (Pure)


We give a derivation, in the form of a stepwise (refinement-oriented) presentation, of a family of algorithms for single keyword pattern matching, all based on the so-called dead-zone algorithm-style, in which input text parts are tracked as either unprocessed (‘live’), or processed (‘dead’). Such algorithms allow for Boyer-Moore-style shifting in the input in two directions (left and right) instead of one, and have shown promising results in practice. The algorithms are the more interesting because of their potential for concurrency (multithreading). The focus of our algorithm family presentation is on correctness-arguments (proofs) accompanying each step, and on the resulting elegance and efficiency. Several new algorithms are described as part of this algorithm family, including ones amenable to using concurrency.
Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014
EditorsJ. Holub, J. Žďárek
Place of PublicationPrague
PublisherPrague Stringology Club
Number of pages12
Publication statusPublished - 2014
Externally publishedYes
EventPrague Stringology Conference 2014 - Department of Theoretical Computer Science, Czech Technical University, Prague, Czech Republic
Duration: 1 Sept 20143 Sept 2015


ConferencePrague Stringology Conference 2014
Country/TerritoryCzech Republic


Dive into the research topics of 'Using correctness-by-construction to derive dead-zone algorithms'. Together they form a unique fingerprint.

Cite this