Filters








20,941 Hits in 4.4 sec

A simple proof system for lock-free concurrency

Luís Caires, Carla Ferreira, António Ravara
unpublished
We present a simple yet illustrative example of a proof for a concurrent data structure.  ...  We propose a Hoare-Separation-style system to prove correct lock-free algorithms implemented in this language.  ...  Recently several works have addressed the design of proof systems for modular verification of concurrent programs, both lock-based (e.g. [O'H04] ) and lock-free (e.g.  ... 
doi:10.29007/n3nk fatcat:6wy4t4q4m5bxfbhzkc7vwpygn4

Formal Verification of Lock-Free Algorithms

Gerhard Schellhorn, Simon Baumler
2009 2009 Ninth International Conference on Application of Concurrency to System Design  
The paper gives a simple example to demonstrate the central correctness criteria of linearizability (a safety property) and lock-freeness (a liveness property) for lock-free algorithms.  ...  Such lock-free algorithms are less vulnerable to the typical problems of concurrent algorithms: deadlocks, livelocks and priority inversion.  ...  Among these, lock-free algorithms are a recently developed class of algorithms for concurrent access to data structures.  ... 
doi:10.1109/acsd.2009.10 dblp:conf/acsd/SchellhornB09 fatcat:2ou44pua5fhe7ovdrqpruere2u

Adding Concurrency to a Sequential Refinement Tower [chapter]

Gerhard Schellhorn, Stefan Bodenmüller, Jörg Pfähler, Wolfgang Reif
2020 Lecture Notes in Computer Science  
We have developed such a refinement tower for the Flashix file system earlier, from which we generate executable (C and Scala) Code.  ...  The question we answer in this paper, is how to add concurrency based on locks to such a refinement tower, without breaking the initial modular structure.  ...  Individual rely-guarantee proofs for single threads can be combined to a rely-guarantee property of a concurrent system.  ... 
doi:10.1007/978-3-030-48077-6_2 fatcat:i3wgmgt52zacxoocbxijgroory

Efficient & Lock-Free Modified Skip List in Concurrent Environment

Ranjeet Kaur, Pushpa Rani Suri
2015 International Journal of Computer Applications Technology and Research  
That is suitable for both fully concurrent (large multi-processor) systems as well as pre-emptive (multi-process) systems.  ...  Non-blocking algorithms avoid blocking, and are either lock-free or wait-free.  ...  Conclusion We introduced a concurrent modified Skiplist using a remarkably simple algorithm in a lock free environment.  ... 
doi:10.7753/ijcatr0403.1007 fatcat:vgzqmzrvknb2jdjiu2xc7hxpnm

Concurrent manipulation of binary search trees

H. T. Kung, Philip L. Lehman
1980 ACM Transactions on Database Systems  
The systems presented can support any number of concurrent processes which perform searching, insertion, deletion, and rotation (reorganization) on the tree, but allow any process to lock only a constant  ...  The concurrent manipulation of a binary search tree is considered in this paper.  ...  We offer verifications of our systems, and include a sketch of the correctness proof for the concurrent garbage collector.  ... 
doi:10.1145/320613.320619 fatcat:be6zalh3u5fqxmxoa626e4zcmq

A scalable lock-free stack algorithm

Danny Hendler, Nir Shavit, Lena Yerushalmi
2004 Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04  
It is based on the following simple observation: that a single elimination array used as a backoff scheme for a simple lock-free stack is lock-free, linearizable, and scalable.  ...  The literature also describes a simple lock-free linearizable stack algorithm that works at low loads but does not scale as the load increases.  ...  The elimination backoff stack is based on the following simple observation: that a single elimination array [17] , used as a backoff scheme for a lock-free stack [22] , is both lock-free and linearizable  ... 
doi:10.1145/1007912.1007944 dblp:conf/spaa/HendlerSY04 fatcat:wldpi6vgqjenjm3iakls3idtna

A scalable lock-free stack algorithm

Danny Hendler, Nir Shavit, Lena Yerushalmi
2010 Journal of Parallel and Distributed Computing  
It is based on the following simple observation: that a single elimination array used as a backoff scheme for a simple lock-free stack is lock-free, linearizable, and scalable.  ...  The literature also describes a simple lock-free linearizable stack algorithm that works at low loads but does not scale as the load increases.  ...  The elimination backoff stack is based on the following simple observation: that a single elimination array [17] , used as a backoff scheme for a lock-free stack [22] , is both lock-free and linearizable  ... 
doi:10.1016/j.jpdc.2009.08.011 fatcat:w645sm7epjcfpnx43bjz5druse

Verifying concurrent, crash-safe systems with Perennial

Tej Chajed, Joseph Tassarotti, M. Frans Kaashoek, Nickolai Zeldovich
2019 Proceedings of the 27th ACM Symposium on Operating Systems Principles - SOSP '19  
In the replicated disk example, we use a lock for each address a to protect recovery leases for d 1 [a] → n and d 2 [a] → n , as well as ensure that their values agree when the lock is free.  ...  Our contributions are the following: • Perennial, a system for machine-checked proofs of concurrent crash-safe systems that uses versioning, leases, and helping to support crash-safety proofs on top of  ... 
doi:10.1145/3341301.3359632 dblp:conf/sosp/ChajedTKZ19 fatcat:wy6mqxzmwraxdngzxwitj6xuxa

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  
Its soundness has been verified using the Coq proof assistant. We demonstrate the usage of our framework through giving a safety proof of a simple program.  ...  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).  ...  proof, we provide machine-checkable proof for our framework.  ... 
doi:10.1109/tase.2009.36 dblp:conf/tase/FuZL09 fatcat:6ryxkvs3cfff7i3ooemnf5bz5e

Starling: Lightweight Concurrency Verification with Views [chapter]

Matt Windsor, Mike Dodds, Ben Simner, Matthew J. Parkinson
2017 Lecture Notes in Computer Science  
We propose Starling, a new lightweight logic and automated tool for concurrency verification.  ...  We have applied our approach to a range of concurrent algorithms, including Rust's atomic reference counter, the Linux ticketed lock, the CLH queue-lock, and a fine-grained list algorithm. 37 38 // Constraints  ...  Introduction Shared-memory concurrent algorithms are critical components of many systems, for example as locks, reference counters, work-queues, and garbage collectors [12] .  ... 
doi:10.1007/978-3-319-63387-9_27 fatcat:mcm7f74bbvbqdmovs2nytc2fza

Progress guarantee for parallel programs via bounded lock-freedom

Erez Petrank, Madanlal Musuvathi, Bjarne Steesngaard
2009 Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation - PLDI '09  
We use this formal definition to build a tool that checks if a concurrent program is bounded lock-free for a given bound.  ...  A composition theorem asserts that bounded lock-free algorithms running on bounded lock-free supporting systems retain bounded lock-freedom for the composed execution.  ...  Acknowledgement We thank Roy Friedman, Tim Harris, Maurice Herlihy, Victor Luchangco, Maged Michael, Mark Moir, Nir Shavit, and David Tarditi for many helpful discussions.  ... 
doi:10.1145/1542476.1542493 dblp:conf/pldi/PetrankMS09 fatcat:nffg4nxd3rdffbv3koscf5gaae

Progress guarantee for parallel programs via bounded lock-freedom

Erez Petrank, Madanlal Musuvathi, Bjarne Steesngaard
2009 SIGPLAN notices  
We use this formal definition to build a tool that checks if a concurrent program is bounded lock-free for a given bound.  ...  A composition theorem asserts that bounded lock-free algorithms running on bounded lock-free supporting systems retain bounded lock-freedom for the composed execution.  ...  Acknowledgement We thank Roy Friedman, Tim Harris, Maurice Herlihy, Victor Luchangco, Maged Michael, Mark Moir, Nir Shavit, and David Tarditi for many helpful discussions.  ... 
doi:10.1145/1543135.1542493 fatcat:h5x37k4hazbsbp6hosmed5f7ke

Efficient data race and deadlock prevention in concurrent object-oriented programs

Piotr Nienaltowski
2004 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications - OOPSLA '04  
It will take into consideration the proposed mechanisms and serve as a basis for further refinements of the model.  ...  The main goal of this PhD thesis is to propose and implement a methodology for the construction of programs based on the SCOOP model, and for modular reasoning about their correctness and liveness properties  ...  ( ) ( ) T S T S Eiffel p p ⇔ , , α α ( ) ( ) T sep T , , p α This results in a very simple but sufficiently expressive type system for SCOOP.  ... 
doi:10.1145/1028664.1028695 dblp:conf/oopsla/Nienaltowski04 fatcat:f5zmh3isibg75deaw33nncrcom

Verifying concurrent software using movers in CSPEC

Tej Chajed, M. Frans Kaashoek, Butler W. Lampson, Nickolai Zeldovich
2018 USENIX Symposium on Operating Systems Design and Implementation  
This paper introduces CSPEC, a framework for formal verification of concurrent software, which ensures that no corner cases are missed.  ...  To evaluate CSPEC, we implemented and proved the correctness of CMAIL, a simple concurrent Maildir-like mail server that speaks SMTP and POP3.  ...  Acknowledgments Thanks to Adam Chlipala, the PDOS research group, the anonymous reviewers, and our shepherd, Jon Howell, for improving this paper.  ... 
dblp:conf/osdi/ChajedKLZ18 fatcat:5yxlfnp26rakzdxsjtgvqd7uye

Quantitative Reasoning for Proving Lock-Freedom

Jan Hoffmann, Michael Marmar, Zhong Shao
2013 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science  
This article describes a novel quantitative proof technique for the modular and local verification of lock-freedom.  ...  Using a single formalism for verifying memory safety and lock-freedom allows a combined correctness proof that verifies both properties simultaneously.  ...  Thus the proof of the liveness property of being lock-free is reduced to the proof of a stronger safety property.  ... 
doi:10.1109/lics.2013.18 dblp:conf/lics/HoffmannMS13 fatcat:mm4jplyaavb3hccvi7nu3qydxe
« Previous Showing results 1 — 15 out of 20,941 results