منابع مشابه
A Simple Separation Logic
The kinds of models that are usually considered in separation logic are structures such as words, trees, and more generally pointer structures (heaps). In this paper we introduce the separation logic of much simpler structures, viz. sets. The models of our set separation logic are nothing but valuations of classical propositional logic. Separating a valuation V consists in splitting it up into ...
متن کاملNonmonotonic Probabilistic Logics between Model-theoretic Probabilistic Logic and Probabilistic Logic under Coherence Nonmonotonic Probabilistic Logics between Model-theoretic Probabilistic Logic and Probabilistic Logic under Coherence
Recently, it has been shown that probabilistic entailment under coherence is weaker than model-theoretic probabilistic entailment. Moreover, probabilistic entailment under coherence is a generalization of default entailment in System P . In this paper, we continue this line of research by presenting probabilistic generalizations of more sophisticated notions of classical default entailment that...
متن کاملA separation logic for a promising semantics
We present SLR, the first expressive program logic for reasoning about concurrent programs under a weak memory model addressing the out-of-thin-air problem. Our logic includes the standard features from existing logics, such as RSL and GPS, that were previously known to be sound only under stronger memory models: (1) separation, (2) per-location invariants, and (3) ownership transfer via releas...
متن کاملA separation logic for a promising semantics
This is the technical appendix accompanying the article “A separation logic for a promising semantics”. It contains a soundness proof for the SLR logic. The programming language and logic presented in this appendix extends the programming language and logic presented in the paper with plain accesses. The programming language has further been extended with compare-and-swap operations and the log...
متن کاملSubjective Concurrent Separation Logic
From Owicki-Gries’ resource invariants and Jones’ rely/guarantee to modern variants based on separation logic, axiomatic program logics for concurrency have a limited form of compositionality. Proving non-trivial properties usually requires the use of auxiliary state, which is “objective” in the sense that each thread’s auxiliary state is given a globally-unique name. Since auxiliary state expo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2020
ISSN: 2475-1421
DOI: 10.1145/3371123