ACM Transactions on Computer Systems (TOCS)
Coordination languages and their significance
Communications of the ACM
A note on the use of timestamps as nonces
ACM SIGOPS Operating Systems Review
A calculus of mobile processes, I
Information and Computation
Introduction to the Special Issue on Software Architecture
IEEE Transactions on Software Engineering - Special issue on software architecture
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
A calculus for cryptographic protocols
Information and Computation
Strand spaces: proving security protocols correct
Journal of Computer Security
Athena: a novel approach to efficient automatic security protocol analysis
Journal of Computer Security
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Analysis of security protocols as open systems
Theoretical Computer Science
Security and Dynamic Compositions of Open Systems
PDPTA '02 Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Volume 3
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Coordination for Orchestration
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Proving Properties of Security Protocols by Induction
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Honest Ideals on Strand Spaces
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Relating Strands and Multiset Rewriting for Security Protocol Analysis
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Communications of the ACM - Service-oriented computing
On the security of public key protocols
IEEE Transactions on Information Theory
A semantic framework for open processes
Theoretical Computer Science
Modeling and analysis of agent-based specifications of security protocols using CSANs and PDETool
IIT'09 Proceedings of the 6th international conference on Innovations in information technology
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
The quest for the formal certification of properties of systems is one of the most challenging research issues in the field of formal methods. It requires the development of formal models together with effective verification techniques. In this paper, we describe a formal methodology for verifying security protocols based on ideas borrowed from the analysis of open systems, where applications interact with one another by dynamically sharing common resources and services in a not fully trusted environment. The methodology is supported by ASPASyA, a tool based on symbolic model checking techniques.