We study a timed concurrent constraint language, called tccp, which is obtained by a natural
timed interpretation of the usual ccp constructs: action-prefixing is interpreted as the next …

Many static analyses for declarative programming/database languages use Boolean
functions to express dependencies among variables or argument positions. Examples …

We investigate the semantics of concurrent constraint programming and of various
sublanguages, with particular emphasis on nondeterminism and infinite behavior. The aim is …

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

We introduce the notion of confluence for Constraint Handling Rules (CHR), a powerful
language for writing constraint solvers. With CHR one simplifies and solves constraints by …

Thanks to Kim Marriott for inviting me to visit the Monash University of Melbourne. The month
I have spent there was of great inspiration. I have been fortunate to meet some exceptionally …

The subject of groundness analysis for (constraint) logic programs has been widely studied,
and interesting domains have been proposed. Pos has been recognized as the most …

We consider a timed extension of concurrent constraint programming, called tccp. For this
language we define a denotational model which is fully abstract wrt the standard notion of …

Because of synchronization based on blocking ask, some of the most important techniques
for data flow analysis of (sequential) constraint logic programs (clp) are no longer applicable …

Confluence is an important and desirable property as it allows the program to be understood
by considering any desired scheduling rule, rather than having to consider all possible …