5 citations · 7 across the 13 of their papers we have counts for
13 papers
Linearizability Analysis of the Contention-Friendly Binary Search Tree
Uri Abraham, Avi Hayoun
We present a formal framework for proving the correctness of set implementations backed by binary-search-tree (BST) and linked lists, which are often difficult to prove correct usi…
On the ABK Conjecture, alpha-well Quasi Orders and Dress-Schiffels product
Uri Abraham, Robert Bonnet, Mirna Džamonja +1
The following is a 2008 conjecture of Abraham, Bonnet and Kubiś: [ABK Conjecture] Every well quasi order (wqo) is a countable union of better quasi orders (bqo). We obtain a partia…
The chain covering number of a poset with no infinite antichains
Uri Abraham, Maurice Pouzet
The chain covering number $\Cov(P)$ of a poset is the least number of chains needed to cover . For a cardinal , we give a list of posets of cardinality and covering numbe…
On the Lazy Set object
Uri Abraham
The aim of this article is to employ the Lazy Set algorithm as an example for a mathematical framework for proving the linearizability of distributed systems. The proof in this app…
Kishon's Poker Game
Uri Abraham
We present an approach for proving the correctness of distributed algorithms that obviate interleaving of processes' actions. The main part of the correctness proof is conducted at…
On the Mailbox Problem
Uri Abraham, Gal Amram
The Mailbox Problem was described and solved by Aguilera, Gafni, and Lamport in their 2010 DC paper with an algorithm that uses two flag registers that carry 14 values each. An int…