Maria Chiara Meo

Learn More
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-time operator and the parallel execution of agents follows the scheduling policy of maximal parallelism. Additionally, tccp includes a simple primitive which allows one to(More)
Diagnosis Marco Comini a, Giorgio Levi a, Maria Chiara Meo b and Giuliana Vitiello c aDipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125 Pisa, Italy. bDipartimento di Matematica Pura ed Applicata, Università di L’Aquila, via Vetoio, località Coppito, 67010 L’Aquila, Italy. cDipartimento di Informatica ed Applicazioni, Università di(More)
In this paper we deene a new compilative version of constructive negation (intensional negation) in CLP and we prove its (non-ground) correctness and completeness wrt the 3-valued completion. We show that intensional negation is essentially equivalent to constructive negation and that it is indeed more eecient, as one would expect from the fact that it is a(More)
A temporal logic is presented for reasoning about the correctness of timed concurrent constraint programs. The logic is based on modalities which allow one to specify what a process produces as a reaction to what its environment inputs. These modalities provide an assumption/commitment style of specification which allows a sound and complete compositional(More)
We show how declarative diagnosis techniques can be extended to cope with verification of operational properties, such as computed answers, and of abstract properties, such as types and groundness dependencies. The extension is achieved by using a simple semantic framework, based on abstract interpretation. The resulting technique (abstract diagnosis) leads(More)