no code implementations • 23 Oct 2020 • František Farka, Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco, Ignacio Fábregas
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.
Programming Languages Logic in Computer Science
no code implementations • 15 Apr 2019 • Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco, Ignacio Fábregas
In addition to pre- and postconditions, program specifications in recent separation logics for concurrency have employed an algebraic structure of resources---a form of state transition system---to describe the state-based program invariants that must be preserved, and to record the permissible atomic changes to program state.
Programming Languages Distributed, Parallel, and Cluster Computing Logic in Computer Science F.3.1; F.4.1; D.1.1; D.1.3; D.2.4; D.3.2
