Standard
An inversion tool for conditional term rewriting systems - a case study of Ackermann inversion. / Mikkelsen, Maria Bendix; Glück, Robert; Kirkeby, Maja Hanne.
Proceedings of the 9th International Workshop on Verification and Program Transformation. red. / Alexei Lisitsa; Andrei P. Nemytykh. arxiv.org, 2021. s. 33-41 (Electronic Proceedings in Theoretical Computer Science, EPTCS, Bind 341).
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning
Harvard
Mikkelsen, MB
, Glück, R & Kirkeby, MH 2021,
An inversion tool for conditional term rewriting systems - a case study of Ackermann inversion. i A Lisitsa & AP Nemytykh (red),
Proceedings of the 9th International Workshop on Verification and Program Transformation. arxiv.org, Electronic Proceedings in Theoretical Computer Science, EPTCS, bind 341, s. 33-41, 9th International Workshop on Verification and Program Transformation, Luxembourg, Luxemborg,
27/03/2021.
https://doi.org/10.4204/EPTCS.341.3APA
Mikkelsen, M. B.
, Glück, R., & Kirkeby, M. H. (2021).
An inversion tool for conditional term rewriting systems - a case study of Ackermann inversion. I A. Lisitsa, & A. P. Nemytykh (red.),
Proceedings of the 9th International Workshop on Verification and Program Transformation (s. 33-41). arxiv.org. Electronic Proceedings in Theoretical Computer Science, EPTCS Bind 341
https://doi.org/10.4204/EPTCS.341.3Vancouver
Mikkelsen MB
, Glück R, Kirkeby MH.
An inversion tool for conditional term rewriting systems - a case study of Ackermann inversion. I Lisitsa A, Nemytykh AP, red., Proceedings of the 9th International Workshop on Verification and Program Transformation. arxiv.org. 2021. s. 33-41. (Electronic Proceedings in Theoretical Computer Science, EPTCS, Bind 341).
https://doi.org/10.4204/EPTCS.341.3Author
Mikkelsen, Maria Bendix ; Glück, Robert ; Kirkeby, Maja Hanne. / An inversion tool for conditional term rewriting systems - a case study of Ackermann inversion. Proceedings of the 9th International Workshop on Verification and Program Transformation. red. / Alexei Lisitsa ; Andrei P. Nemytykh. arxiv.org, 2021. s. 33-41 (Electronic Proceedings in Theoretical Computer Science, EPTCS, Bind 341).
Bibtex
@inproceedings{e356175083e74652b9c10827d8b58ab7,
title = "An inversion tool for conditional term rewriting systems - a case study of Ackermann inversion",
abstract = "We report on an inversion tool for a class of oriented conditional constructor term rewriting systems. Four well-behaved rule inverters ranging from trivial to full, partial and semi-inverters are included. Conditional term rewriting systems are theoretically well founded and can model functional and non-functional rewrite relations. We illustrate the inversion by experiments with full and partial inversions of the Ackermann function. The case study demonstrates, among others, that polyvariant inversion and input-output set propagation can reduce the search space of the generated inverse systems.",
author = "Mikkelsen, {Maria Bendix} and Robert Gl{\"u}ck and Kirkeby, {Maja Hanne}",
year = "2021",
doi = "10.4204/EPTCS.341.3",
language = "English",
series = "Electronic Proceedings in Theoretical Computer Science, EPTCS",
publisher = "arxiv.org",
pages = "33--41",
editor = "Lisitsa, { Alexei } and Nemytykh, {Andrei P. }",
booktitle = "Proceedings of the 9th International Workshop on Verification and Program Transformation",
note = "9th International Workshop on Verification and Program Transformation ; Conference date: 27-03-2021 Through 28-03-2021",
}
RIS
TY - GEN
T1 - An inversion tool for conditional term rewriting systems - a case study of Ackermann inversion
AU - Mikkelsen, Maria Bendix
AU - Glück, Robert
AU - Kirkeby, Maja Hanne
PY - 2021
Y1 - 2021
N2 - We report on an inversion tool for a class of oriented conditional constructor term rewriting systems. Four well-behaved rule inverters ranging from trivial to full, partial and semi-inverters are included. Conditional term rewriting systems are theoretically well founded and can model functional and non-functional rewrite relations. We illustrate the inversion by experiments with full and partial inversions of the Ackermann function. The case study demonstrates, among others, that polyvariant inversion and input-output set propagation can reduce the search space of the generated inverse systems.
AB - We report on an inversion tool for a class of oriented conditional constructor term rewriting systems. Four well-behaved rule inverters ranging from trivial to full, partial and semi-inverters are included. Conditional term rewriting systems are theoretically well founded and can model functional and non-functional rewrite relations. We illustrate the inversion by experiments with full and partial inversions of the Ackermann function. The case study demonstrates, among others, that polyvariant inversion and input-output set propagation can reduce the search space of the generated inverse systems.
U2 - 10.4204/EPTCS.341.3
DO - 10.4204/EPTCS.341.3
M3 - Article in proceedings
T3 - Electronic Proceedings in Theoretical Computer Science, EPTCS
SP - 33
EP - 41
BT - Proceedings of the 9th International Workshop on Verification and Program Transformation
A2 - Lisitsa, Alexei
A2 - Nemytykh, Andrei P.
PB - arxiv.org
T2 - 9th International Workshop on Verification and Program Transformation
Y2 - 27 March 2021 through 28 March 2021
ER -
