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.

Falaschi, M., Gabbrielli, M., Olarte, C., & Palamidessi, C. (2017). Slicing concurrent constraint programs. In Logic-Based Program Synthesis and Transformation (pp.76-93). Berlin Heidelberg : Springer-Verlag [10.1007/978-3-319-63139-4_5].

Slicing concurrent constraint programs

FALASCHI, MORENO;
2017

Abstract

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.
978-3-319-63139-4
978-3-319-63138-7
Falaschi, M., Gabbrielli, M., Olarte, C., & Palamidessi, C. (2017). Slicing concurrent constraint programs. In Logic-Based Program Synthesis and Transformation (pp.76-93). Berlin Heidelberg : Springer-Verlag [10.1007/978-3-319-63139-4_5].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11365/1007437