Standard
Reversible programs have reversible semantics. / Glück, Robert; Kaarsgaard, Robin; Yokoyama, Tetsuo.
Formal Methods. FM 2019 International Workshops - Revised Selected Papers. ed. / Emil Sekerinski; Nelma Moreira; José N. Oliveira; Daniel Ratiu; Riccardo Guidotti; Marie Farrell; Matt Luckcuck; Diego Marmsoler; José Campos; Troy Astarte; Laure Gonnord; Antonio Cerone; Luis Couto; Brijesh Dongol; Martin Kutrib; Pedro Monteiro; David Delmas. Springer VS, 2020. p. 413-427 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12233 LNCS).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Glück, R, Kaarsgaard, R & Yokoyama, T 2020,
Reversible programs have reversible semantics. in E Sekerinski, N Moreira, JN Oliveira, D Ratiu, R Guidotti, M Farrell, M Luckcuck, D Marmsoler, J Campos, T Astarte, L Gonnord, A Cerone, L Couto, B Dongol, M Kutrib, P Monteiro & D Delmas (eds),
Formal Methods. FM 2019 International Workshops - Revised Selected Papers. Springer VS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12233 LNCS, pp. 413-427, 3rd World Congress on Formal Methods, FM 2019, Porto, Portugal,
07/10/2019.
https://doi.org/10.1007/978-3-030-54997-8_26
APA
Glück, R., Kaarsgaard, R., & Yokoyama, T. (2020).
Reversible programs have reversible semantics. In E. Sekerinski, N. Moreira, J. N. Oliveira, D. Ratiu, R. Guidotti, M. Farrell, M. Luckcuck, D. Marmsoler, J. Campos, T. Astarte, L. Gonnord, A. Cerone, L. Couto, B. Dongol, M. Kutrib, P. Monteiro, & D. Delmas (Eds.),
Formal Methods. FM 2019 International Workshops - Revised Selected Papers (pp. 413-427). Springer VS. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 12233 LNCS
https://doi.org/10.1007/978-3-030-54997-8_26
Vancouver
Glück R, Kaarsgaard R, Yokoyama T.
Reversible programs have reversible semantics. In Sekerinski E, Moreira N, Oliveira JN, Ratiu D, Guidotti R, Farrell M, Luckcuck M, Marmsoler D, Campos J, Astarte T, Gonnord L, Cerone A, Couto L, Dongol B, Kutrib M, Monteiro P, Delmas D, editors, Formal Methods. FM 2019 International Workshops - Revised Selected Papers. Springer VS. 2020. p. 413-427. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12233 LNCS).
https://doi.org/10.1007/978-3-030-54997-8_26
Author
Glück, Robert ; Kaarsgaard, Robin ; Yokoyama, Tetsuo. / Reversible programs have reversible semantics. Formal Methods. FM 2019 International Workshops - Revised Selected Papers. editor / Emil Sekerinski ; Nelma Moreira ; José N. Oliveira ; Daniel Ratiu ; Riccardo Guidotti ; Marie Farrell ; Matt Luckcuck ; Diego Marmsoler ; José Campos ; Troy Astarte ; Laure Gonnord ; Antonio Cerone ; Luis Couto ; Brijesh Dongol ; Martin Kutrib ; Pedro Monteiro ; David Delmas. Springer VS, 2020. pp. 413-427 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12233 LNCS).
Bibtex
@inproceedings{a77c84624e094405a73b6cc31503aa23,
title = "Reversible programs have reversible semantics",
abstract = "During the past decade, reversible programming languages have been formalized using various established semantic frameworks. However, these semantics fail to effectively specify the distinct properties of reversible languages at the metalevel, and even neglect the central question of whether the defined language is reversible. In this paper, we build on a metalanguage foundation for reversible languages based on the category of sets and partial injective functions. We exemplify our approach through step-by-step development of the full semantics of an r-Turing complete reversible while-language with recursive procedures. This yields a formalization of the semantics in which the reversibility of the language and its inverse semantics are immediate, as well as the inversion of programs written in the language. We further discuss applications and future research directions for reversible semantics.",
author = "Robert Gl{\"u}ck and Robin Kaarsgaard and Tetsuo Yokoyama",
year = "2020",
doi = "10.1007/978-3-030-54997-8_26",
language = "English",
isbn = "9783030549961",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer VS",
pages = "413--427",
editor = "Emil Sekerinski and Nelma Moreira and Oliveira, {Jos{\'e} N.} and Daniel Ratiu and Riccardo Guidotti and Marie Farrell and Matt Luckcuck and Diego Marmsoler and Jos{\'e} Campos and Troy Astarte and Laure Gonnord and Antonio Cerone and Luis Couto and Brijesh Dongol and Martin Kutrib and Pedro Monteiro and David Delmas",
booktitle = "Formal Methods. FM 2019 International Workshops - Revised Selected Papers",
note = "3rd World Congress on Formal Methods, FM 2019 ; Conference date: 07-10-2019 Through 11-10-2019",
}
RIS
TY - GEN
T1 - Reversible programs have reversible semantics
AU - Glück, Robert
AU - Kaarsgaard, Robin
AU - Yokoyama, Tetsuo
PY - 2020
Y1 - 2020
N2 - During the past decade, reversible programming languages have been formalized using various established semantic frameworks. However, these semantics fail to effectively specify the distinct properties of reversible languages at the metalevel, and even neglect the central question of whether the defined language is reversible. In this paper, we build on a metalanguage foundation for reversible languages based on the category of sets and partial injective functions. We exemplify our approach through step-by-step development of the full semantics of an r-Turing complete reversible while-language with recursive procedures. This yields a formalization of the semantics in which the reversibility of the language and its inverse semantics are immediate, as well as the inversion of programs written in the language. We further discuss applications and future research directions for reversible semantics.
AB - During the past decade, reversible programming languages have been formalized using various established semantic frameworks. However, these semantics fail to effectively specify the distinct properties of reversible languages at the metalevel, and even neglect the central question of whether the defined language is reversible. In this paper, we build on a metalanguage foundation for reversible languages based on the category of sets and partial injective functions. We exemplify our approach through step-by-step development of the full semantics of an r-Turing complete reversible while-language with recursive procedures. This yields a formalization of the semantics in which the reversibility of the language and its inverse semantics are immediate, as well as the inversion of programs written in the language. We further discuss applications and future research directions for reversible semantics.
UR - http://www.scopus.com/inward/record.url?scp=85089715944&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-54997-8_26
DO - 10.1007/978-3-030-54997-8_26
M3 - Article in proceedings
AN - SCOPUS:85089715944
SN - 9783030549961
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 413
EP - 427
BT - Formal Methods. FM 2019 International Workshops - Revised Selected Papers
A2 - Sekerinski, Emil
A2 - Moreira, Nelma
A2 - Oliveira, José N.
A2 - Ratiu, Daniel
A2 - Guidotti, Riccardo
A2 - Farrell, Marie
A2 - Luckcuck, Matt
A2 - Marmsoler, Diego
A2 - Campos, José
A2 - Astarte, Troy
A2 - Gonnord, Laure
A2 - Cerone, Antonio
A2 - Couto, Luis
A2 - Dongol, Brijesh
A2 - Kutrib, Martin
A2 - Monteiro, Pedro
A2 - Delmas, David
PB - Springer VS
T2 - 3rd World Congress on Formal Methods, FM 2019
Y2 - 7 October 2019 through 11 October 2019
ER -
