Demand transformation analysis for concurrent constraint programs

Demand Transformation Analysis for Concurrent Constraint Programs

This paper presents a demand transformation analysis that maps a predi-cate's output demands to its input demands. This backward dataaow analysis for concurrent constraint programs is constructed in the framework of abstract interpretation. In the context of stream parallelism, this analysis identiies an amount of input data for which predicate execution can safely wait without danger of introd...

Slicing Concurrent Constraint Programs

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 sh...

Transformation and Analysis of (Constraint) Logic Programs

Abstract diagnosis for timed concurrent constraint programs

diagnosis for timed concurrent constraint programs! MARCO COMINI and LAURA TITOLO Dipartimento di Matematica e Informatica University of Udine Via delle Scienze, 206 33100 Udine, Italy (e-mail: {marco.comini,laura.titolo}@uniud.it)

Timed Soft Concurrent Constraint Programs

We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock. Action prefixing is then considered as the syntactic marker which distinguishes a time instant from the next one. Supported by soft constraints instead of crisp ...