A general technique for proving lock-freedom (Q1001810): Difference between revisions

@@ Property / cites work @@
+Q4692502
@@ Property / cites work: Q4692502 / rank @@
+Normal rank
@@ Property / cites work @@
+Verifying Lock-Freedom Using Well-Founded Orders
@@ Property / cites work: Verifying Lock-Freedom Using Well-Founded Orders / rank @@
+Normal rank
@@ Property / cites work @@
+Trace-based derivation of a scalable lock-free stack algorithm
+Normal rank
@@ Property / cites work @@
+Proving Linearizability Via Non-atomic Refinement
@@ Property / cites work: Proving Linearizability Via Non-atomic Refinement / rank @@
+Normal rank
@@ Property / cites work @@
+Q4692630
@@ Property / cites work: Q4692630 / rank @@
+Normal rank
@@ Property / cites work @@
+Formal Techniques for Networked and Distributed Systems – FORTE 2004
+Normal rank
@@ Property / cites work @@
+Verification of temporal properties
@@ Property / cites work: Verification of temporal properties / rank @@
+Normal rank
@@ Property / cites work @@
+A general lock-free algorithm using compare-and-swap
+Normal rank
@@ Property / cites work @@
+Q4846258
@@ Property / cites work: Q4846258 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002642
@@ Property / cites work: Q4002642 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
+Normal rank
@@ Property / cites work @@
+Q2738289
@@ Property / cites work: Q2738289 / rank @@
+Normal rank
@@ Property / cites work @@
+Practical implementations of non-blocking synchronization primitives
+Normal rank