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 …

The tcc model is a formalism for reactive concurrent constraint programming. We present a
model of temporal concurrent constraint programming which adds to tcc the capability of …

We introduce spatial and epistemic process calculi for reasoning about spatial information
and knowledge distributed among the agents of a system. We introduce domain-theoretical …

We introduce a simple compositional proof system for proving (partial) correctness of
concurrent constraint programs (CCP). The proof system is based on a denotational …

Concurrent constraint programming (ccp) is a well-established model for concurrency.
Bisimilarity is one of the central reasoning techniques in concurrency. The standard …

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 …

Abstract Constraint Logic Programming (CLP) is one of the most successful branches of
Logic Programming; it attracts the interest of theoreticians and practitioners, and it is …

Timed Concurrent Constraint Programming (tcc) is a declarative model for concurrency
offering a logic for specifying reactive systems, ie, systems that continuously interact with the …

Previous results on proving confluence for Constraint Handling Rules are extended in two
ways in order to allow a larger and more realistic class of CHR programs to be considered …

Abstract Concurrent Constraint Programming (CCP) is a simple and powerful model of
concurrency where processes interact by telling and asking constraints into a global store of …