Affiliations: [a] Dept. of Information Engineering and Mathematics, Università di Siena, Siena, Italy. moreno.falaschi@unisi.it | [b] Dipartimento di Informatica - Scienza e Ingegneria, Università di Bologna, Bologna, Italy. maurizio.gabbrielli@unibo.it | [c] ECT - Escola de Ciências e Tecnologia, Universidade Federal do Rio Grande do Norte, Natal, Brazil. carlos.olarte@gmail.com | [d] INRIA and LIX, École Polytechnique, Palaiseau, France. catuscia@lix.polytechnique.fr
Correspondence:
[*]
Address for correspondence: Dipartimento di Ingegneria dell’Informazione e Scienze Matematiche, via Roma 56, 53100 Siena, Italy
Abstract: Concurrent Constraint Programming (CCP) is a declarative model for concurrency where agents interact by telling and asking constraints (pieces of information) in a shared store. Some previous works have developed (approximated) declarative debuggers for CCP languages. However, the task of debugging concurrent programs remains difficult. In this paper we define a dynamic slicer for CCP (and other language variants) and we show it to be a useful companion tool for the existing debugging techniques. We start with a partial computation (a trace) that shows the presence of bugs. Often, the quantity of information in such a trace is overwhelming, and the user gets easily lost, since she cannot focus on the sources of the bugs. Our slicer allows for marking part of the state of the computation and assists the user to eliminate most of the redundant information in order to highlight the errors. We show that this technique can be tailored to several variants of CCP, such as the timed language ntcc, linear CCP (an extension of CCPbased on linear logic where constraints can be consumed) and some extensions of CCP dealing with epistemic and spatial information. We also develop a prototypical implementation freely available for making experiments.
Keywords: Concurrent Constraint Programming, Program slicing, Debugging
