Model checking transactional memories (Q2377134): 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: Checkfence / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077571050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-checking of correctness conditions for concurrent objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about networks with many identical finite state processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanical Verification of Transactional Memories with Non-transactional Memory Accesses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal serializability of iterated transactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness and Nondeterminism in Model Checking Transactional Memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software Transactional Memory on Relaxed Memory Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a theory of transactional contention managers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized wait-free concurrent objects (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The serializability of concurrent database updates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software transactional memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of looping and converse is elementarily decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichains: A New Algorithm for Checking Universality of Finite Automata / rank
 
Normal rank

Latest revision as of 14:49, 6 July 2024

scientific article
Language Label Description Also known as
English
Model checking transactional memories
scientific article

    Statements

    Model checking transactional memories (English)
    0 references
    0 references
    0 references
    0 references
    28 June 2013
    0 references
    0 references
    transactional memories
    0 references
    model checking
    0 references
    0 references