Affiliations: Dipartimento di Matematica e Informatica, University of Perugia, Via Vanvitelli 1, Perugia, Italy | Instituto di Informatica e Telematica (CNR), Via Moruzzi 1, Pisa, Italy. [email protected], [email protected] | EPI Contraintes, INRIA - Rocquencourt, Domaine de Voluceau BP 105, Le Chesnay, France | Dipartimento di Matematica e Informatica, Università di Perugia, Via Vanvitelli 1, Perugia, Italy. [email protected], [email protected]
Note: [] This work was carried out during the second author's tenure of the ERCIM “Alain Bensoussan” Fellowship Programme. This Programme is supported by the Marie Curie Co-funding of Regional, National and International Programmes (COFUND) of the European Commission. Address for correspondence: Dipartimento di Matematica e Informatica, Università di Perugia, Via Vanvitelli 1, Perugia, Italy
Abstract: We present a fine-grained security model to enforce the access control on the shared constraint store in Concurrent Constraint Programming (CCP) languages. We show the model for a non-monotonic version of Soft CCP (SCCP), that is an extension of CCP where the constraints have a preference level associated with them. Crisp constraints can be modeled in the same framework as well. In the considered non-monotonic soft version (NmSCCP), it is also possible to remove constraints from the store. The language can be used for coordinating agents on a common store of information that represents the set of shared resources. In such scenarios, it is clearly important to enforce the integrity and confidentiality rights on the resources, in order, for instance, to hide part of the information to some agents, or to prevent an agent to consume too many resources. Finally, we present a bisimulation relation to check equivalence between two programs written in this language.
