Communicating sequential processes
Communicating sequential processes
An old-fashioned recipe for real time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Forward and backward simulations II.: timing-based systems
Information and Computation
TAME: Using PVS strategies for special-purpose theorem proving
Annals of Mathematics and Artificial Intelligence
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Analysing a Stream Authentication Protocol Using Model Checking
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
Flaw and modification of the iKP electronic payment protocols
Information Processing Letters
Secure Broadcast Communication in Wired and Wireless Networks
Secure Broadcast Communication in Wired and Wireless Networks
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Equational Approach to Formal Analysis of TLS
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
A complete and decidable security-specialised logic and its application to the TESLA protocol
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Modeling and verification of real-time systems based on equations
Science of Computer Programming
Induction-guided falsification
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
On the security of public key protocols
IEEE Transactions on Information Theory
Verification of the TESLA protocol in MCMAS-X
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Timing constraints: theory meets practice
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II
| Hi-index | 0.00 |
The Timed Observational Transition System (TOTS)/CafeOBJ method is a version of the OTS/CafeOBJ method for modeling, specification and verification of distributed systems and protocols with real time constraints. In this paper we report on a case study from the field of source authentication protocols, TESLA protocol, to show the application of the method to such complex systems. We prove that our model of the protocol satisfies that the receiver does not accept as authentic any message unless it was actually sent by the sender. To verify the property we have used several other invariants which include timing information. To our knowledge, this is the first time that the method has been applied to the formal analysis of such a complex protocol.