Trailing analysis for HAL

Tom Schrijvers; Maria Jose Garcia De La Banda; Bart Demoen

doi:10.1007/3-540-45619-8_4

Trailing analysis for HAL

Tom Schrijvers, Maria Jose Garcia De La Banda, Bart Demoen

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

Abstract

The HAL language includes a Herbrand constraint solver which uses Taylor’s PARMA scheme rather than the standard WAM representation. This allows HAL to generate more efficient Mercury code. Unfortunately, PARMA’s variable representation requires value trailing with a trail stack consumption about twice as large as for the WAM. We present a trailing analysis aimed at determining which Herbrand variables do not need to be trailed. The accuracy of the analysis comes from HAL’s semi-optional determinism and mode declarations. The analysis has been partially integrated in the HAL compiler and benchmark programs show good speed-up.

Original language	English
Title of host publication	Logic Programming
Subtitle of host publication	18th International Conference, ICLP 2002 Copenhagen, Denmark, July 29 – August 1, 2002 Proceedings
Editors	Peter J. Stuckey
Place of Publication	Berlin Germany
Publisher	Springer
Pages	38-53
Number of pages	16
ISBN (Print)	3540439307
DOIs	https://doi.org/10.1007/3-540-45619-8_4
Publication status	Published - 2002
Event	International Conference on Logic Programming 2002 - Copenhagen, Denmark Duration: 29 Jul 2002 → 1 Aug 2002 Conference number: 18th https://link.springer.com/book/10.1007/3-540-45619-8 (Proceedings)

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	2401
ISSN (Print)	0302-9743

Conference

Conference	International Conference on Logic Programming 2002
Abbreviated title	ICLP 2002
Country/Territory	Denmark
City	Copenhagen
Period	29/07/02 → 1/08/02
Internet address	https://link.springer.com/book/10.1007/3-540-45619-8 (Proceedings)

Access to Document

10.1007/3-540-45619-8_4

Cite this

@inproceedings{8db3366868b34c9e8f64dbf141022fb2,

title = "Trailing analysis for HAL",

abstract = "The HAL language includes a Herbrand constraint solver which uses Taylor{\textquoteright}s PARMA scheme rather than the standard WAM representation. This allows HAL to generate more efficient Mercury code. Unfortunately, PARMA{\textquoteright}s variable representation requires value trailing with a trail stack consumption about twice as large as for the WAM. We present a trailing analysis aimed at determining which Herbrand variables do not need to be trailed. The accuracy of the analysis comes from HAL{\textquoteright}s semi-optional determinism and mode declarations. The analysis has been partially integrated in the HAL compiler and benchmark programs show good speed-up.",

author = "Tom Schrijvers and {Garcia De La Banda}, {Maria Jose} and Bart Demoen",

year = "2002",

doi = "10.1007/3-540-45619-8_4",

language = "English",

isbn = "3540439307",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "38--53",

editor = "Stuckey, {Peter J.}",

booktitle = "Logic Programming",

note = "International Conference on Logic Programming 2002, ICLP 2002 ; Conference date: 29-07-2002 Through 01-08-2002",

url = "https://link.springer.com/book/10.1007/3-540-45619-8",

}

Schrijvers, T, Garcia De La Banda, MJ & Demoen, B 2002, Trailing analysis for HAL. in PJ Stuckey (ed.), Logic Programming: 18th International Conference, ICLP 2002 Copenhagen, Denmark, July 29 – August 1, 2002 Proceedings. Lecture Notes in Computer Science, vol. 2401, Springer, Berlin Germany, pp. 38-53, International Conference on Logic Programming 2002, Copenhagen, Denmark, 29/07/02. https://doi.org/10.1007/3-540-45619-8_4

Trailing analysis for HAL. / Schrijvers, Tom; Garcia De La Banda, Maria Jose; Demoen, Bart.

Logic Programming: 18th International Conference, ICLP 2002 Copenhagen, Denmark, July 29 – August 1, 2002 Proceedings. ed. / Peter J. Stuckey. Berlin Germany : Springer, 2002. p. 38-53 (Lecture Notes in Computer Science; Vol. 2401).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Trailing analysis for HAL

AU - Schrijvers, Tom

AU - Garcia De La Banda, Maria Jose

AU - Demoen, Bart

N1 - Conference code: 18th

PY - 2002

Y1 - 2002

N2 - The HAL language includes a Herbrand constraint solver which uses Taylor’s PARMA scheme rather than the standard WAM representation. This allows HAL to generate more efficient Mercury code. Unfortunately, PARMA’s variable representation requires value trailing with a trail stack consumption about twice as large as for the WAM. We present a trailing analysis aimed at determining which Herbrand variables do not need to be trailed. The accuracy of the analysis comes from HAL’s semi-optional determinism and mode declarations. The analysis has been partially integrated in the HAL compiler and benchmark programs show good speed-up.

AB - The HAL language includes a Herbrand constraint solver which uses Taylor’s PARMA scheme rather than the standard WAM representation. This allows HAL to generate more efficient Mercury code. Unfortunately, PARMA’s variable representation requires value trailing with a trail stack consumption about twice as large as for the WAM. We present a trailing analysis aimed at determining which Herbrand variables do not need to be trailed. The accuracy of the analysis comes from HAL’s semi-optional determinism and mode declarations. The analysis has been partially integrated in the HAL compiler and benchmark programs show good speed-up.

U2 - 10.1007/3-540-45619-8_4

DO - 10.1007/3-540-45619-8_4

M3 - Conference Paper

SN - 3540439307

T3 - Lecture Notes in Computer Science

SP - 38

EP - 53

BT - Logic Programming

A2 - Stuckey, Peter J.

PB - Springer

CY - Berlin Germany

T2 - International Conference on Logic Programming 2002

Y2 - 29 July 2002 through 1 August 2002

ER -