Soundness of a concurrent collector for actors (extended version)
ORCA is a garbage collection protocol for actor-based programs. Multiple actors may mutate the heap while the collector is running without any dedicated synchronisation. ORCA is applicable to any actor language whose type system prevents data races and which supports causal message delivery. We pres...
Main Authors: | , , , , |
---|---|
Format: | Report |
Language: | unknown |
Published: |
Department of Computing, Imperial College London
2018
|
Subjects: | |
Online Access: | http://hdl.handle.net/10044/1/94875 https://doi.org/10.25561/94875 |
id |
ftimperialcol:oai:spiral.imperial.ac.uk:10044/1/94875 |
---|---|
record_format |
openpolar |
spelling |
ftimperialcol:oai:spiral.imperial.ac.uk:10044/1/94875 2023-05-15T17:52:57+02:00 Soundness of a concurrent collector for actors (extended version) Franco, J Clebsch, S Drossopoulou, S Vitek, J Wrigstad, T 2018-01-01 http://hdl.handle.net/10044/1/94875 https://doi.org/10.25561/94875 unknown Department of Computing, Imperial College London Departmental Technical Report: 18/1 http://hdl.handle.net/10044/1/94875 https://doi.org/10.25561/94875 © 2018 The Author(s). This report is available open access under a CC-BY-NC-ND (https://creativecommons.org/licenses/by-nc-nd/4.0/) http://creativecommons.org/licenses/by-nc-nd/4.0/ CC-BY-NC-ND 42 1 Report 2018 ftimperialcol https://doi.org/10.25561/94875 2022-02-24T23:41:34Z ORCA is a garbage collection protocol for actor-based programs. Multiple actors may mutate the heap while the collector is running without any dedicated synchronisation. ORCA is applicable to any actor language whose type system prevents data races and which supports causal message delivery. We present a model of ORCA which is parametric to the host language and its type system. We describe the interplay between the host language and the collector. We give invariants preserved by ORCA, and prove its soundness and completeness. Report Orca Imperial College London: Spiral |
institution |
Open Polar |
collection |
Imperial College London: Spiral |
op_collection_id |
ftimperialcol |
language |
unknown |
description |
ORCA is a garbage collection protocol for actor-based programs. Multiple actors may mutate the heap while the collector is running without any dedicated synchronisation. ORCA is applicable to any actor language whose type system prevents data races and which supports causal message delivery. We present a model of ORCA which is parametric to the host language and its type system. We describe the interplay between the host language and the collector. We give invariants preserved by ORCA, and prove its soundness and completeness. |
format |
Report |
author |
Franco, J Clebsch, S Drossopoulou, S Vitek, J Wrigstad, T |
spellingShingle |
Franco, J Clebsch, S Drossopoulou, S Vitek, J Wrigstad, T Soundness of a concurrent collector for actors (extended version) |
author_facet |
Franco, J Clebsch, S Drossopoulou, S Vitek, J Wrigstad, T |
author_sort |
Franco, J |
title |
Soundness of a concurrent collector for actors (extended version) |
title_short |
Soundness of a concurrent collector for actors (extended version) |
title_full |
Soundness of a concurrent collector for actors (extended version) |
title_fullStr |
Soundness of a concurrent collector for actors (extended version) |
title_full_unstemmed |
Soundness of a concurrent collector for actors (extended version) |
title_sort |
soundness of a concurrent collector for actors (extended version) |
publisher |
Department of Computing, Imperial College London |
publishDate |
2018 |
url |
http://hdl.handle.net/10044/1/94875 https://doi.org/10.25561/94875 |
genre |
Orca |
genre_facet |
Orca |
op_source |
42 1 |
op_relation |
Departmental Technical Report: 18/1 http://hdl.handle.net/10044/1/94875 https://doi.org/10.25561/94875 |
op_rights |
© 2018 The Author(s). This report is available open access under a CC-BY-NC-ND (https://creativecommons.org/licenses/by-nc-nd/4.0/) http://creativecommons.org/licenses/by-nc-nd/4.0/ |
op_rightsnorm |
CC-BY-NC-ND |
op_doi |
https://doi.org/10.25561/94875 |
_version_ |
1766160707747840000 |