Filters








139 Hits in 3.1 sec

Proving Linearizability of Multiset with Local Proof Obligations

Oleg Travkin, Heike Wehrheim, Gerhard Schellhorn
2013 Electronic Communications of the EASST  
It is interesting for two reasons: First, one of its operations inserts two elements non-atomically.  ...  Linearizability is a key correctness criterion for concurrent software.  ...  Acknowledgements: We would like to thank Bogdan Tofan for all his support. He helped us with the specifications in KIV and gave us important advice, when we carried out our proofs.  ... 
doi:10.14279/tuj.eceasst.53.795 dblp:journals/eceasst/TravkinWS12 fatcat:zk5osi6bz5d4jffdyiddpd7fzm

Shape-Value Abstraction for Verifying Linearizability [chapter]

Viktor Vafeiadis
2008 Lecture Notes in Computer Science  
We prove that these algorithms are linearizable, namely equivalent (modulo termination) to their sequential counterparts.  ...  This paper presents a novel abstraction for heap-allocated data structures that keeps track of both their shape and their contents.  ...  We would like to thank Alan Mycroft, Hongseok Yang and the anonymous referees for providing helpful feedback on earlier drafts of this work.  ... 
doi:10.1007/978-3-540-93900-9_27 fatcat:33fevparpvcztnhgack3jilfbq

Runtime Refinement Checking of Concurrent Data Structures

Serdar Tasiran, Shaz Qadeer
2005 Electronical Notes in Theoretical Computer Science  
We present a runtime technique for checking that a concurrent implementation of a data structure conforms to a high-level executable specification with atomic operations.  ...  The technique consists of two phases. In the first phase, the implementation code is instrumented in order to record information about its execution into a log.  ...  We also thank Minwen Ji and Andrej Bogdanov for collaboration on the verification of the Scan file system.  ... 
doi:10.1016/j.entcs.2004.01.028 fatcat:wwimli4yqvdsredchiabgzi45u

Speculative linearizability

Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
2012 Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12  
The outcome are even more complex protocols, for which it is no longer tractable to prove their correctness.  ...  We expect our framework to enable, for the first time, scalable specifications and mechanical proofs of speculative implementations of linearizable objects.  ...  Such an approach has proved empirically successful in recent work [8] ; the present paper provides the underlying theoretical foundations for such approaches.  ... 
doi:10.1145/2254064.2254072 dblp:conf/pldi/GuerraouiKL12 fatcat:pxnnnyq2erg2xi4d4mnfxd7w7e

Simplifying Linearizability Proofs with Reduction and Abstraction [chapter]

Tayfun Elmas, Shaz Qadeer, Ali Sezgin, Omer Subasi, Serdar Tasiran
2010 Lecture Notes in Computer Science  
Linearizability is proved by transforming an implementation into its specification within this proof system.  ...  The typical proof of linearizability establishes an abstraction map from the concurrent program to a sequential specification, and identifies the commit points of operations.  ...  Theorems 2 and 3 provide two options for proving linearizability of P 1 to the intended specification from I, represented by an atomic program P n .  ... 
doi:10.1007/978-3-642-12002-2_25 fatcat:s3jagpofzvgqdhmmi4drnbury4

Speculative linearizability

Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
2012 SIGPLAN notices  
The outcome are even more complex protocols, for which it is no longer tractable to prove their correctness.  ...  We expect our framework to enable, for the first time, scalable specifications and mechanical proofs of speculative implementations of linearizable objects.  ...  Such an approach has proved empirically successful in recent work [8] ; the present paper provides the underlying theoretical foundations for such approaches.  ... 
doi:10.1145/2345156.2254072 fatcat:z53t77ftt5a6zfr4radg7grk4q

Specifying and checking semantic atomicity for multithreaded programs

Jacob Burnim, George Necula, Koushik Sen
2011 SIGARCH Computer Architecture News  
We found that using bridge predicates allowed us to specify the natural and intended atomic behavior of a wider range of programs than did previous approaches.  ...  A fundamental correctness property for such programs is atomicity-a block of code in a program is atomic if, for any parallel execution of the program, there is an execution with the same overall program  ...  Acknowledgments We would like to thank Tayfun Elmas, Benjamin Lipshitz, our shepherd Margo Seltzer, and our anonymous reviewers for their valuable comments on this paper.  ... 
doi:10.1145/1961295.1950377 fatcat:23lcugaxwvh5vhlbhvcjcdalvi

Specifying and checking semantic atomicity for multithreaded programs

Jacob Burnim, George Necula, Koushik Sen
2011 Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems - ASPLOS '11  
We found that using bridge predicates allowed us to specify the natural and intended atomic behavior of a wider range of programs than did previous approaches.  ...  A fundamental correctness property for such programs is atomicity-a block of code in a program is atomic if, for any parallel execution of the program, there is an execution with the same overall program  ...  Acknowledgments We would like to thank Tayfun Elmas, Benjamin Lipshitz, our shepherd Margo Seltzer, and our anonymous reviewers for their valuable comments on this paper.  ... 
doi:10.1145/1950365.1950377 dblp:conf/asplos/BurnimNS11 fatcat:wy2ipr35xnf43puce666zzoxdu

Specifying and checking semantic atomicity for multithreaded programs

Jacob Burnim, George Necula, Koushik Sen
2011 SIGPLAN notices  
We found that using bridge predicates allowed us to specify the natural and intended atomic behavior of a wider range of programs than did previous approaches.  ...  A fundamental correctness property for such programs is atomicity-a block of code in a program is atomic if, for any parallel execution of the program, there is an execution with the same overall program  ...  Acknowledgments We would like to thank Tayfun Elmas, Benjamin Lipshitz, our shepherd Margo Seltzer, and our anonymous reviewers for their valuable comments on this paper.  ... 
doi:10.1145/1961296.1950377 fatcat:43nhuhaddbdqhjzyqiw662xqcm

Specifying and checking semantic atomicity for multithreaded programs

Jacob Burnim, George Necula, Koushik Sen
2012 SIGPLAN notices  
We found that using bridge predicates allowed us to specify the natural and intended atomic behavior of a wider range of programs than did previous approaches.  ...  A fundamental correctness property for such programs is atomicity-a block of code in a program is atomic if, for any parallel execution of the program, there is an execution with the same overall program  ...  Acknowledgments We would like to thank Tayfun Elmas, Benjamin Lipshitz, our shepherd Margo Seltzer, and our anonymous reviewers for their valuable comments on this paper.  ... 
doi:10.1145/2248487.1950377 fatcat:36gw5viwyfdsfgbozx3oe5ym6q

Sound, complete, and tractable linearizability monitoring for concurrent collections

Michael Emmi, Constantin Enea
2017 Proceedings of the ACM on Programming Languages  
As far as we know, ours is the first sound, complete, and tractable algorithm for monitoring linearizability for types beyond single-value registers.  ...  In this work we identify a class of collection abstract data types which admit polynomial-time linearizability monitors.  ...  We leverage this concept in Section 4 to form a notion of soundness of our approach to linearizability checking of individual histories.  ... 
doi:10.1145/3158113 dblp:journals/pacmpl/EmmiE18 fatcat:quxm3qgdgrh3zmqxeam77d5tgm

Verifying Linearisability

Brijesh Dongol, John Derrick
2015 ACM Computing Surveys  
In this paper, we compare the major of methods for verifying linearizability, describe the main contribution of each method, and compare their advantages and limitations.  ...  The sophisticated nature of concurrent objects means that linearizability is difficult to judge, and hence, over the years, numerous techniques for verifying linearizability have been developed using a  ...  We also thank Lindsay Groves for his comments on an earlier version.  ... 
doi:10.1145/2796550 fatcat:q7a5zsxqrzawbd5mhl4lxmy2vi

Mindicators: A Scalable Approach to Quiescence

Yujie Liu, Victor Luchangco, Michael Spear
2013 2013 IEEE 33rd International Conference on Distributed Computing Systems  
We introduce linearizable and relaxed mindicator implementations, both of which are lock-free.  ...  We introduce the Mindicator, a new shared object that is optimized for querying the minimum value of a set of values proposed by several processes.  ...  To prove this invariant inductively, we need to strengthen it to cover the sets of processes contending for nodes associated with p.  ... 
doi:10.1109/icdcs.2013.39 dblp:conf/icdcs/LiuLS13 fatcat:bkrx5kglyzd5vah6ay66u35wne

Verifying linearizability: A comparative survey [article]

Brijesh Dongol, John Derrick
2015 arXiv   pre-print
However, as the underlying framework, nomenclature and terminology for each method differs, it has become difficult for practitioners to judge the differences between each approach, and hence, judge the  ...  Over the years numerous techniques for verifying linearizability have been developed, using a variety of formal foundations such as refinement, shape analysis, reduction, etc.  ...  We focus on linearizability alone, and to this end, an overview of different construction-based approaches to proving linearizability is given in Section 3.7.  ... 
arXiv:1410.6268v2 fatcat:uwsc3vwyovhxtlylkxudnrakne

Verifying Concurrent Programs against Sequential Specifications [chapter]

Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza
2013 Lecture Notes in Computer Science  
Similarly, our undecidability proof for linearizability suggests an incomplete detection algorithm which limits the number of "barriers" bisecting non-overlapping operations.  ...  For instance, we show that every violation to conflict serializability is captured by a conflict cycle whose length is bounded independently from the number of concurrent operations.  ...  Since most known linearizable systems are also static-linearizable, combining static-linearizability with bounded-barrier exploration ought to provide a promising approach for proving either correctness  ... 
doi:10.1007/978-3-642-37036-6_17 fatcat:mhdhz2q7afemtaktxuu3ge2754
« Previous Showing results 1 — 15 out of 139 results