Prototyping CLP(FD) Tracers: a Trace Model and an Experimental Validation Environment

Simple item page
dc.creatorLangevine, Ludovic
dc.creatorDeransart, Pierre
dc.creatorDucasse, Mireille
dc.creatorJahier, Erwan
dc.date2001-11-16
dc.date.accessioned2026-07-07T03:17:57Z
dc.date.available2026-07-07T03:17:57Z
dc.descriptionDeveloping and maintaining CLP programs requires visualization and explanation tools. However, existing tools are built in an ad hoc way. Therefore porting tools from one platform to another is very difficult. We have shown in previous work that, from a fine-grained execution trace, a number of interesting views about logic program executions could be generated by trace analysis. In this article, we propose a trace model for constraint solving by narrowing. This trace model is the first one proposed for CLP(FD) and does not pretend to be the ultimate one. We also propose an instrumented meta-interpreter in order to experiment with the model. Furthermore, we show that the proposed trace model contains the necessary information to build known and useful execution views. This work sets the basis for generic execution analysis of CLP(FD) programs.
dc.descriptionIn A. Kusalik (ed), Proceedings of the Eleventh International Workshop on Logic Programming Environments (WLPE'01), December 1, 2001, Paphos, Cyprus. cs.PL/0111042
dc.identifierhttps://arxiv.org/abs/cs/0111043
dc.identifierhttp://arxiv.org/abs/cs/0111043
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30921
dc.subjectProgramming Languages
dc.subjectSoftware Engineering
dc.subjectD.1.6; D.2.6; D.2.5; F.4.1
dc.titlePrototyping CLP(FD) Tracers: a Trace Model and an Experimental Validation Environment
dc.typetext

Files

Collections

arXiv