CGCExplorer: A Semi-Automated Search Procedure for Provably Correct Concurrent Collectors Martin T. Vechev Cambridge University Eran Yahav

First Page		Document Content
Date: 2011-10-04 10:24:18 Concurrency control Applied mathematics Garbage collection Linearizability Algorithm Mutator method Reference counting Lock Time complexity Computing Theoretical computer science Memory management		CGCExplorer: A Semi-Automated Search Procedure for Provably Correct Concurrent Collectors Martin T. Vechev Cambridge University Eran Yahav Add to Reading List Source URL: www.srl.inf.ethz.ch Download Document from Source Website File Size: 329,00 KB Share Document on Facebook

	An Evaluation of Distributed Concurrency Control Rachael Harding Dana Van Aken MIT CSAIL DocID: 1vdK1 - View Document
	Reference Capabilities for Concurrency Control Elias Castegren, Tobias Wrigstad ECOOP’16 sa DocID: 1tHRG - View Document
	Reference Capabilities for Concurrency Control Same code template safe for different use cases DocID: 1tFnO - View Document
	High Volume Transaction Processing Without Concurrency Control, Two Phase Commit, SQL or C++ Arthur Whitney Dennis Shasha Stevan Apter DocID: 1ti9e - View Document
	Engineering Tripos Part IIA THIRD YEAR Paper 3F6: Software Engineering and Design Relational Databases and Concurrency Control DocID: 1t3YU - View Document