Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Special Issue on the 26th International Symposium on Logic-Based Program Synthesis and Transformation: LOPSTR 2016
Guest editors: Manuel Hermenegildo, Pedro López-García, Alberto Pettorossi and Maurizio Proietti
Article type: Research Article
Authors: Falaschi, Morenoa; * | Gabbrielli, Mauriziob | Olarte, Carlosc | Palamidessi, Catusciad
Affiliations: [a] Dept. of Information Engineering and Mathematics, Università di Siena, Siena, Italy. [email protected] | [b] Dipartimento di Informatica - Scienza e Ingegneria, Università di Bologna, Bologna, Italy. [email protected] | [c] ECT - Escola de Ciências e Tecnologia, Universidade Federal do Rio Grande do Norte, Natal, Brazil. [email protected] | [d] INRIA and LIX, École Polytechnique, Palaiseau, France. [email protected]
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
DOI: 10.3233/FI-2020-1992
Journal: Fundamenta Informaticae, vol. 177, no. 3-4, pp. 331-357, 2020
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]