Abstract Concurrent Constraint Programming (CCP) has been used over the last two
decades as an elegant and expressive model for concurrent systems. It models systems of …

Abstract Service Level Agreements are a key issue in Service Oriented Computing. SLA
contracts specify client requirements and service guarantees, with emphasis on Quality of …

The framework of psi-calculi extends the pi-calculus with nominal datatypes for data
structures and for logical assertions and conditions. These can be transmitted between …

Service-oriented computing, an emerging paradigm for distributed computing based on the
use of services, is calling for the development of tools and techniques to build safe and …

The notion of constraint system (cs) is central to declarative formalisms from concurrency
theory such as process calculi for concurrent constraint programming (ccp). Constraint …

The concurrent constraint pi-calculus (cc-pi-calculus) has been introduced as a model for
concluding Service Level Agreements. The cc-pi calculus combines the synchronous …

We enrich spatial constraint systems with operators to specify information and processes
moving from a space to another. We shall refer to these news structures as spatial constraint …

The tcc model is a formalism for reactive concurrent constraint programming. In this paper
we propose a model of temporal concurrent constraint programming which adds to tcc the …

The ntcc process calculus is a timed concurrent constraint programming (ccp) model
equipped with a first-order linear-temporal logic (LTL) for expressing process specifications …

We present a unified framework for the declarative analysis of structured communications.
By relying on a (timed) concurrent constraint programming language, we show that in …