Understanding memory management in Prolog systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2237, Issue , 2001, Pages 11-26

  Castro, Luís Fernando ^a   Santos Costa, Vítor ^b  

^a STONY BROOK UNIVERSITY   (United States)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; REFUSE COLLECTION;

GARBAGE COLLECTION; GARBAGE COLLECTORS; INTERMEDIATE STRUCTURES; MEMORY MANAGEMENT; MEMORY PERFORMANCE; NOVEL TECHNIQUES; TAIL RECURSIVE; UNDERLYING SYSTEMS;

LOGIC PROGRAMMING;

EID: 84856187683     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45635-x_9     Document Type: Conference Paper

References (17)

1. J. Andersson, S. Andersson, K. Boortz, M. Carlsson, H. Nilsson, T. Sjoland, and J. Widen. SICStus Prolog User’s Manual. Technical report, SICS, November 1997. SICS Technical Report T93-01.
2. 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.
3. K. Appleby, M. Carlsson, S. Haridi, and D. Sahlin. Garbage collection for Prolog based on WAM. Communications of the ACM, 31(6):719–741, 1988.
4. Y. C. Chung, S.-M. Moon, K. Ebcioglu, and D. Sahlin. Reducing sweep time for a nearly empty heap. In Symposium on Principles of Programming Languages (POPL’00), pages 378–389, 2000.
5. B. Demoen. Early reset and reference counting improve variable shunting in the wam. TechnicalRep ort CW Report 298, Katholieke Universiteit Leuven, 2000.
6. 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–1254. Springer Verlag, 2000.
7. B. Demoen and K. F. Sagonas. Heap Garbage Collection in XSB: Practice and Experience. In PADL, number 1753, pages 93–108, January 2000.
8. 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’99, March 1999.
9. R. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons, July 1996. Reprinted February 1997.
10. D. Sahlin. Making garbage collection independent of the amount of garbage. Research Report SICS/R–87/87008, SICS, 1987.
11. D. Sahlin and M. Carlsson. Variable shunting for the WAM. TR R91-07, SICS, Apr. 1991.
12. The XSB Group. The XSB programmer’s manual, Version 2.3.
13. E. Tick. Memory Performance of Prolog Architectures. Kluwer Academic Publishers, Boston, 1988.
14. H. Touati and A. Despain. An empiricalstudy of the Warren Abstract Machine. In Fifth ICLP, pages 114–124, San Francisco, August - September 1987. IEEE, Computer Society Press.
15. van Noord. FSA utilities: A toolbox to manipulate finite-state automata. In WIA: International Workshop on Implementing Automata, LNCS. Springer-Verlag, 1997.
16. D. H. D. Warren. Applied Logic—Its Use and Implementation as a Programming Tool. PhD thesis, Edinburgh University, 1977.
17. D. H. D. Warren. An abstract Prolog instruction set. Technical Report 309, SRI, 1983.