Testing Shared Memories

DOI10.1137/S0097539794279614MaRDI QIDQ4376172zbMATH OpenFDO

Authors Phillip B. Gibbons, Ephraim Korach

Publication date 10 February 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539794279614

zbMATH Keywords

linearizabilitymultiprocessorsNP-completenesssequential consistencyshared memorytesting

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 2102714
• Automatable verification of sequential consistency
• On the definition of sequential consistency
• Boosting Sequential Consistency Checking Using Saturation
• The complexity of weak consistency

Cited in

(31)

• On the definition of sequential consistency
• Analyzing linearizability violations in the presence of read-modify-write operations
• Automatable verification of sequential consistency
• On the complexity of linearizability
• Concurrent correctness in vector space
• Efficient test \& set constructions for faulty shared memory
• Sequentialization using timestamps
• Multiwriter consistency conditions for shared memory registers
• Deciding Robustness against Total Store Ordering
• A unified theory of shared memory consistency
• Implied Set Closure and Its Application to Memory Consistency Verification
• scientific article; zbMATH DE number 193538 (Why is no real title available?)
• A Correctness Condition for High-Performance Multiprocessors
• Implementing sequentially consistent programs on processor consistent platforms
• Remarks on memory consistency description
• Computing k-atomicity in polynomial time
• scientific article; zbMATH DE number 1863176 (Why is no real title available?)
• scientific article; zbMATH DE number 2102714 (Why is no real title available?)
• Checking linearizability of concurrent priority queues
• On the Complexity of Bounded Context Switching.
• Multi-writer consistency conditions for shared memory objects
• Fine-grained complexity of safety verification
• Gradual consistency checking
• Quantifiability: a concurrent correctness condition modeled in vector space
• Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability
• Boosting Sequential Consistency Checking Using Saturation
• Verification of the release-acquire semantics
• Asynchronous wait-free runtime verification and enforcement of linearizability
• The complexity of weak consistency
• Stateless model checking under a reads-value-from equivalence
• Checking the correctness of memories

This page was built for publication: Testing Shared Memories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376172)