Universal timed concurrent constraint programming

  • Authors:

  • Carlos Olarte;Catuscia Palamidessi;Frank Valencia

  • Affiliations:

  • INRIA Futurs, LIX, École Polytechnique, France and Department of Computer Science, Javeriana University Cali, Colombia;INRIA Futurs, LIX, École Polytechnique, France;CNRS LIX, École Polytechnique, France

  • Venue:
  • ICLP'07 Proceedings of the 23rd international conference on Logic programming
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this doctoral work we aim at developing a rich timed concurrent constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concurrent Constraint (utcc) increases the expressiveness of tcc languages allowing infinite behaviour and mobility. We introduce a constructor of the form (abs x, c)P (Abstraction in P) that can be viewed as a dual operator of the hidden operator local x in P. i.e. the later can be viewed as an existential quantification on the variable x and the former as an universal quantification of x, executing P[t/x] for all t s.t. the current store entails c[t/x]. As a compelling application, we applied this calculus to verify security protocols.