Reversible machine code and its abstract processor architecture

Holger Bock Axelsen; Robert Glück; Tetsuo Yokoyama

doi:10.1007/978-3-540-74510-5_9

Reversible machine code and its abstract processor architecture

Holger Bock Axelsen, Robert Glück, Tetsuo Yokoyama

Datalogisk Institut

41 Citationer (Scopus)

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.

Originalsprog	Engelsk
Titel	Computer Science - Theory and Applications : Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings
Redaktører	Volker Diekert, Mikhail Volkov, Andrei Voronkov
Forlag	Springer
Publikationsdato	2007
Sider	56-69
ISBN (Trykt)	978-3-540-74509-9
DOI	https://doi.org/10.1007/978-3-540-74510-5_9
Status	Udgivet - 2007
Begivenhed	International Symposium on Computer Science in Russia - Ekaterinburg, Rusland Varighed: 3 sep. 2007 → 7 sep. 2007 Konferencens nummer: 1

Konference

Konference	International Symposium on Computer Science in Russia
Nummer	1
Land/Område	Rusland
By	Ekaterinburg
Periode	03/09/2007 → 07/09/2007

Navn	Lecture notes in computer science
Nummer	4649
ISSN	0302-9743

Adgang til dokumentet

10.1007/978-3-540-74510-5_9

Citationsformater

Axelsen, H. B., Glück, R., & Yokoyama, T. (2007). Reversible machine code and its abstract processor architecture. I V. Diekert, M. Volkov, & A. Voronkov (red.), Computer Science - Theory and Applications: Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings (s. 56-69). Springer. Lecture notes in computer science Nr. 4649 https://doi.org/10.1007/978-3-540-74510-5_9

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. red. / Volker Diekert; Mikhail Volkov; Andrei Voronkov. Springer, 2007. s. 56-69 (Lecture notes in computer science; Nr. 4649).

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

Axelsen, HB, Glück, R & Yokoyama, T 2007, Reversible machine code and its abstract processor architecture. i V Diekert, M Volkov & A Voronkov (red), 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, nr. 4649, s. 56-69, International Symposium on Computer Science in Russia, Ekaterinburg, Rusland, 03/09/2007. https://doi.org/10.1007/978-3-540-74510-5_9

Axelsen HB, Glück R, Yokoyama T. Reversible machine code and its abstract processor architecture. I Diekert V, Volkov M, Voronkov A, red., Computer Science - Theory and Applications: Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings. Springer. 2007. s. 56-69. (Lecture notes in computer science; Nr. 4649). doi: 10.1007/978-3-540-74510-5_9

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. red. / Volker Diekert ; Mikhail Volkov ; Andrei Voronkov. Springer, 2007. s. 56-69 (Lecture notes in computer science; Nr. 4649).

@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; International Symposium on Computer Science in Russia ; 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",

}

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

T2 - International Symposium on Computer Science in Russia

Y2 - 3 September 2007 through 7 September 2007

ER -