Specifying and debugging security protocols via hereditary Harrop formulas and λprolog - A case-study -

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2024, Issue , 2001, Pages 123-137

  Delzanno, Giorgio ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING; PROGRAM DEBUGGING; RECONFIGURABLE HARDWARE; SPECIFICATION LANGUAGES; SPECIFICATIONS;

HEREDITARY HARROP FORMULAS; INTUITIONISTIC LOGIC; NEEDHAM SCHROEDER PROTOCOL; SECURITY PROTOCOLS;

NETWORK SECURITY;

EID: 23044522745     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44716-4_8     Document Type: Conference Paper

References (23)

1. M. Bozzano, G. Delzanno, and M. Martelli. A Bottom-up semantics for Linear Logic Programs. In Proc. PPDP’00, page 92-102, 2000.
2. M. Bozzano, G. Delzanno, and M. Martelli.: An Effective Bottom-up Semantics for First-Order Linear Logic Programs. To appear in Proc. FLOPS 2001, March 2001.
3. M. Burrows, M. Abadi, R. M. Needham. A Logic of Authentication. TOCS 8(1): 18-36, 1990.
4. I. Cervesato, N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. A Meta- Notation for Protocol Analysis. In Proc. Computer Security Foundations Workshop CSFW’99, pages 28-30, 1999.
5. I. Cervesato, N. Durgin, M. Kanovich, and A. Scedrov. Interpreting Strands in Linear Logic In Proc. of Formal Methods and Computer Security FMCS’00, 2000.
6. I. Cervesato, N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Relating Strands and Multiset Rewriting for Security Protocol Analysis. In Proc. of Computer Security Foundations Workshop CSFW’00, pages 35-51, 2000.
7. E. Clarke, S. Jha, W. Marrero. Using State Space Exploration and a Natural Deduction Style Message Derivation Engine to Verify Security Protocols. In Proc. of PRO-COMET’98, 1998.
8. E. Clarke, S. Jha, W. Marrero. Partial Order Reductions for Security Protocol Verification. In Proc. of TACAS 2000, pages 503-518, LNCS 1785, 2000.
9. D. Dolev and A. Yao. On the Security pf Public-key Protocols. IEEE Transactions on Information Theory, 2(29), 1983.
10. J.Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
11. J. Hodas and D. Miller. Logic Programming in a Fragment of Intuitionistic Linear Logic. Information and Computation, 110(2):327-365, 1994.
12. A. Hui Bon Hoa. A Bottom-Up Interpreter for a Higher-Order Logic Programming Language. In Proc. PLILP 1992, pages 326-340, LNCS 631, 1992.
13. G. Lowe. Breaking and Fixing the Needham-Schroeder Public-key Protocol usinmg CSP and FDR. In Proc. TACAS’96, page 147-166, LNCS 1055, 1996.
14. F. Massacci. Automated Reasoning and the Verification of Security Protocols In Proc. of TABLEAUX ‘99, pages 32-33, LNAI 1617, 1999.
15. C. Meadows. The NRL Protocol Analyzer: An Overview. JLP 26(2): 113-131, 1996.
16. R. McDowell, D. Miller. A Logic for Reasoning with Higher-Order Abstract Syntax. In Proc. LICS ‘97, pages 434-445, 1997.
17. D. Miller. Lexical Scoping as Universal Quantification. In Proc. ICLP ‘89, pages 268-283, 1989.
18. D. Miller. A Logical Analysis of Modules in Logic Programming. JLP 6(1&2): 79-108, 1989.
19. D. Miller. Forum: A Multiple-Conclusion Specification Logic. Theoretical Computer Science, 165(1):201-232, 1996.
20. D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform Proofs as a Foundation for Logic Programming. Annals of Pure and Applied Logic, 51:125-157, 1991.
21. G. Nadathur and D. Miller. An Overview of λ-Prolog. In Proc. of ILPS/SLP ‘88, pages 810-827, 1988.
22. G. Nadathur, D. J. Mitchell. System Description: Teyjus - A Compiler and Abstract Machine Based Implementation of lambda-Prolog. In Proc CADE’99, LNCS 1632, pages 287-291, 1999.
23. R. M. Needham and M. D. Schroeder. Using Encryption for Authentication in Large Networks of Computers. CACM 21(12): 993-999, 1978.