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

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.scico.2008.09.013 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4692502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying Lock-Freedom Using Well-Founded Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace-based derivation of a scalable lock-free stack algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Linearizability Via Non-atomic Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Techniques for Networked and Distributed Systems – FORTE 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of temporal properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general lock-free algorithm using compare-and-swap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2738289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical implementations of non-blocking synchronization primitives / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.SCICO.2008.09.013 / rank
 
Normal rank

Latest revision as of 12:17, 10 December 2024

scientific article
Language Label Description Also known as
English
A general technique for proving lock-freedom
scientific article

    Statements

    Identifiers