Reversible programming: a case study of two string-matching algorithms
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Documents
- fulltext
Final published version, 201 KB, PDF document
String matching is a fundamental problem in algorithm. This study examines the development and construction of two reversible string-matching algorithms: a naive string-matching algorithm and the Rabin-Karp algorithm. The algorithms are used to introduce reversible computing concepts, beginning from basic reversible programming techniques to more advanced considerations about the injectivization of the polynomial hash-update function employed by the Rabin-Karp algorithm. The results are two clean input-preserving reversible algorithms that require no additional space and have the same asymptotic time complexity as their classic irreversible originals. This study aims to contribute to the body of reversible algorithms and to the discipline of reversible programmin
Original language | English |
---|---|
Title of host publication | Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation |
Editors | Geoff W. Hamilton, Temesghen Kahsai, Maurizio Proietti |
Publisher | arXiv.org |
Publication date | 2022 |
Pages | 1-13 |
DOIs | |
Publication status | Published - 2022 |
Event | 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation - Munich, Germany Duration: 3 Apr 2022 → 3 Apr 2022 |
Conference
Conference | 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation |
---|---|
Land | Germany |
By | Munich |
Periode | 03/04/2022 → 03/04/2022 |
Series | Electronic Proceedings in Theoretical Computer Science, EPTCS |
---|---|
Volume | 373 |
ISSN | 2075-2180 |
ID: 328380400