Filters








234,922 Hits in 3.3 sec

Resources, Concurrency, and Local Reasoning [chapter]

Peter W. O'Hearn
2004 Lecture Notes in Computer Science  
Based on such restrictions Hoare described proof rules for shared-variable concurrency that were beautifully modular [4]: one could reason locally about a process, and simple syntactic checks ensured that  ...  There is thus a mismatch, between the intuitive basis of concurrent programming with resources, where separation remains a vital design idea, and formal techniques for reasoning about such programs, where  ...  Based on such restrictions Hoare described proof rules for shared-variable concurrency that were beautifully modular [4] : one could reason locally about a process, and simple syntactic checks ensured  ... 
doi:10.1007/978-3-540-24725-8_1 fatcat:dxr6juaumvfkdbdrbluhkp7xgm

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.  ...  Generally, though, we believe that resource-oriented logics offer considerable promise for modular reasoning about concurrent programs, as we hope to have demonstrated in the form of proofs and specifications  ...  We are in agreement with many of the remarks Jones makes, particularly on the challenges facing the development of truly modular specification and reasoning methods for concurrent processes, even if we  ... 
doi:10.1016/j.tcs.2006.12.035 fatcat:22abkvix6fbwxgcgsr67t4wxiu

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  ...  a process, and simple syntactic checks ensured that no other process could tamper with its state in a way that invalidated the local reasoning.  ... 
doi:10.1007/978-3-540-28644-8_4 fatcat:yygafqcp25bgdbshyylxowh35i

Algebra, Logic, Locality, Concurrency [chapter]

Peter W. O'Hearn
2011 Lecture Notes in Computer Science  
others -on models and logics for concurrent processes [10, 6, 5] . The approach we are taking abstracts from syntax or particular models.  ...  Message passing and shared memory process interaction, and strong (interleaving) and weak (partial order) approaches to sequencing, are accomodated as different models of the same core axioms.  ...  Perhaps surprisingly, the algebra is seen to contain a general account of locality, which strictly generalizes the modular reasoning of Concurrent Separation Logic [5] .  ... 
doi:10.1007/978-3-642-25379-9_2 fatcat:5t7wapdh6jhgzcskoplmzuc7me

Automated Verification of CountDownLatch [article]

Wei-Ngan Chin, Ton Chanh Le, Shengchao Qin
2019 arXiv   pre-print
Our framework is built on top of two existing mechanisms, concurrent abstract predicate and fictional separation logic, with some enhancements such as borrowed heap and thread local abstraction.  ...  Its usage allows one or more threads to exchange resources and synchronize by waiting for some tasks to be completed before others can proceed.  ...  Acknowledgement: We gratefully acknowledge Duy-Khanh Le who highlighted this CountDownLatch problem to us and helped with our initial formulation based on flow-aware predicates.  ... 
arXiv:1908.09758v1 fatcat:y4e6jiw3g5diblnhmxjf35qrh4

Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems [chapter]

Morten Krogh-Jespersen, Amin Timany, Marit Edna Ohlenbusch, Simon Oddershede Gregersen, Lars Birkedal
2020 Lecture Notes in Computer Science  
In this paper we present Aneris, a novel framework based on separation logic supporting modular, node-local reasoning about concurrent and distributed systems.  ...  The logic is higher-order, concurrent, with higherorder store and network sockets, and is fully mechanized in the Coq proof assistant.  ...  to concurrency through thread-local reasoning.  ... 
doi:10.1007/978-3-030-44914-8_13 fatcat:ledgihizhncsnltkcudmbxmne4

On Locality and the Exchange Law for Concurrent Processes [chapter]

C. A. R. Hoare, Akbar Hussain, Bernhard Möller, Peter W. O'Hearn, Rasmus Lerchedahl Petersen, Georg Struth
2011 Lecture Notes in Computer Science  
This paper studies algebraic models for concurrency, in light of recent work on Concurrent Kleene Algebra and Separation Logic.  ...  It establishes a strong connection between the Concurrency and Frame Rules of Separation Logic and a variant of the exchange law of Category Theory.  ...  Proposition 3.13 and Example 4.3 states that the Trace Model is a concurrent monoid, while the Resource Model is a locality bimonoid which is not a concurrent monoid.  ... 
doi:10.1007/978-3-642-23217-6_17 fatcat:jk7iielqfrcxzppozglnkpmcrq

Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency

Aaron Turon, Derek Dreyer, Lars Birkedal
2013 Proceedings of the 18th ACM SIGPLAN international conference on Functional programming - ICFP '13  
components, and granularity abstraction, a key technique for hiding the intricacies of fine-grained concurrent data structures from the clients of those data structures.  ...  Modular programming and modular verification go hand in hand, but most existing logics for concurrency ignore two crucial forms of modularity: higher-order functions, which are essential for building reusable  ...  Acknowledgments We would like to thank David Swasey for his careful reading of both the paper and its appendix. This work was partially funded by the EC FET project ADVENT.  ... 
doi:10.1145/2500365.2500600 dblp:conf/icfp/TuronDB13 fatcat:7xzlsn5qhjgljh3gt66xjq44oy

Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency

Aaron Turon, Derek Dreyer, Lars Birkedal
2013 SIGPLAN notices  
components, and granularity abstraction, a key technique for hiding the intricacies of fine-grained concurrent data structures from the clients of those data structures.  ...  Modular programming and modular verification go hand in hand, but most existing logics for concurrency ignore two crucial forms of modularity: higher-order functions, which are essential for building reusable  ...  Acknowledgments We would like to thank David Swasey for his careful reading of both the paper and its appendix. This work was partially funded by the EC FET project ADVENT.  ... 
doi:10.1145/2544174.2500600 fatcat:v2zxoi27gjgvzjqavp6tg24rfm

Impredicative Concurrent Abstract Predicates [chapter]

Kasper Svendsen, Lars Birkedal
2014 Lecture Notes in Computer Science  
We present impredicative concurrent abstract predicates -iCAP -a program logic for modular reasoning about concurrent, higherorder, reentrant, imperative code.  ...  We demonstrate the utility of impredicative protocols through a series of examples, including the specification and verification, in the logic, of a spin-lock, a reentrant event loop, and a concurrent  ...  reasoning about higher-order functions and shared mutable data structures and, very recently, also concurrency [23] .  ... 
doi:10.1007/978-3-642-54833-8_9 fatcat:dypg5jxw6nek5girya4ylhqkte

Modular reasoning about concurrent higher-order imperative programs

Lars Birkedal
2014 Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '14  
. the program structure; and (2) specifications and proofs can concentrate on the resources that a program actually acts upon, instead of its entire state.  ...  Separation logic allows specifications and proofs to concentrate on the resources that a program actually acts upon, instead of its entire state.  ... 
doi:10.1145/2535838.2537849 dblp:conf/popl/Birkedal14 fatcat:hjgtj3khsfg2zk766px2gexvaq

Consistent Process Execution in Peer-to-Peer Information Systems [chapter]

Klaus Haller, Heiko Schuldt
2003 Lecture Notes in Computer Science  
They invoke services provided by resources, which are responsible for logging and conflict detection.  ...  This process execution has to be reliable, i.e., guarantees for correct concurrent and fault tolerant execution are vital.  ...  So each R can reason about its local conflicts. The union of all local conflicts of R comprises -due to the independence of the resources -all the conflicts of the system.  ... 
doi:10.1007/3-540-45017-3_21 fatcat:2tocopz425f75cdzig77hcct4q

Encapsulating concurrency with Early-Reply

Scott M. Pike
2002 Companion of the 17th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '02  
The prime motivation for Early-Reply, then, is to improve performance factors such as response time and resource utilization.  ...  In particular, we reformulate Early-Reply under local proof obligations that encapsulate concurrency as a (temporal) unit of information hiding.  ...  A common drawback of Early-Reply in concurrent languages, however, is that logical concurrency can bleed into the reasoning system and thereby complicate the proof obligations required to establish program  ... 
doi:10.1145/985072.985082 dblp:conf/oopsla/Pike02 fatcat:ee4opiqwv5gydmk35cldokdwwe

CoLoSL: Concurrent Local Subjective Logic [chapter]

Azalea Raad, Jules Villard, Philippa Gardner
2015 Lecture Notes in Computer Science  
Subjective views may arbitrarily overlap with each other, and expand and contract depending on the resource required by the thread.  ...  This flexibility gives rise to small specifications and, hence, more compositional reasoning for concurrent programs.  ...  This research was funded by EPSRC grants K008528/1 and H008373/2.  ... 
doi:10.1007/978-3-662-46669-8_29 fatcat:ytlhxsuri5e25fgb6emcbqhylq

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.  ...  Recent efforts to combine Separation Logic with Rely-Guarantee reasoning have made it possible to hide thread-local resources, but the shared resources still need to be globally known and specified.  ...  Thanks to Viktor Vafeiadis, Zhong Shao, and anonymous referees for their suggestions and comments on earlier versions of this paper.  ... 
doi:10.1145/1480881.1480922 dblp:conf/popl/Feng09 fatcat:yrlvw57pxneipn747perjy7xly
« Previous Showing results 1 — 15 out of 234,922 results