HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Universal Timed Concurrent Constraint Programming

Carlos Olarte 1 Catuscia Palamidessi 1 Frank Valencia 1
1 COMETE - Concurrency, Mobility and Transactions
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Contributor : Catuscia Palamidessi Connect in order to contact the contributor
Submitted on : Saturday, December 22, 2007 - 11:40:29 PM
Last modification on : Thursday, January 20, 2022 - 4:12:24 PM
Long-term archiving on: : Thursday, September 27, 2012 - 1:21:10 PM


Files produced by the author(s)




Carlos Olarte, Catuscia Palamidessi, Frank 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⟩



Record views


Files downloads