Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Abraham, Uri - Departments of Computer Science & Mathematics, Ben-Gurion University
Epilogue: Formal and informal correctness proofs
MODELS FOR CONCURRENCY Uri Abraham
On the Mutual-Exclusion Problem|a quest for minimal solutions.
A note on the Elusive Atomic Register Uri Abraham
On the limitation of the Global Time Assumption in Distributed Systems
On interprocess communication and the implementation of multi-writer atomic
What is a State of a System? (an outline) Uri Abraham
Self-Stabilizing `-Exclusion Uri Abraham Shlomi Dolev y Ted Herman z Irit Koll x
Multiwriter Atomic Registers and bounded timestamps
Two approaches to concurrency Uri Abraham
On system executions and states Uri Abraham
Bakery Algorithms Uri Abraham
Exercises in Style (Alpha Specifications) Uri Abraham and Tamar Pinhas
A proof of Bloom's two-writer protocol Uri Abraham
How to formally explain a (cache coherence) protocol
Exercises in Style (Alpha Specifications) Uri Abraham and Tamar Pinhas
Skewed Timestamps Uri Abraham
What is a State of a System? (an outline) Uri Abraham
| Acta Informatica manuscript No. * | (will be inserted by the editor) *
On system executions and states Uri Abraham
Lazy Caching for lazy readers Uri Abraham
THE ACHILLES PARADOX URI ABRAHAM
Concurrencey without global states: a case study Uri Abraham
