Slicing Concurrent Constraint Programs

Moreno Falaschi 1 Maurizio Gabbrielli 2, 3 Carlos Olarte 4 Catuscia Palamidessi 5, 6
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
6 COMETE - Concurrency, Mobility and Transactions
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR7161
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.
Type de document :
Communication dans un congrès
Manuel V. Hermenegildo ; Pedro Lopez-Garcia. Pre-proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), 2016, Edinburgh, United Kingdom. 2016
Liste complète des métadonnées

https://hal.inria.fr/hal-01421407
Contributeur : Catuscia Palamidessi <>
Soumis le : jeudi 22 décembre 2016 - 11:41:59
Dernière modification le : jeudi 12 avril 2018 - 01:50:20

Lien texte intégral

Identifiants

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

Collections

Citation

Moreno Falaschi, Maurizio Gabbrielli, Carlos Olarte, Catuscia Palamidessi. Slicing Concurrent Constraint Programs. Manuel V. Hermenegildo ; Pedro Lopez-Garcia. Pre-proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), 2016, Edinburgh, United Kingdom. 2016. 〈hal-01421407〉

Partager

Métriques

Consultations de la notice

439