{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:12Z","timestamp":1725558912626},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243625"},{"type":"electronic","value":"9783540305576"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30557-6_12","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T17:53:17Z","timestamp":1278093197000},"page":"143-157","source":"Crossref","is-referenced-by-count":1,"title":["Improving Memory Usage in the BEAM"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Lopes","sequence":"first","affiliation":[]},{"given":"V\u00edtor Santos","family":"Costa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF03037316","volume":"16","author":"K.A.M. Ali","year":"1998","unstructured":"Ali, K.A.M.: A Simple Generational Real-Time Garbage Collection Scheme. New Generation Computing\u00a016(2), 201\u2013221 (1998)","journal-title":"New Generation Computing"},{"issue":"6","key":"12_CR2","first-page":"171","volume":"31","author":"K. Appleby","year":"1989","unstructured":"Appleby, K., Carlsson, M., Haridi, S., Sahlin, D.: Garbage collection for Prolog based on WAM. Communications of the ACM\u00a031(6), 171\u2013183 (1989)","journal-title":"Communications of the ACM"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-58402-1_8","volume-title":"A simple and efficient copying garbage collector for Prolog","author":"J. Bevemyr","year":"1994","unstructured":"Bevemyr, J., Lindgren, T.: PLILP 1994. LNCS, vol.\u00a0844, pp. 88\u2013101. Springer, Heidelberg (1994)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-45635-X_9","volume-title":"Logic Programming","author":"L.F. Castro","year":"2001","unstructured":"Castro, L.F., Santos Costa, V.: Understanding Memory Management in Prolog Systems. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, p. 11. Springer, Heidelberg (2001)"},{"key":"12_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1007\/3-540-44957-4_83","volume-title":"Computational Logic - CL 2000","author":"B. Demoen","year":"2000","unstructured":"Demoen, B., Nguyen, P.: So Many WAM Variations, So Little Time. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 1240\u20131254. Springer, Heidelberg (2000)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Detlefs, D., Dosser, A., Zorn, B.: Memory allocation costs in large C and C++ programs. Software, Practice and Experience\u00a024(6) (1994)","DOI":"10.1002\/spe.4380240602"},{"key":"12_CR7","unstructured":"Gupta, G., Warren, D.H.D.: An Interpreter for the Extended Andorra Model. Technical report, Dep. of Computer Science, University of Bristol (November 1991)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Maher, M.: Constraint Logic Programming: a Survey. The Journal of Logic Programming\u00a019\/20 (May\/July 1994)","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"12_CR9","unstructured":"Jones, R., Lins, R.: Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons, Chichester (1996) (reprinted February 1997)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Lopes, R.: An Implementation of the Extended Andorra Model. PhD thesis, Universidade do Porto (December 2001)","DOI":"10.1007\/3-540-45241-9_14"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/773039.773045","volume":"38","author":"R. Lopes","year":"2003","unstructured":"Lopes, R., Castro, L., Costa, V.: From Simulation to Pratice: Cache Performance Study of a Prolog Systems. ACM SIGPLAN Notices\u00a038(2), 56\u201364 (2003)","journal-title":"ACM SIGPLAN Notices"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-45241-9_14","volume-title":"Practical Aspects of Declarative Languages","author":"R. Lopes","year":"2001","unstructured":"Lopes, R., Costa, V.S., Silva, F.: A novel implementation of the extended Andorra model. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol.\u00a01990, pp. 199\u2013213. Springer, Heidelberg (2001)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-24599-5_28","volume-title":"Logic Programming","author":"R. Lopes","year":"2003","unstructured":"Lopes, R., Costa, V.S., Silva, F.: On deterministic computations in the extended andorra model. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 407\u2013421. Springer, Heidelberg (2003)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-24836-1_9","volume-title":"Practical Aspects of Declarative Languages","author":"R. Lopes","year":"2004","unstructured":"Lopes, R., Santos Costa, V., Silva, F.: Prunning in the extended andorra model. In: Jayaraman, B. (ed.) PADL 2004. LNCS, vol.\u00a03057, pp. 120\u2013134. Springer, Heidelberg (2004)"},{"key":"12_CR15","first-page":"291","volume-title":"Proceedings of the North American Conference on Logic Programming","author":"T. Ozawa","year":"1990","unstructured":"Ozawa, T., Hosoi, A., Hattori, A.: Generation Type Garbage Collection for Parallel Logic Languages. In: Proceedings of the North American Conference on Logic Programming, pp. 291\u2013305. MIT Press, Cambridge (1990)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/10704567_16","volume-title":"Principles and Practice of Declarative Programming","author":"V. Santos Costa","year":"1999","unstructured":"Santos Costa, V.: Optimising bytecode emulation for prolog. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, pp. 261\u2013267. Springer, Heidelberg (1999)"},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/72551.72555","volume":"21","author":"E. Shapiro","year":"1989","unstructured":"Shapiro, E.: The family of Concurrent Logic Programming Languages. ACM computing surveys\u00a021(3), 412\u2013510 (1989)","journal-title":"ACM computing surveys"},{"key":"12_CR18","unstructured":"Warren, D.H.D.: An Abstract Prolog Instruction Set. Technical Note 309, SRI International (1983)"},{"key":"12_CR19","unstructured":"Warren, D.H.D.: The Extended Andorra Model with Implicit Control. Presented at ICLP 1990 Workshop on Parallel Logic Programming, Eilat, Israel (June 1990)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30557-6_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:22:12Z","timestamp":1605759732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30557-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243625","9783540305576"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30557-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}