Using interval logics for temporal analysis of security protocols

Proceedings of the ACM Workshop on Formal Methods in Security Engineering

Volumn , Issue , 2003, Pages 24-31

  Hansen, Michael R ^a   Sharp, Robin ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Interval logic; Real time; Security protocols; Verification

Indexed keywords

COMPUTATION THEORY; COMPUTER SIMULATION; FORMAL LOGIC; NETWORK PROTOCOLS; REAL TIME SYSTEMS; TELECOMMUNICATION LINKS;

INTERVAL LOGIC; MODEL CHECKING TECHNIQUES; SECURITY PROTOCOLS; VERIFICATION;

SECURITY OF DATA;

EID: 2642531224     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1035429.1035432     Document Type: Conference Paper

References (23)

1. R. Barua, S. Roy, and Z. Chaochen. Completeness of neighbourhood logic. Journal of Logic and Computation, 10(2):271-295, 2000.
2. P. Chan and D. V. Hung. Duration calculus specification of scheduling for tasks with shared resources. In K. Kanchanasut and J.-J. Levy, editors, Asian Computing Science Conference 1995, volume 1023 of LNCS, pages 365-380. Springer-Verlag, 1995.
3. V. D. Gligor. A note on the denial-of-service problem. In Proceedings of the 1983 Symposium on Security and Privacy, pages 139-149. IEEE Computer Society Press, 1983.
4. L. Gong and P. Syverson. Fail-stop protocols: An approach to designing secure protocols. In R. K. Iyer, M. Morganti, W. K. Fuchs, and V. Gligor, editors, Dependable Computing for Critical Applications 5, pages 79-100. IEEE Computer Society, 1998.
5. J. Halpern, B. Moszkowski, and Z. Manna. A hardware semantics based on temporal intervals. In ICALP'83, volume 154 of Lecture Notes in Computer Science, pages 278-291. Springer-Verlag, 1983.
6. M. R. Hansen and Zhou Chaochen. Duration Calculus: Logical foundations. Formal Aspects of Computing, 9(3):283-330, 1997.
7. T. Henzinger, P.-H. Ho, and H. Wong-Toi. Hytech: A model checker for hybrid systems. Int. Journal on Software Tools for Technology Transfer, 1(1-2):110-122, Oct. 1997.
8. K. G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1-2):134-152, Oct. 1997.
9. C. Meadows. A cost-based framework for analysis of denial-of-service in networks. Journal of Computer Security, 9(1/2):143-164, Mar. 2001.
10. J. K. Millen. A resource allocation model for denial of service. In Proceedings of the 1992 IEEE Symposium on Security and Privacy, Oakland, California, pages 137-147, May 1992.
11. S. Mørk, J. C. Godskesen, M. R. Hansen, and R. Sharp. A timed semantics for SDL. In R. Gotzhein and J. Bredereke, editors, Formal Description Techniques IX: Theory, application and tools, pages 295-309. Chapman & Hall, 1996.
12. B. Moszkowski. A temporal logic for multilevel reasoning about hardware. IEEE Computer, 18(2):10-19, 1985.
13. L. C. Paulson. Proving properties of security protocols by induction. In Proceedings of the 10th IEEE Computer Security Foundations Workshop, Rockport, Mass., pages 70-83, June 1997.
14. H. Pilegaard. Modelling properties of security protocols. Master's thesis, Informatics and Mathematical Modelling, Technical University of Denmark, Oct. 2002.
15. H. Pilegaard, M. R. Hansen, and R. Sharp. An approach to analyzing availability properties of security protocols. Nordic Journal of Computing, 2003. To appear.
16. T. M. Rasmussen. Automated proof support for interval logics. In LPAR 2001, volume 2250 of Lecture Notes in Computer Science, pages 317-326. Springer-Verlag, 2001.
17. T. M. Rasmussen. Interval Logic - Proof Theory and Theorem Proving. PhD thesis, Informatics and Mathematical Modelling, Technical University of Denmark, 2002.
18. S. Yovine. Kronos: a verification tool for real-time systems. Int. Journal on Software Tools for Technology Transfer, 1(1-2):123-133, Oct. 1997.
19. C.-F. Yu and V. D. Gligor. A formal specification and verification method for the prevention of denial of service. In 1988 IEEE Symposium on Security and Privacy, Oakland, California, pages 187-202. IEEE, IEEE Computer Society Press, Apr. 1988.
20. Zheng Yuhua and Zhou Chaochen. A formal proof of the deadline driven scheduler. In H. Langmack, W.-P. de Roever, and J. Vytopil, editors, Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 863 of Lecture Notes in Computer Science, pages 756-775. Springer-Verlag, Sept. 1994.
21. Zhou Chaochen and M. R. Hansen. An adequate first order interval logic. In Compositionality: The Significant Difference (COMPOS'97), volume 1536 of Lecture Notes in Computer Science, pages 581-608. Springer-Verlag, 1998.
22. Zhou Chaochen, M. R. Hansen, A. P. Ravn, and H. Rischel. Duration specifications for shared processors. In J. Vytopil, editor, Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 571 of Lecture Notes in Computer Science, pages 21-32. Springer-Verlag, Jan. 1992.
23. Zhou Chaochen, C. A. R. Hoare, and A. P. Ravn. A calculus of durations. Information Processing Letters, 40(5):269-276, 1991.