Model checking transactional memory John O’Leary Intel Bratin Saha Intel

First Page		Document Content
Date: 2011-09-30 00:00:00 Data management Data Software transactional memory Transactional memory Model checking Linearizability Parallel computing Promela Lock Concurrency control Transaction processing Computing		Model checking transactional memory John O’Leary Intel Bratin Saha Intel Add to Reading List Source URL: www.markrtuttle.com Download Document from Source Website File Size: 47,95 KB Share Document on Facebook

	A Generic Logic for Proving Linearizability (Extended Version) Artem Khyzha1 , Alexey Gotsman1 , and Matthew Parkinson2 1 2 DocID: 1tJ91 - View Document
	A Generic Logic for Proving Linearizability Artem Khyzha1 , Alexey Gotsman1 , and Matthew Parkinson2 1 2 IMDEA Software Institute DocID: 1tHCL - View Document
	Proving Linearizability Using Partial Orders Artem Khyzha1 , Mike Dodds2 , Alexey Gotsman1 , and Matthew Parkinson3 1 IMDEA Software Institute, Madrid, Spain 2 DocID: 1tBi5 - View Document
	From Linearizability to Eventual Consistency Radha Jagadeesan and James Riely DePaul University Abstract We address the fundamental issue of interfaces that arises in the context of cloud computing; namely, what does it DocID: 1t8PT - View Document
	Local Linearizability Ana Sokolova joint work with: Andreas Haas Andreas Holzer DocID: 1t00x - View Document