Skip to Main content Skip to Navigation
New interface
Conference papers

Slicing Concurrent Constraint Programs

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 we show it to be a useful companion tool for the existing debugging techniques. Our technique starts by considering 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 timed variants of CCP. We also develop a prototypical implementation freely available for making experiments.
Complete list of metadata
Contributor : Catuscia Palamidessi Connect in order to contact the contributor
Submitted on : Thursday, December 22, 2016 - 11:41:59 AM
Last modification on : Friday, November 18, 2022 - 9:28:25 AM

Links full text


  • HAL Id : hal-01421407, version 1
  • ARXIV : 1608.05252


Moreno Falaschi, Maurizio Gabbrielli, Carlos Olarte, Catuscia Palamidessi. Slicing Concurrent Constraint Programs. Pre-proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), 2016, Edinburgh, United Kingdom. ⟨hal-01421407⟩



Record views