{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:42:10Z","timestamp":1725486130987},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429357"},{"type":"electronic","value":"9783540456353"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45635-x_9","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T01:27:34Z","timestamp":1181179654000},"page":"11-26","source":"Crossref","is-referenced-by-count":5,"title":["Understanding Memory Management in Prolog Systems"],"prefix":"10.1007","author":[{"given":"Lu\u00eds Fernando","family":"Castro","sequence":"first","affiliation":[]},{"given":"V\u00edtor Santos","family":"Costa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,13]]},"reference":[{"key":"9_CR1","unstructured":"J. Andersson, S. Andersson, K. Boortz, M. Carlsson, H. Nilsson, T. Sjoland, and J. Wid\u00e9n. SICStus Prolog User\u2019s Manual. Technical report, SICS, November 1997. SICS Technical Rep ort T93-01."},{"key":"9_CR2","unstructured":"N. Angelopoulos and J. Cussens. Markov chain monte carlo using tree-based priors on modelstructure. In Proceedings of the 17th Annual Conference on Uncertainty in AI (UAI), Seattle, USA, 2001."},{"issue":"6","key":"9_CR3","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1145\/62959.62968","volume":"31","author":"K. Appleby","year":"1988","unstructured":"K. Appleby, M. Carlsson, S. Haridi, and D. Sahlin. Garbage collection for Prolog based on WAM. Communications of the ACM, 31(6):719\u2013741, 1988.","journal-title":"Communications of the ACM"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Y. C. Chung, S.-M. Moon, K. Ebcio\u011flu, and D. Sahlin. Reducing sweep time for a nearly empty heap. In Symposium on Principles of Programming Languages (POPL\u201900), pages 378\u2013389, 2000.","DOI":"10.1145\/325694.325744"},{"key":"9_CR5","unstructured":"B. Demoen. Early reset and reference counting improve variable shunting in the wam. Technical Report CW Report 298, Katholieke Universiteit Leuven, 2000."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"B. Demoen and P.-L. Nguyen. So many WAM variations, so little time. In Computational Logic 2000, number 1861 in Lecture Notes in Artificial Intelligence, pages 1240\u20131254. Springer Verlag, 2000.","DOI":"10.1007\/3-540-44957-4_83"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"B. Demoen and K. F. Sagonas. Heap Garbage Collection in XSB: Practice and Experience. In PADL, number 1753, pages 93\u2013108, January 2000.","DOI":"10.1007\/3-540-46584-7_7"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Y. Dong, X. Du, Y. Ramakrishnan, C. Ramakrishnan, I. Ramakrishnan, S. A. Smolka, O. Sokolsky, E. W. Stark, and D. S. Warren. Fighting livelock in the i-Protocol: A comparative study of verification tools. In TACAS\u201999, March 1999.","DOI":"10.1007\/3-540-49059-0_6"},{"key":"9_CR9","unstructured":"R. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons, July 1996. Reprinted February 1997."},{"key":"9_CR10","unstructured":"D. Sahlin. Making garbage collection independent of the amount of garbage. Research Report SICS\/R-87\/87008, SICS, 1987."},{"key":"9_CR11","unstructured":"D. Sahlin and M. Carlsson. Variable shunting for the WAM. TR R91-07, SICS, Apr. 1991."},{"key":"9_CR12","volume-title":"Memory Performance of Prolog Architectures","author":"E. Tick","year":"1988","unstructured":"E. Tick. Memory Performance of Prolog Architectures. Kluwer Academic Publishers, Boston, 1988."},{"key":"9_CR13","unstructured":"H. Touati and A. Despain. An empiricalstudy of the Warren Abstract Machine. In Fifth ICLP, pages 114\u2013124, San Francisco, August-September 1987. IEEE, Computer Society Press."},{"key":"9_CR14","series-title":"Lect Notes Comput Sci","volume-title":"WIA: International Workshop on Implementing Automata","author":"Noord van","year":"1997","unstructured":"van Noord. FSA utilities: A toolbox to manipulate finite-state automata. In WIA: International Workshop on Implementing Automata, LNCS. Springer-Verlag, 1997."},{"key":"9_CR15","unstructured":"D. H. D. Warren. Applied Logic-Its Use and Implementation as a Programming Tool. PhD thesis, Edinburgh University, 1977."},{"key":"9_CR16","unstructured":"D. H. D. Warren. An abstract Prolog instruction set. Technical Report 309, SRI, 1983."}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45635-X_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:41:39Z","timestamp":1556480499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45635-X_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429357","9783540456353"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45635-x_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}