Universal Timed Concurrent Constraint Programming - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Universal Timed Concurrent Constraint Programming


In this doctoral work we aim at developing a rich timed con- current 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.
Fichier principal
Vignette du fichier
iclp07DC.pdf (53.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00201066 , version 1 (22-12-2007)



Carlos Olarte, Catuscia Palamidessi, Frank D. Valencia. Universal Timed Concurrent Constraint Programming. 23rd International Conference in Logic Programming (ICLP'07), Sep 2007, Porto, Portugal. pp.464-465, ⟨10.1007/978-3-540-74610-2_47⟩. ⟨inria-00201066⟩
140 View
81 Download



Gmail Facebook Twitter LinkedIn More