Using parametric set constraints for locating errors in CLP programs

Simple item page
dc.creatorDrabent, W.
dc.creatorMaluszynski, J.
dc.creatorPietrzak, P.
dc.date2002-02-11
dc.date.accessioned2026-07-07T03:18:06Z
dc.date.available2026-07-07T03:18:06Z
dc.descriptionThis paper introduces a framework of parametric descriptive directional types for constraint logic programming (CLP). It proposes a method for locating type errors in CLP programs and presents a prototype debugging tool. The main technique used is checking correctness of programs w.r.t. type specifications. The approach is based on a generalization of known methods for proving correctness of logic programs to the case of parametric specifications. Set-constraint techniques are used for formulating and checking verification conditions for (parametric) polymorphic type specifications. The specifications are expressed in a parametric extension of the formalism of term grammars. The soundness of the method is proved and the prototype debugging tool supporting the proposed approach is illustrated on examples. The paper is a substantial extension of the previous work by the same authors concerning monomorphic directional types.
dc.description64 pages, To appear in Theory and Practice of Logic Programming
dc.identifierhttps://arxiv.org/abs/cs/0202010
dc.identifierhttp://arxiv.org/abs/cs/0202010
dc.identifierTheory and Practice of Logic Programming, Vol 2(4&5), 2002, pp 549-611.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30983
dc.subjectProgramming Languages
dc.subjectD1.6; D2.5; F3.1
dc.titleUsing parametric set constraints for locating errors in CLP programs
dc.typetext

Files

Collections

arXiv