Pages that link to "Item:Q470040"

The following pages link to Towards formally specifying and verifying transactional memory (Q470040):

Displaying 19 items.

• Correctness of concurrent executions of closed nested transactions in transactional memory systems (Q391262) (← links)
• Verification of STM on relaxed memory models (Q453508) (← links)
• Towards formally specifying and verifying transactional memory (Q470040) (← links)
• Proving opacity of transactional memory with early release (Q902713) (← links)
• Formal verification of a C-like memory model and its uses for verifying program transformations (Q945054) (← links)
• Formal stystems specification. The RPC-memory specification case study (Q1126523) (← links)
• Mechanized proofs of opacity: a comparison of two techniques (Q1673658) (← links)
• On the correctness problem for serializability (Q2119957) (← links)
• Last-use opacity: a strong safety property for transactional memory with prerelease support (Q2146873) (← links)
• Non-interference and local correctness in transactional memory (Q2357153) (← links)
• Model checking transactional memories (Q2377134) (← links)
• Formalization and correctness of a concurrent linear hash structure algorithm using nested transactions and I/O automata (Q2734633) (← links)
• Proving Isolation Properties for Software Transactional Memory (Q3000572) (← links)
• Characterizing Transactional Memory Consistency Conditions Using Observational Refinement (Q3177890) (← links)
• Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory (Q5041273) (← links)
• (Q5101340) (← links)
• Verifying Opacity of a Transactional Mutex Lock (Q5206950) (← links)
• Checking opacity and durable opacity with FDR (Q6045053) (← links)
• A verified durable transactional mutex lock for persistent x86-TSO (Q6661756) (← links)