Universal Timed Concurrent Constraint Programming
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 xP. 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.
KeywordsOperational Semantic Security Protocol Linear Temporal Logic Dual Operator Denotational Semantic
- 1.Boreale, M.: Symbolic trace analysis of cryptographic protocols. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, Springer, Heidelberg (2001)Google Scholar
- 2.Saraswat, V., Jagadeesan, R., Gupta, V.: Foundations of timed concurrent constraint programming. In: Abramsky, S., (ed.): Proceedings of the 9th Annual IEEE Symp. on Logic in Computer Science, LICS (1994)Google Scholar
- 3.Saraswat, V.A., Rinard, M., Panangadnen, P.: Semantic foundation of Concurrent Constraint Programming. In: Proc. of 18th Annual ACM Symp. on Principles of Programming Languages, ACM Press, New York (1991)Google Scholar