Concurrent Constraint Programming (CCP) is 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. 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 timed variants of CCP. We also develop a prototypical implementation freely available for making experiments.
Scheda prodotto non validato
Scheda prodotto in fase di analisi da parte dello staff di validazione
|Titolo:||Slicing Concurrent Constraint Programs|
|Citazione:||Falaschi, M., Gabbrielli, M., Olarte, C., & Palamidessi, C. (2017). Slicing Concurrent Constraint Programs. In Logic-Based Program Synthesis and Transformation. Berlin Heidelberg : Springer-Verlag.|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|
File in questo prodotto: