Universal timed concurrent constraint programming

In this doctoral work we aim at developing a rich timed concurrent constraint (tec) based language with strong ties to logic. The new calculus called Universal Timed Concurrent Constraint (utcc) increases the expressiveness of tec 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.