Finalization should not be based on reachability Hans-J. Boehm HP Labs (This benefited from discussions with Mike Spertus and others.)

First Page		Document Content
Date: 2014-02-06 19:37:32 Computer programming Data types Method Object-oriented programming Automatic memory management Finalizer Weak reference Destructor Keepalive Computing Software engineering Memory management		Finalization should not be based on reachability Hans-J. Boehm HP Labs (This benefited from discussions with Mike Spertus and others.) Add to Reading List Source URL: www.hboehm.info Download Document from Source Website File Size: 267,37 KB Share Document on Facebook

	Proc. European Conf. on Object-Oriented Programming, June, 2001, LNCS volConcurrent Cycle Collection in Reference Counted Systems David F. Bacon and V.T. Rajan IBM T.J. Watson Research Center DocID: 1rr1t - View Document
	University of London Imperial College London of Science, Technology and Medicine Department of Computing Soft Real-time Garbage Collection for Dynamic Dispatch Languages DocID: 1rlOP - View Document
	TECHNOLOGY WHITE PAPER Azul Pauseless Garbage Collection Providing continuous, DocID: 1qguI - View Document
	Learning Natural Language Inference with LSTM Shuohang Wang School of Information Systems Singapore Management University DocID: 1pttv - View Document
	Parallel Generational-Copying Garbage Collection with a Block-Structured Heap Simon Marlow Tim Harris DocID: 1oTWM - View Document