The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Concurrent constraint programming
Concurrent constraint programming
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
On the symbolic reduction of processes with cryptographic functions
Theoretical Computer Science
Temporal concurrent constraint programming: denotation, logic and applications
Nordic Journal of Computing
Nominal Logic: A First Order Theory of Names and Binding
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A Framework for the Analysis of Security Protocols
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Computing Symbolic Models for Verifying Cryptographic Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Decidability of infinite-state timed CCP processes and first-order LTL
Theoretical Computer Science - Expressiveness in concurrency
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Securely accessing shared resources with concurrent constraint programming
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
Hi-index | 0.00 |
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.