### Abstract

Original language | English |
---|---|

Title of host publication | Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014 |

Editors | J. Holub, J. Žďárek |

Place of Publication | Prague |

Publisher | Prague Stringology Club |

Pages | 84-95 |

Number of pages | 12 |

Publication status | Published - 2014 |

Externally published | Yes |

Event | Prague Stringology Conference 2014 - Department of Theoretical Computer Science, Czech Technical University, Prague, Czech Republic Duration: 1 Sep 2014 → 3 Sep 2015 |

### Conference

Conference | Prague Stringology Conference 2014 |
---|---|

Country | Czech Republic |

City | Prague |

Period | 1/09/14 → 3/09/15 |

### Fingerprint

### Cite this

*Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014*(pp. 84-95). Prague: Prague Stringology Club.

}

*Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014.*Prague Stringology Club, Prague, pp. 84-95, Prague Stringology Conference 2014, Prague, Czech Republic, 1/09/14.

**Using correctness-by-construction to derive dead-zone algorithms.** / Watson, B.W.; Cleophas, L.G.; Kourie, D.G.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Watson, B.W.

AU - Cleophas, L.G.

AU - Kourie, D.G.

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

M3 - Conference contribution

SP - 84

EP - 95

BT - Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014

A2 - Holub, J.

A2 - Žďárek, J.

PB - Prague Stringology Club

CY - Prague

ER -