Filters








10 Hits in 1.7 sec

CoLoSL: Concurrent Local Subjective Logic [chapter]

Azalea Raad, Jules Villard, Philippa Gardner
2015 Lecture Notes in Computer Science  
This paper introduces the program logic CoLoSL, where each thread is verified with respect to its subjective view of the global shared state.  ...  This subjective view describes only that part of the state accessed by the thread.  ...  This paper introduces the program logic CoLoSL, which stands for Concurrent Local Subjective Logic.  ... 
doi:10.1007/978-3-662-46669-8_29 fatcat:ytlhxsuri5e25fgb6emcbqhylq

Verifying Concurrent Graph Algorithms [chapter]

Azalea Raad, Aquinas Hobor, Jules Villard, Philippa Gardner
2016 Lecture Notes in Computer Science  
We demonstrate how to use a logic without abstraction (CoLoSL) to carry out abstract reasoning in the style of iCAP, by building the abstraction into the proof structure rather than incorporating it into  ...  the semantic model of the logic.  ...  In the program logic of CoLoSL [12] , the program state is modelled as a pair comprising a thread-local state, and a global shared state accessible by all threads.  ... 
doi:10.1007/978-3-319-47958-3_17 fatcat:dy5quok2tffjvc55vznchnk4x4

Mechanized verification of fine-grained concurrent programs

Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee
2015 SIGPLAN notices  
Our tool is based on the recently proposed program logic FCSL.  ...  By incorporating a uniform concurrency model, based on state-transition systems and partial commutative monoids, FCSL makes it possible to build proofs about concurrent libraries in a thread-local, compositional  ...  The FCSL logic has been designed as a generalization of the classical Concurrent Separation Logic by O'Hearn [2007] , combining the ideas of local concurrent protocols with arbitrary interference [Jones  ... 
doi:10.1145/2813885.2737964 fatcat:nfb54qyyozbtjglecmxbg6yfym

Mechanized verification of fine-grained concurrent programs

Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee
2015 Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015  
Our tool is based on the recently proposed program logic FCSL.  ...  By incorporating a uniform concurrency model, based on state-transition systems and partial commutative monoids, FCSL makes it possible to build proofs about concurrent libraries in a thread-local, compositional  ...  The FCSL logic has been designed as a generalization of the classical Concurrent Separation Logic by O'Hearn [2007] , combining the ideas of local concurrent protocols with arbitrary interference [Jones  ... 
doi:10.1145/2737924.2737964 dblp:conf/pldi/SergeyNB15 fatcat:vmrr4jpmhzb6jazbodc5alxbku

Verifying Invariants of Lock-Free Data Structures with Rely-Guarantee and Refinement Types

Colin S. Gordon, Michael D. Ernst, Dan Grossman, Matthew J. Parkinson
2017 ACM Transactions on Programming Languages and Systems  
Our approach targets a space between simple type systems and modern concurrent program logics, offering an intermediate point between unverified code and full verification.  ...  We propose a new way of proving invariants of fine-grained concurrent data structures: applying rely-guarantee reasoning to references in the concurrent setting.  ...  The logic would require subjective state [Ley-Wild and Nanevski 2013] to express the specification precisely in a concurrent setting.  ... 
doi:10.1145/3064850 fatcat:bs2qkwegfjci7da3xq7eq5ixc4

A perspective on specifying and verifying concurrent modules

Thomas Dinsdale-Young, Pedro da Rocha Pinto, Philippa Gardner
2018 Journal of Logical and Algebraic Methods in Programming  
The specification of a concurrent program module, and the verification of implementations and clients with respect to such a specification, are difficult problems.  ...  We survey a range of techniques for specifying concurrent modules, using the example of a counter module to illustrate the benefits and limitations of each.  ...  This idea of subjective auxiliary state is at the core of Subjective Concurrent Separation Logic (SCSL) [23] (and the subsequent Fine-grained Concurrent Separation Logic (FCSL) [8, 9] ).  ... 
doi:10.1016/j.jlamp.2018.03.003 fatcat:kk6owizqlvcvbojctwdwb5xf5a

Concise Outlines for a Complex Logic: A Proof Outline Checker for TaDA (Full Paper) [article]

Felix A. Wolf and Malte Schwerhoff and Peter Müller
2021 arXiv   pre-print
Modern separation logics allow one to prove rich properties of intricate code, e.g. functional correctness and linearizability of non-blocking concurrent code.  ...  However, this expressiveness leads to a complexity that makes these logics difficult to apply.  ...  Raad, A., Villard, J., Gardner, P.: CoLoSL: Concurrent local subjective logic. In: Vitek, J. (ed.) ESOP. Lecture Notes in Computer Science, vol. 9032, pp. 710-735. Springer (2015) 35.  ... 
arXiv:2010.07080v3 fatcat:yygowo34o5edvjwpn3gwguyhye

Abstraction, refinement and concurrent reasoning

Azalea Raad, Sophia Drossopoulou, Philippa Gardner
2017
As to concurrent reasoning, this thesis introduces concurrent local subjective logic (CoLoSL) for compositional reasoning about fine-grained concurrent programs.  ...  CoLoSL introduces subjective views, where each thread is verified with respect to a customised local view of the state, as well as the general composition and framing of interference relations, allowing  ...  Concurrent Local Subjective Logic Concurrent local subjective logic (CoLoSL) is a general program logic for compositional reasoning about fine-grained concurrent algorithms.  ... 
doi:10.25560/49218 fatcat:lmycxnei7re33o4rejylnuahcq

Report from Dagstuhl Seminar 15191 Compositional Verification Methods for Next-Generation Concurrency 1 Executive Summary

Lars Birkedal, Derek Dreyer, Philippa Gardner, Zhong Shao, Lars Birkedal, Derek Dreyer, Philippa Gardner, Zhong Shao, Lars Birkedal, Derek Dreyer, Philippa Gardner, Zhong Shao
unpublished
methods that can scale to handle the realities of next-generation concurrency.  ...  This report documents the program and the outcomes of Dagstuhl Seminar 15191 "Composi-tional Verification Methods for Next-Generation Concurrency".  ...  In this work we introduce the program logic CoLoSL, where each thread is verified with respect to its subjective view of the global shared state.  ... 
fatcat:m4g3ki2k4vaj3eun3re3vmjoca

Understanding and evolving the Rust programming language [article]

Ralf Jung, Universität Des Saarlandes
2020
RustBelt is built on top of Iris, a language-agnostic framework, implemented in the Coq proof assistant, for building higher-order concurrent separation logics.  ...  In RustBelt, this technique is exploited crucially to introduce the lifetime logic, which provides a novel separation-logic account of borrowing, a key distinguishing feature of the Rust type system.  ...  ", 2013 [SBP13]; Raad, Villard, and Gardner, "CoLoSL: Concurrent local subjective logic", 2015 [RVG15]; Svendsen and Birkedal, "Impredicative concurrent abstract predicates", 2014 [SB14]; da Rocha Pinto  ... 
doi:10.22028/d291-31946 fatcat:26uhhb6rzjdzxputraaa5itvzu