SnapQueue: Lock-Free Queue with Constant Time Snapshots Aleksandar Prokopec École Polytechnique Fédérale de Lausanne, Switzerland Abstract

First Page		Document Content
Date: 2016-08-13 13:11:44 Abstract data types Computing Data structures Software engineering Computer science Queue Double-ended queue Amortized analysis Persistent data structure Rope Conc-Tree list		SnapQueue: Lock-Free Queue with Constant Time Snapshots Aleksandar Prokopec École Polytechnique Fédérale de Lausanne, Switzerland Abstract Add to Reading List Source URL: axel22.github.io Download Document from Source Website File Size: 319,14 KB Share Document on Facebook

	Semantics of Interaction Samson Abramsky Abstract The “classical” paradigm for denotational semantics models data types as domains, i.e. structured sets of some kind, and programs as (suitable) functions between doma DocID: 1xToC - View Document
	Model Checking Recursive Programs with Numeric Data Types Matthew Hague and Anthony Widjaja Lin Oxford University Computing Laboratory Abstract. Pushdown systems (PDS) naturally model sequential recursive programs. Nume DocID: 1vlSe - View Document
	Model Checking Recursive Programs with Numeric Data Types Matthew Hague and Anthony Widjaja Lin Oxford University Computing Laboratory Abstract. Pushdown systems (PDS) naturally model sequential recursive programs. Nume DocID: 1tTLw - View Document
	Abstract Data Types in Object-Capability Systems James Noble1 , Sophia Drossopoulou2 , Mark S. Miller3 , Toby Murray4 , Alex Potanin1 1 Victoria University Wellington, 2 Imperial College London, 3 Google Inc, 4 Universit DocID: 1sZOy - View Document
	Java Collection Framework Version March 2009 Framework  Interfaces (ADT, Abstract Data Types) DocID: 1shdx - View Document