Title: Memory reuse for CHR
Authors: Sneyers, Jon ×
Schrijvers, Tom
Demoen, Bart #
Issue Date: 2006
Publisher: Springer-verlag berlin
Series Title: Logic Programming, 22nd International Conference, ICLP 2006, Proceedings vol:4079 pages:72-86
Conference: Twenty Second International Conference on Logic Programming location:Seattle, Washington, USA date:August 17-20, 2006
Abstract: Two Constraint Handling Rules compiler optimizations that drastically reduce the memory footprint of CHR programs are introduced. The reduction is the result of reusing suspension terms, the internal CHR constraint representation, and avoiding the overhead of constraint removal followed by insertion. The optimizations are defined formally and their correctness is proved. Both optimizations were implemented in the K.U.Leuven CHR system. Significant memory savings and speedups were measured on classical and well-known benchmarks.
ISBN: 3-540-36635-0
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
42187.pdf Published 272KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science