Pages that link to "Item:Q2946743"

The following pages link to A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures (Q2946743):

Displayed 8 items.

• Mechanized proofs of opacity: a comparison of two techniques (Q1673658) ‎ (← links)
• Relating trace refinement and linearizability (Q1688548) ‎ (← links)
• Verifying correctness of persistent concurrent data structures: a sound and complete method (Q1982636) ‎ (← links)
• Proving Linearizability Using Partial Orders (Q2988662) ‎ (← links)
• Model Checking Simulation Rules for Linearizability (Q4571132) ‎ (← links)
• Verifying Opacity of a Transactional Mutex Lock (Q5206950) ‎ (← links)
• A Framework for Correctness Criteria on Weak Memory Models (Q5206951) ‎ (← links)
• Making Linearizability Compositional for Partially Ordered Executions (Q6104493) ‎ (← links)