Reversible programming: a case study of two string-matching algorithms
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Dokumenter
- fulltext
Forlagets udgivne version, 201 KB, PDF-dokument
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
Originalsprog | Engelsk |
---|---|
Titel | Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation |
Redaktører | Geoff W. Hamilton, Temesghen Kahsai, Maurizio Proietti |
Forlag | arXiv.org |
Publikationsdato | 2022 |
Sider | 1-13 |
DOI | |
Status | Udgivet - 2022 |
Begivenhed | 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation - Munich, Tyskland Varighed: 3 apr. 2022 → 3 apr. 2022 |
Konference
Konference | 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation |
---|---|
Land | Tyskland |
By | Munich |
Periode | 03/04/2022 → 03/04/2022 |
Navn | Electronic Proceedings in Theoretical Computer Science, EPTCS |
---|---|
Vol/bind | 373 |
ISSN | 2075-2180 |
ID: 328380400