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

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: UNITY / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.scico.2008.09.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973894849 / 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

Latest revision as of 02:31, 29 June 2024

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

    Statements

    A general technique for proving lock-freedom (English)
    0 references
    0 references
    0 references
    19 February 2009
    0 references
    0 references
    lock-free programs
    0 references
    concurrency
    0 references
    verification
    0 references
    temporal logic
    0 references
    0 references
    0 references
    0 references
    0 references