Filters








30,149 Hits in 5.9 sec

Precision and the Conjunction Rule in Concurrent Separation Logic

Alexey Gotsman, Josh Berdine, Byron Cook
2011 Electronical Notes in Theoretical Computer Science  
are required to be precise and the conjunction rule is included.  ...  However, to date it has been an open question whether concurrent separation logic without the conjunction rule is sound when the restriction on resource invariants is dropped: all the published proofs  ...  Acknowledgement We would like to thank Peter O'Hearn, Hongseok Yang and the anonymous reviewers for helpful comments and suggestions.  ... 
doi:10.1016/j.entcs.2011.09.021 fatcat:y26e7zhqnvasdac6yuhzra3lde

Resources, Concurrency, and Local Reasoning [chapter]

Peter W. O'Hearn
2004 Lecture Notes in Computer Science  
We describe a variation on the proof rules of Hoare for contitional critical regions, using the "separating conjunction" connective to preclude pointer-based interference.  ...  The purpose of this work is to revisit these issues, using the recent formalism of separation logic [11] .  ...  Precise assertions fulfill a similar role in recent work on information hiding [8] , and are used by Brookes in his semantic analysis of our concurrency proof rules [2] .  ... 
doi:10.1007/978-3-540-24725-8_1 fatcat:dxr6juaumvfkdbdrbluhkp7xgm

Formal verification of concurrent programs with read-write locks

Ming Fu, Yu Zhang, Yong Li
2010 Frontiers of Computer Science in China  
We extend the heap model with a writing permission set, denoted as logical heap, then define "strong separation" and "weak separation" over logical heap.  ...  Following CSL's local-reasoning idea, we develop a novel program logic to enforces weak separations of heap between different threads and support verification of concurrent programs with read-write locks  ...  Any opinions, findings, and conclusions contained in this document are those of the authors and do not reflect the views of these agencies.  ... 
doi:10.1007/s11704-009-0067-6 fatcat:z3ss2gmzbbc4bdhzowigiokz3m

Reasoning over Permissions Regions in Concurrent Separation Logic [chapter]

James Brotherston, Diana Costa, Aquinas Hobor, John Wickerson
2020 Lecture Notes in Computer Science  
We suggest two formal syntactic additions that collectively remove the need for such side conditions: first, the use of both "weak" and "strong" forms of separating conjunction, and second, the use of  ...  We propose an extension of separation logic with fractional permissions, aimed at reasoning about concurrent programs that share arbitrary regions or data structures in memory.  ...  The rely-guarantee separation logic in [30] similarly restricts concurrent reasoning to structures described by precise formulas only.  ... 
doi:10.1007/978-3-030-53291-8_13 fatcat:h5kthdsmyrdchn2jymlvulnepi

Interview with Stephen Brookes and Peter W. O'Hearn Recipients of the 2016 Godel Prize

Luca Aceto
2016 Bulletin of the European Association for Theoretical Computer Science  
Quoting from the citation for the prize: "Concurrent Separation Logic (CSL) is a revolutionary advance over previous proof systems for verifying properties of systems software, which commonly involve both  ...  As a result numerous tools and techniques in the research community are based on it and it is attracting attention in companies such as Microsoft, Facebook and Amazon.  ...  some of it drops the precision requirement (but also the conjunction rule).  ... 
dblp:journals/eatcs/Aceto16a fatcat:r3pfnoyf6fetrdsilyb4rpltxm

Views

Thomas Dinsdale-Young, Lars Birkedal, Philippa Gardner, Matthew Parkinson, Hongseok Yang
2013 SIGPLAN notices  
For instance, separation logic uses formulae that describe part of the state, abstracting the rest; when two threads use disjoint state, their specifications can be composed with the separating conjunction  ...  The metatheory is remarkably simple, but highly applicable: the rely-guarantee method, concurrent separation logic, concurrent abstract predicates, type systems for recursive references and for unique  ...  Acknowledgments We thank Tony Hoare, Peter O'Hearn, Azalea Raad, John Wickerson, Adam Wright and the anonymous referees of POPL'12, LICS'12, CONCUR'12 and POPL'13 for helpful feedback and comments on the  ... 
doi:10.1145/2480359.2429104 fatcat:egcqsx3kpfbdng7egaj4ytldwm

Views

Thomas Dinsdale-Young, Lars Birkedal, Philippa Gardner, Matthew Parkinson, Hongseok Yang
2013 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '13  
For instance, separation logic uses formulae that describe part of the state, abstracting the rest; when two threads use disjoint state, their specifications can be composed with the separating conjunction  ...  The metatheory is remarkably simple, but highly applicable: the rely-guarantee method, concurrent separation logic, concurrent abstract predicates, type systems for recursive references and for unique  ...  Acknowledgments We thank Tony Hoare, Peter O'Hearn, Azalea Raad, John Wickerson, Adam Wright and the anonymous referees of POPL'12, LICS'12, CONCUR'12 and POPL'13 for helpful feedback and comments on the  ... 
doi:10.1145/2429069.2429104 dblp:conf/popl/Dinsdale-YoungBGPY13 fatcat:jlgrhlv5enhk3b7dwuhor5btza

Local rely-guarantee reasoning

Xinyu Feng
2008 Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '09  
In this paper, we propose LRG, a new Rely-Guarantee-based logic that brings local reasoning and information hiding to concurrency verification.  ...  Our logic, for the first time, supports a frame rule over rely/guarantee conditions so that specifications of program modules only need to talk about the resources used locally, and the verified modules  ...  In particular, Matthew suggested to add the hide rule and showed that the par-hide rule, which was a built-in rule in an earlier version of the paper, could be derived from the hide rule and the par rule  ... 
doi:10.1145/1480881.1480922 dblp:conf/popl/Feng09 fatcat:yrlvw57pxneipn747perjy7xly

Local rely-guarantee reasoning

Xinyu Feng
2009 SIGPLAN notices  
In this paper, we propose LRG, a new Rely-Guarantee-based logic that brings local reasoning and information hiding to concurrency verification.  ...  Our logic, for the first time, supports a frame rule over rely/guarantee conditions so that specifications of program modules only need to talk about the resources used locally, and the verified modules  ...  In particular, Matthew suggested to add the hide rule and showed that the par-hide rule, which was a built-in rule in an earlier version of the paper, could be derived from the hide rule and the par rule  ... 
doi:10.1145/1594834.1480922 fatcat:2ydxtyilcfdnto7l7meqk3rsuq

Separation logic

Peter O'Hearn
2019 Communications of the ACM  
Finally, thanks to my colleagues at Facebook for our work together and for teaching me about applying logic in the real world.  ...  This article is dedicated to the memory of John C. Reynolds (1935Reynolds ( -2013)). Our work together at the formative stage of separation logic was incredibly intense, exciting, and huge fun.  ...  Separation logic is an extension of Hoare logic, which employs novel logical operators, most importantly the separating conjunction * (pronounced "and Separation Logic DOI:10.1145/3211968 Separation  ... 
doi:10.1145/3211968 fatcat:a3cqq4nstzabnl5m57nclz7xwi

Resources, Concurrency and Local Reasoning [chapter]

Peter W. O'Hearn
2004 Lecture Notes in Computer Science  
In this paper we show how a resource-oriented logic, separation logic, can be used to reason about the usage of resources in concurrent programs.  ...  The influence of John Reynolds on this and all of my work is plain to see, and it is a special honour to be able to dedicate this paper to him. John has always stressed how  ...  So, the initial step in this work was just to insert the separating conjunction in appropriate places in the TTPP proof rules, or rather, the extension of these rules studied by Owicki and Gries [39]  ... 
doi:10.1007/978-3-540-28644-8_4 fatcat:yygafqcp25bgdbshyylxowh35i

Resources, concurrency, and local reasoning

Peter W. O'Hearn
2007 Theoretical Computer Science  
In this paper we show how a resource-oriented logic, separation logic, can be used to reason about the usage of resources in concurrent programs.  ...  We repeat, however, that this paper is but a first attempt at bringing separation logic to concurrency.  ...  We focussed on CCRs and resource invariants because it eased the attempt; perhaps a marriage between separation logic and rely-guarantee is also possible.  ... 
doi:10.1016/j.tcs.2006.12.035 fatcat:22abkvix6fbwxgcgsr67t4wxiu

On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning [chapter]

Xinyu Feng, Rodrigo Ferreira, Zhong Shao
2007 Lecture Notes in Computer Science  
We study the relationship between Concurrent Separation Logic (CSL) and the assume-guarantee (A-G) method (a.k.a. rely-guarantee method).  ...  Then we extend the program logic with explicit separation of "private data" and "shared data", which provides better memory modularity.  ...  Any opinions, findings, and conclusions contained in this document are those of the authors and do not reflect the views of these agencies.  ... 
doi:10.1007/978-3-540-71316-6_13 fatcat:m6sqrnfljzdddefmzw2qurtnji

Formal Reasoning about Concurrent Assembly Code with Reentrant Locks

Ming Fu, Yu Zhang, Yong Li
2009 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering  
This paper focuses on the problem of reasoning about concurrent assembly code with reentrant locks. Our verification technique is based on concurrent separation logic (CSL).  ...  Keeping track of the reentrant level for each lock in the pre-and postconditions enables the program logic to ensure that resources are not re-acquired upon reentrancy, thus resources owned by a thread  ...  CSL introduces the concurrency rule based on separation logic for reasoning about concurrent programs.  ... 
doi:10.1109/tase.2009.36 dblp:conf/tase/FuZL09 fatcat:6ryxkvs3cfff7i3ooemnf5bz5e

Variables as Resource for Shared-Memory Programs: Semantics and Soundness

Stephen Brookes
2006 Electronical Notes in Theoretical Computer Science  
They used a simple operational semantics to prove soundness of the sequential fragment of their logic, and they showed that the inference rules of concurrent separation logic can be translated directly  ...  We provide a denotational semantics and a soundness proof for the concurrent fragment of their logic, extending our earlier work on concurrent separation logic to incorporate permissions in a natural manner  ...  The anonymous referees made some helpful comments.  ... 
doi:10.1016/j.entcs.2006.04.008 fatcat:zapmixzkqbeo3jtdtgg6k4u6q4
« Previous Showing results 1 — 15 out of 30,149 results