Aviso: para depositar documentos, por favor, inicia sesión e identifícate con tu cuenta de correo institucional de la UCM con el botón MI CUENTA UCM. No emplees la opción AUTENTICACIÓN CON CONTRASEÑA
 

On algebraic abstractions for concurrent separation logics

dc.conference.titlePOPL
dc.contributor.authorFarka, Frantisek
dc.contributor.authorNanevski, Aleksandar
dc.contributor.authorBanerjee, Anindya
dc.contributor.authorDelbianco, Germán Andrés
dc.contributor.authorFábregas Alfaro, Ignacio
dc.date.accessioned2024-02-02T12:11:26Z
dc.date.available2024-02-02T12:11:26Z
dc.date.issued2021-01-01
dc.description.abstractConcurrent separation logic is distinguished by transfer of state ownership upon parallel composition and framing. The algebraic structure that underpins ownership transfer is that of partial commutative monoids (PCMs). Extant research considers ownership transfer primarily from the logical perspective while comparatively less attention is drawn to the algebraic considerations. This paper provides an algebraic formalization of ownership transfer in concurrent separation logic by means of structure-preserving partial functions (i.e., morphisms) between PCMs, and an associated notion of separating relations. Morphisms of structures are a standard concept in algebra and category theory, but haven’t seen ubiquitous use in separation logic before. Separating relations are binary relations that generalize disjointness and characterize the inputs on which morphisms preserve structure. The two abstractions facilitate verification by enabling concise ways of writing specs, by providing abstract views of threads’ states that are preserved under ownership transfer, and by enabling user-level construction of new PCMs out of existing ones.en
dc.description.departmentDepto. de Sistemas Informáticos y Computación
dc.description.facultyFac. de Ciencias Matemáticas
dc.description.refereedTRUE
dc.description.statuspub
dc.identifier.citationFarka, F.; Nanevski, A.; Banerjee, A.; Delbianco, G. A.; Fábregas, I. On algebraic abstractions for concurrent separation logics. Proceedings of the ACM on Programming Languages 2021, 5(POPL), 1–32. doi:10.1145/3434286.
dc.identifier.doi10.1145/3434286
dc.identifier.officialurlhttps//doi.org/10.1145/3434286
dc.identifier.urihttps://hdl.handle.net/20.500.14352/98240
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internationalen
dc.rights.accessRightsopen access
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subject.ucmInformática (Informática)
dc.subject.unesco1203.17 Informática
dc.titleOn algebraic abstractions for concurrent separation logicsen
dc.typeconference paper
dspace.entity.typePublication
relation.isAuthorOfPublication09fd55c9-1783-4b0d-a8b5-4c2e392fccd8
relation.isAuthorOfPublication.latestForDiscovery09fd55c9-1783-4b0d-a8b5-4c2e392fccd8

Download

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
2021_POPL.pdf
Size:
407.99 KB
Format:
Adobe Portable Document Format

Collections