Pages that link to "Item:Q5326292"
From MaRDI portal
The following pages link to Verifying Concurrent Programs against Sequential Specifications (Q5326292):
Displaying 10 items.
- TSO-to-TSO linearizability is undecidable (Q1629746) (← links)
- On reducing linearizability to state reachability (Q1641012) (← links)
- Decidability and complexity for quiescent consistency and its variations (Q1680503) (← links)
- On the correctness problem for serializability (Q2119957) (← links)
- On the complexity of linearizability (Q2218465) (← links)
- Concurrent correctness in vector space (Q2234067) (← links)
- Decomposable Relaxation for Concurrent Data Structures (Q2971134) (← links)
- Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency (Q2988639) (← links)
- (Q5090915) (← links)
- (Q5111629) (← links)
