A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
On Algebraic Abstractions for Concurrent Separation Logics
[article]
2020
arXiv
pre-print
Preserved Fulltext
Other Versions
Concurrent separation logic is distinguished by transfer of state ownership upon parallel composition and framing. ...
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 ...
ACKNOWLEDGMENTS We thank Gordon Stewart and Joe Tassarotti for their comments on various drafts of the paper. We thank the anonymous reviewers from the POPL'21 PC and AEC for their feedback. ...
arXiv:2010.12686v1
fatcat:kjuklc2l7vhexmkwqboab227ry
On Algebraic Abstractions for Concurrent Separation Logics (artefact)
[article]
2020
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
On Algebraic Abstractions for Concurrent Separation Logics. Proc. ACM Program. ...
First, it provides a complete bottom-up mechanization of partial commutative monoids (PCM), separating relations, PCM morphisms, and the related constructions. ...
doi:10.5281/zenodo.4290548
fatcat:azsvfwed6bcipprmfauuqi3esq
On Algebraic Abstractions for Concurrent Separation Logics (artefact)
[article]
2020
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This artefact is a companion to the paper On Algebraic Abstractions for Concurrent Separation Logics. The artefact contains Coq sources of the developments presented in the submission. ...
First, it provides a complete bottom-up mechanization of partial commutative monoids (PCM), separating relations, PCM morphisms, and the related constructions. ...
doi:10.5281/zenodo.4069513
fatcat:5yqovwisd5fufihvaczxshkzka
On Algebraic Abstractions for Concurrent Separation Logics (artefact)
[article]
2020
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This artefact is a companion to the paper On Algebraic Abstractions for Concurrent Separation Logics. The artefact contains Coq sources of the developments presented in the submission. ...
First, it provides a complete bottom-up mechanization of partial commutative monoids (PCM), separating relations, PCM morphisms, and the related constructions. ...
doi:10.5281/zenodo.4118715
fatcat:dljkplxh4jhlni4ib5ikyjxwnq
Algebra, Logic, Locality, Concurrency
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
others -on models and logics for concurrent processes [10, 6, 5] . The approach we are taking abstracts from syntax or particular models. ...
So, one gets a generic program logic from the algebra, which holds for a range of concrete models. ...
On the other hand, the algebra has as instances concrete models that are far removed conceptually from the resource models at the basis of Separation Logic (e.g., models based on interleaving and independence ...
doi:10.1007/978-3-642-25379-9_2
fatcat:5t7wapdh6jhgzcskoplmzuc7me
Separating concurrent languages with categories of language embeddings
1991
Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
based on algebraic
complexity
and in developing
general
tools for language
separation. ...
concurrent
logic languages. ...
doi:10.1145/103418.103423
dblp:conf/stoc/Shapiro91
fatcat:bx5otjtn4fgtvb7iqnanmkht5u
Models of Computation: A Tribute to Ugo Montanari's Vision
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Reference [43] is the first paper on final, observational semantics in abstract data types, and the main reference for one of the MoC contributed papers in this volume. ...
To mention just three (in alphabetic order): algebraic techniques, concurrency theory, and unification mechanisms. ...
The CHARM [31] , Concurrency and Hiding in an Abstract Rewriting Machine, is an abstract machine that combines algebraic techniques typical of process calculi with the experience in constraint logic programming ...
doi:10.1007/978-3-540-68679-8_31
fatcat:2ten745a2fe37ahbgbc4wukcsi
Views
2013
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
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 ...
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 ...
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
2013
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
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 ...
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 ...
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 Action and Abstract Separation Logic
2007
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We also show that our conditions on local actions allow a general soundness proof for a separation logic for concurrency, interpreted over arbitrary separation algebras. ...
We formulate local actions for a class of models called separation algebras, abstracting from the RAM and other specific concrete models used in work on separation logic. ...
We are grateful to Philippa Gardner and Martin Hyland for trenchant criticisms at decisive points in this work. We acknowledge the financial support of the EPSRC. ...
doi:10.1109/lics.2007.30
dblp:conf/lics/CalcagnoOY07
fatcat:emmrf2hk6vg3vlsly3hfsl72rq
Precision and the Conjunction Rule in Concurrent Separation Logic
2011
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Concurrent separation logic is a Hoare logic for modular reasoning about concurrent heap-manipulating programs synchronising via locks. ...
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
Page 5367 of Mathematical Reviews Vol. , Issue 90I
[page]
1990
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Rutten, Correctness and full abstraction of metric semantics for concurrency (pp. 628-659); Colin Stirling, Temporal logics for CCS (pp. 660-672); M. W. ...
Cherkasova], On models and algebras for concurrent pro- cesses (pp. 27-43); Maxime Crochemore, String matching with constraints (pp. 44-58); Lane A. ...
An Abstraction Technique for Verifying Shared-Memory Concurrency
2020
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
However, many existing approaches for concurrency verification are theoretical and focus primarily on expressivity and generality. ...
The key idea of the approach is that program behaviour is abstractly modelled using process algebra, and analysed separately. ...
We are looking in particular into distributed programs that communicate over channels, since process algebra have been used extensively to model such programs (see for example the work and uses of the ...
doi:10.3390/app10113928
fatcat:r2t25evrhfc5hjho7g5lxd3hj4
A Program Construction and Verification Tool for Separation Logic
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
An algebraic approach to the design of program construction and verification tools is applied to separation logic. ...
These are linked to the separation algebra by soundness proofs. ...
The third author would like to thank Tony Hoare, Peter O'Hearn and Matthew Parkinson for discussions on concurrent Kleene algebra and separation logic. ...
doi:10.1007/978-3-319-19797-5_7
fatcat:o4cbszfqz5cxvfaj3v5sk4q2l4
Caper
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Recent program logics based on separation logic emphasise a modular approach to proving functional correctness for fine-grained concurrent programs. However, these logics have no automation support. ...
In this paper, we present Caper, a prototype tool for automated reasoning in such a logic. ...
This research was supported by the "ModuRes" Sapere Aude Advanced Grant from The Danish Council for Independent Research for the Natural Sciences (FNU), the "Automated Verification for Concurrent Programs ...
doi:10.1007/978-3-662-54434-1_16
fatcat:hibvso2zv5hhdit2lufgiienpa
« Previous
Showing results 1 — 15 out of 14,631 results