Proving linearizability with temporal logic (Q539223): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Comparison Under Abstraction for Verifying Linearizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing safety and liveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5291078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive verification of concurrent systems using symbolic execution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thread Quantification for Concurrent Shape Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2863833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Safety Checking for Fine-Grained Concurrency / 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: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Linearizability Via Non-atomic Refinement / 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: Lock-free parallel and concurrent garbage collection by mark\&sweep / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolving Algebras 1993: Lipari Guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinement verification of the lazy caching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scalable lock-free stack algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tentative steps toward a development method for interfering programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assumption/guarantee specifications in linear-time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shape-Value Abstraction for Verifying Linearizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Marriage of Rely/Guarantee and Separation Logic / rank
 
Normal rank

Revision as of 02:11, 4 July 2024

scientific article
Language Label Description Also known as
English
Proving linearizability with temporal logic
scientific article

    Statements

    Proving linearizability with temporal logic (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 May 2011
    0 references
    lock-free
    0 references
    linearizability
    0 references
    verification
    0 references
    temporal logic
    0 references
    compositional reasoning
    0 references
    rely-guarantee
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers