T. Schrijvers, M. G. de la Banda, and B. Demoen. Trailing analysis for HAL. In International Conference on Logic Programming, volume 2401 of LNCS, pages 38--53. Springer-Verlag, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Combining an Improvement to PARMA Trailing with Trailing.. - Schrijvers, Demoen (2002) (2 citations) Self-citation (Schrijvers Demoen) (Correct)
....the required trail stack size. It is presented in Section 2. On top of this improved trailing scheme for HAL Mercury we have implemented an analysis that detects when trailings can be avoided. This analysis is similar to the one we have previously implemented for the classic PARMA trailing scheme [13], but takes into account the particular properties of the improved trailing scheme. Section 3 explains the analysis which attempts to avoid trailing in the improved scheme. Results of both the improved scheme and the improved scheme in combination with the analysis are presented in Section 4. ....
....trailing of one or more involved variables. This analysis information then can be used to replace those particular unifications with more efficient variants so that both execution time and trail stack usage improve. The trailing analysis heavily depends on the details of the trailing scheme. In [13] we have presented a trailing analysis for the classic PARMA trailing scheme. In comparison to that scheme it will become clear that because of its stack trail economy the improved trailing scheme gives rise to less opportunities for trailing elimination for further stack trail savings. 3.1 ....
[Article contains additional citation context not shown here]
T. Schrijvers, M. Garca de la Banda, and B. Demoen. Trailing Analysis for HAL. In P. J. Stuckey, editor, Proceedings of the Eighteenth International Conference on Logic Programming, pages 37--51, Copenhagen, Denmark, July 29--Aug. 1 2002. Springer Verlag.
Combining an improvement to PARMA trailing with analysis in HAL - Schrijvers (2002) Self-citation (Schrijvers) (Correct)
....the required trail stack size. It is presented in Section 2. On top of this improved trailing scheme for HALMercury we have implemented an analysis that detects when trailings can be avoided. This analysis is similar to the one we have previously implemented for the classic PARMA trailing scheme [12], but also di ers from it in an important aspect. Section 3 explains the analysis which attempts to avoid trailing in the improved scheme. Results of both the improved scheme and the improved scheme in combination with the analysis are presented in Section 4. Finally, Section 5 discusses related ....
....any trailing of one or more involved variables. This analysis information then can be used to replace those particular uni cations with more ecient variants so that both execution time and trail stack usage improve. The trailing analysis heavily depends on the details of the trailing scheme. In [12] we have presented a trailing analysis for the classic PARMA trailing scheme in HAL. In comparison to that scheme, it will become clear that because of its stack trail economy the improved trailing scheme gives rise to less opportunities for trailing elimination for further stack trail savings. ....
[Article contains additional citation context not shown here]
T. Schrijvers, M. G. de la Banda, and B. Demoen. Trailing Analysis for HAL. In International Conference on Logic Programming, 2002.
Implementation Strategies for Single Assignment Variables - Drejhammar, Schulte (2004) (Correct)
No context found.
T. Schrijvers, M. G. de la Banda, and B. Demoen. Trailing analysis for HAL. In International Conference on Logic Programming, volume 2401 of LNCS, pages 38--53. Springer-Verlag, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC