Standard
Reversible programming : a case study of two string-matching algorithms. / Glück, Robert; Yokoyama, Tetsuo.
Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation. ed. / Geoff W. Hamilton; Temesghen Kahsai; Maurizio Proietti. arXiv.org, 2022. p. 1-13 (Electronic Proceedings in Theoretical Computer Science, EPTCS, Vol. 373).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Glück, R & Yokoyama, T 2022,
Reversible programming: a case study of two string-matching algorithms. in GW Hamilton, T Kahsai & M Proietti (eds),
Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation. arXiv.org, Electronic Proceedings in Theoretical Computer Science, EPTCS, vol. 373, pp. 1-13, 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation, Munich, Germany,
03/04/2022.
https://doi.org/10.4204/EPTCS.373.1
APA
Glück, R., & Yokoyama, T. (2022).
Reversible programming: a case study of two string-matching algorithms. In G. W. Hamilton, T. Kahsai, & M. Proietti (Eds.),
Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation (pp. 1-13). arXiv.org. Electronic Proceedings in Theoretical Computer Science, EPTCS Vol. 373
https://doi.org/10.4204/EPTCS.373.1
Vancouver
Glück R, Yokoyama T.
Reversible programming: a case study of two string-matching algorithms. In Hamilton GW, Kahsai T, Proietti M, editors, Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation. arXiv.org. 2022. p. 1-13. (Electronic Proceedings in Theoretical Computer Science, EPTCS, Vol. 373).
https://doi.org/10.4204/EPTCS.373.1
Author
Glück, Robert ; Yokoyama, Tetsuo. / Reversible programming : a case study of two string-matching algorithms. Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation. editor / Geoff W. Hamilton ; Temesghen Kahsai ; Maurizio Proietti. arXiv.org, 2022. pp. 1-13 (Electronic Proceedings in Theoretical Computer Science, EPTCS, Vol. 373).
Bibtex
@inproceedings{42ba1de12e494ef8836835c4ac3a61d8,
title = "Reversible programming: a case study of two string-matching algorithms",
abstract = "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",
author = "Robert Gl{\"u}ck and Tetsuo Yokoyama",
year = "2022",
doi = "10.4204/EPTCS.373.1",
language = "English",
series = "Electronic Proceedings in Theoretical Computer Science, EPTCS",
publisher = "arXiv.org",
pages = "1--13",
editor = "Hamilton, {Geoff W.} and Temesghen Kahsai and Maurizio Proietti",
booktitle = "Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation",
note = "9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation ; Conference date: 03-04-2022 Through 03-04-2022",
}
RIS
TY - GEN
T1 - Reversible programming
T2 - 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation
AU - Glück, Robert
AU - Yokoyama, Tetsuo
PY - 2022
Y1 - 2022
N2 - 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
AB - 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
U2 - 10.4204/EPTCS.373.1
DO - 10.4204/EPTCS.373.1
M3 - Article in proceedings
T3 - Electronic Proceedings in Theoretical Computer Science, EPTCS
SP - 1
EP - 13
BT - Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation
A2 - Hamilton, Geoff W.
A2 - Kahsai, Temesghen
A2 - Proietti, Maurizio
PB - arXiv.org
Y2 - 3 April 2022 through 3 April 2022
ER -
