Add to ORKGInternational audienceWe present an extension of Separation Logic with a general mechanism for temporarily converting any assertion (or "permission") to a read-only form. No accounting is required: our read-only permissions can be freely duplicated and discarded. We argue that, in circumstances where mutable data structures are temporarily accessed only for reading, our read-only permissions enable more concise specifications and proofs. The metatheory of our proposal is verified in Coq
AbstractAt last yearʼs MFPS conference we introduced a revised version of Concurrent Separation Logi...
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an ...
Formal languages for policy have been developed for access control and confor-mance checking. In thi...
International audienceWe present an extension of Separation Logic with a general mechanism for tempo...
Concurrent separation logic includes the notion of ‘ownership' of a heap data structure that can be ...
The concept of controlling access to mutable shared data via permissions is at the heart of permissi...
The concept of controlling access to mutable shared data via permissions is at the heart of permissi...
Separation logic, originally developed by OÕHearn and Reynolds [1], is an extension of Hoare logic ...
Separation logic began by describing total separation between the heap space used by separate parts ...
In concurrent verification, separation logic provides a strong story for handling both resources tha...
This paper applied the separation logic notions of ownership and permission to ‘stack' variables tha...
Separation logic is used as an assertion language for Hoare-style proof systems about programs with ...
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program...
Abstract. We adapt a variant of permission-accounting separation logic to a con-current Java-like la...
AbstractParkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which...
AbstractAt last yearʼs MFPS conference we introduced a revised version of Concurrent Separation Logi...
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an ...
Formal languages for policy have been developed for access control and confor-mance checking. In thi...
International audienceWe present an extension of Separation Logic with a general mechanism for tempo...
Concurrent separation logic includes the notion of ‘ownership' of a heap data structure that can be ...
The concept of controlling access to mutable shared data via permissions is at the heart of permissi...
The concept of controlling access to mutable shared data via permissions is at the heart of permissi...
Separation logic, originally developed by OÕHearn and Reynolds [1], is an extension of Hoare logic ...
Separation logic began by describing total separation between the heap space used by separate parts ...
In concurrent verification, separation logic provides a strong story for handling both resources tha...
This paper applied the separation logic notions of ownership and permission to ‘stack' variables tha...
Separation logic is used as an assertion language for Hoare-style proof systems about programs with ...
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program...
Abstract. We adapt a variant of permission-accounting separation logic to a con-current Java-like la...
AbstractParkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which...
AbstractAt last yearʼs MFPS conference we introduced a revised version of Concurrent Separation Logi...
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an ...
Formal languages for policy have been developed for access control and confor-mance checking. In thi...