Data structures and dynamic memory management in reversible languages
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
We present a method for reversible dynamic memory management based on a reversible version of the Buddy Memory system. This method supports decoupled allocation and deallocation of variable-sized records and can be applied to any reversible language with heap storage. We demonstrate how these new capabilities allow for the direct realization of commonplace data structures such as trees, heaps and queues which until now has not been practical in a reversible language. Finally, we provide a definition of our method in the high-level reversible language Janus as well as a description of its fragmentation and garbage-generation characteristics. The reversible memory management system has been fully implemented and tested in a compiler for a reversible object-oriented programming language targeting the reversible assembly language PISA.
Original language | English |
---|---|
Title of host publication | Reversible Computation : 10th International Conference, RC 2018, 2018, Proceedings |
Editors | Jarkko Kari, Irek Ulidowski |
Publisher | Springer |
Publication date | 2018 |
Pages | 269-285 |
ISBN (Electronic) | 978-3-319-59936-6 |
DOIs | |
Publication status | Published - 2018 |
Event | 10th International Conference on Reversible Computation, RC 2018 - Leicester, United Kingdom Duration: 12 Sep 2018 → 14 Sep 2018 |
Conference
Conference | 10th International Conference on Reversible Computation, RC 2018 |
---|---|
Land | United Kingdom |
By | Leicester |
Periode | 12/09/2018 → 14/09/2018 |
Series | Lecture notes in computer science |
---|---|
Volume | 11106 |
ISSN | 0302-9743 |
ID: 202165974