Standard
Reversible machine code and its abstract processor architecture. / Axelsen, Holger Bock; Glück, Robert; Yokoyama, Tetsuo.
Computer Science - Theory and Applications: Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings. ed. / Volker Diekert; Mikhail Volkov; Andrei Voronkov. Springer, 2007. p. 56-69 (Lecture notes in computer science; No. 4649).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Axelsen, HB
, Glück, R & Yokoyama, T 2007,
Reversible machine code and its abstract processor architecture. in V Diekert, M Volkov & A Voronkov (eds),
Computer Science - Theory and Applications: Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings. Springer, Lecture notes in computer science, no. 4649, pp. 56-69, International Symposium on Computer Science in Russia, Ekaterinburg, Russian Federation,
03/09/2007.
https://doi.org/10.1007/978-3-540-74510-5_9APA
Axelsen, H. B.
, Glück, R., & Yokoyama, T. (2007).
Reversible machine code and its abstract processor architecture. In V. Diekert, M. Volkov, & A. Voronkov (Eds.),
Computer Science - Theory and Applications: Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings (pp. 56-69). Springer. Lecture notes in computer science No. 4649
https://doi.org/10.1007/978-3-540-74510-5_9Vancouver
Axelsen HB
, Glück R, Yokoyama T.
Reversible machine code and its abstract processor architecture. In Diekert V, Volkov M, Voronkov A, editors, Computer Science - Theory and Applications: Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings. Springer. 2007. p. 56-69. (Lecture notes in computer science; No. 4649).
https://doi.org/10.1007/978-3-540-74510-5_9Author
Axelsen, Holger Bock ; Glück, Robert ; Yokoyama, Tetsuo. / Reversible machine code and its abstract processor architecture. Computer Science - Theory and Applications: Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings. editor / Volker Diekert ; Mikhail Volkov ; Andrei Voronkov. Springer, 2007. pp. 56-69 (Lecture notes in computer science; No. 4649).
Bibtex
@inproceedings{363aa7a0905011dd86a6000ea68e967b,
title = "Reversible machine code and its abstract processor architecture",
abstract = "A reversible abstract machine architecture and its reversible machine code are presented and formalized. For machine code to be reversible, both the underlying control logic and each instruction must be reversible. A general class of machine instruction sets was proven to be reversible, building on our concept of reversible updates. The presentation is abstract and can serve as a guideline for a family of reversible processor designs. By example, we illustrate programming principles for the abstract machine architecture formalized in this paper. ",
author = "Axelsen, {Holger Bock} and Robert Gl{\"u}ck and Tetsuo Yokoyama",
note = "DOI: http://dx.doi.org/10.1007/978-3-540-74510-5_9; null ; Conference date: 03-09-2007 Through 07-09-2007",
year = "2007",
doi = "10.1007/978-3-540-74510-5_9",
language = "English",
isbn = "978-3-540-74509-9",
series = "Lecture notes in computer science",
publisher = "Springer",
number = "4649",
pages = "56--69",
editor = "Volker Diekert and Mikhail Volkov and Andrei Voronkov",
booktitle = "Computer Science - Theory and Applications",
address = "Switzerland",
}
RIS
TY - GEN
T1 - Reversible machine code and its abstract processor architecture
AU - Axelsen, Holger Bock
AU - Glück, Robert
AU - Yokoyama, Tetsuo
N1 - Conference code: 1
PY - 2007
Y1 - 2007
N2 - A reversible abstract machine architecture and its reversible machine code are presented and formalized. For machine code to be reversible, both the underlying control logic and each instruction must be reversible. A general class of machine instruction sets was proven to be reversible, building on our concept of reversible updates. The presentation is abstract and can serve as a guideline for a family of reversible processor designs. By example, we illustrate programming principles for the abstract machine architecture formalized in this paper.
AB - A reversible abstract machine architecture and its reversible machine code are presented and formalized. For machine code to be reversible, both the underlying control logic and each instruction must be reversible. A general class of machine instruction sets was proven to be reversible, building on our concept of reversible updates. The presentation is abstract and can serve as a guideline for a family of reversible processor designs. By example, we illustrate programming principles for the abstract machine architecture formalized in this paper.
U2 - 10.1007/978-3-540-74510-5_9
DO - 10.1007/978-3-540-74510-5_9
M3 - Article in proceedings
SN - 978-3-540-74509-9
T3 - Lecture notes in computer science
SP - 56
EP - 69
BT - Computer Science - Theory and Applications
A2 - Diekert, Volker
A2 - Volkov, Mikhail
A2 - Voronkov, Andrei
PB - Springer
Y2 - 3 September 2007 through 7 September 2007
ER -
