Pages that link to "Item:Q2377134"
From MaRDI portal
The following pages link to Model checking transactional memories (Q2377134):
Displaying 13 items.
- Towards formally specifying and verifying transactional memory (Q470040) (← links)
- Deadlock and starvation free reentrant readers-writers: a case study combining model checking with theorem proving (Q617922) (← links)
- An analytic framework for performance modeling of software transactional memory (Q1018877) (← links)
- Mechanized proofs of opacity: a comparison of two techniques (Q1673658) (← links)
- On the correctness problem for serializability (Q2119957) (← links)
- Checking robustness between weak transactional consistency models (Q2233450) (← links)
- Formal verification of mobile robot protocols (Q2359768) (← links)
- Transactions for software model checking (Q2845505) (← links)
- Perspectives on Transactional Memory (Q3184661) (← links)
- Completeness and Nondeterminism in Model Checking Transactional Memories (Q3541009) (← links)
- The PCL Theorem (Q4625668) (← links)
- Verifying Opacity of a Transactional Mutex Lock (Q5206950) (← links)
- Checking opacity and durable opacity with FDR (Q6045053) (← links)