A Declarative Framework for Security: Secure Concurrent Constraint Programming
Due to technological advances such as the Internet and mobile computing, Security has become a serious challenge involving several disciplines of Computer Science. In recent years, there has been a growing interest in the analysis of security protocols and one promising approach is the development of formalisms that model communicating processes, in particular Process Calculi. The results are so far encouraging although most remains to be done.
- [ALV03]Amadio, R., Lugiez, D., Vanackere, V.: On the symbolic reduction of processes with cryptographic functions. TCS: Theoretical Computer Science 290 (2003)Google Scholar
- [PSVV06]Palamidessi, C., Saraswat, V., Victor, B., Valencia, F.: On the expressiveness of recursion vs replication in the asynchronous pi-calculus. In: LICS 2006 (to appear, 2006)Google Scholar
- [RM94]Rossi, F., Montanari, U.: Concurrent semantics for concurrent constraint programming. In: Constraint Programming: Proc. 1993 NATO ASI, pp. 181–220 (1994)Google Scholar
- [Sar93]Saraswat, V.: Concurrent Constraint Programming. The MIT Press, Cambridge (1993)Google Scholar
- [SRP91]Saraswat, V., Rinard, M., Panangaden, P.: The semantic foundations of concurrent constraint programming. In: POPL 1991, pp. 333–352 (1991)Google Scholar