Verifying Visibility-Based Weak Consistency (Q5041095): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Dafny / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GRASShopper / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3022621909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of refinement mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integrated Specification and Verification Technique for Highly Concurrent Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison Under Abstraction for Verifying Linearizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reducing linearizability to state reachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving linearizability using forward simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Replicated data types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspect-oriented linearizability proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On abstraction and compositionality for weak-memory linearisability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local linearizability for concurrent container-type data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Verification of Practical Garbage Collectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative relaxation of concurrent data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iris from the ground up: A modular foundation for higher-order concurrent separation logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Linearizability Using Partial Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Owicki-Gries Reasoning for Weak Memory Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dafny: An Automatic Program Verifier for Functional Correctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward and backward simulations. I. Untimed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: E-matching for Fun and Profit / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2004 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying properties of parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shape-Value Abstraction for Verifying Linearizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: RGSep Action Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsc{Poling}: SMT aided linearizability proofs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:43, 30 July 2024

scientific article; zbMATH DE number 7600933
Language Label Description Also known as
English
Verifying Visibility-Based Weak Consistency
scientific article; zbMATH DE number 7600933

    Statements

    Verifying Visibility-Based Weak Consistency (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 October 2022
    0 references
    0 references
    0 references
    0 references
    0 references