28532 articles – 22057 references  [version française]

hal-00690604, version 1

## Towards a Generic Trace for Rule Based Constraint Reasoning

Armando Gonçalves Da Silva Junior 1, Pierre Deransart (, ) 2, Luis-Carlos Menezes () a1, Marcos-Aurélio Almeida Da Silva () b3, Jacques Robin () 4

N° RR-7939 (2012)

Abstract: CHR is a very versatile programming language that allows programmers to declaratively specify constraint solvers. An important part of the development of such solvers is in their testing and debugging phases. Current CHR implementations support those phases by offering tracing facilities with limited information. In this report, we propose a new trace for CHR which contains enough information to analyze any aspects of \CHRv\ execution at some useful abstract level, common to several implementations. %a large family of rule based solvers. This approach is based on the idea of generic trace. Such a trace is formally defined as an extension of the $\omega_r^\lor$ semantics of CHR. We show that it can be derived form the SWI Prolog CHR trace.

• a –  Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional (Cinvestav)
• b –  Université Pierre et Marie Curie - Paris 6
• 1:  Centro de Informatica UFPE (CIn)
• 2:  CONTRAINTES (INRIA Rocquencourt)
• INRIA
• 3:  Laboratoire de Physique de la Matière Condensée (LPMC)
• CNRS : UMR7602 – Université Pierre et Marie Curie [UPMC] - Paris VI
• 4:  Thales Research and Technology [Palaiseau] (TRT)
• THALES
• Domain : Computer Science/Programming Languages
• Keywords : Trace – CHR – CHR$^\vee$ – Tracer – Generic Trace – Analysis Tool – Observational Semantics – Debugging – Programming Environment – Constraint Programming – Validation
• Internal note : RR-7939

• hal-00690604, version 1
• oai:hal.inria.fr:hal-00690604
• From:
• Submitted on: Tuesday, 24 April 2012 01:09:55
• Updated on: Tuesday, 24 April 2012 08:57:17