Proof scores in the OTS/CafeOBJ method

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

Volumn 2884, Issue , 2003, Pages 170-184

  Ogata, Kazuhiro ^a,b   Futatsugi, Kokichi ^b  

^a NEC CORPORATION   (Japan)

^b JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Algebraic specification; CafeOBJ; Observational transition system; Proof scores; The NSLPK authentication protocol; Verification

Indexed keywords

ALGEBRA; SPECIFICATION LANGUAGES; SPECIFICATIONS; VERIFICATION;

ALGEBRAIC SPECIFICATIONS; AUTHENTICATION PROTOCOLS; CAFEOBJ; OBSERVATIONAL TRANSITION SYSTEMS; PROOF SCORES;

FORMAL METHODS;

EID: 0345412611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39958-2_12     Document Type: Article

References (19)

1. Gries, D., Schneider, F.B.: A Logical Approach to Discrete Math. Texts and Monographs in Computer Science. Springer, NY (1993)
2. Goguen, J., Malcolm, C., eds.: Software Engineering with OBJ: Algebraic Specification in Action. Kluwer Academic Publishers (2000)
3. Ogata, K., Futatsugi, K.: Formally modeling and verifying Ricart&Agrawala distributed mutual exclusion algorithm. In: APAQS '01, IEEE CS Press (2001) 357-366
4. Ogata, K., Futatsugi, K.: Formal analysis of Suzuki&Kasami distributed mutual exclusion algorithm. In: FMOODS '02, Kluwer Academic Publishers (2002) 181-195
5. Ogata, K., Futatsugi, K.: Formal analysis of the iKP electronic payment protocols. In: ISSS 2002. Volume 2609 of LNCS., Springer (2003) 441-460
6. Ogata, K., Futatsugi, K.: Formal verification of the Horn-Preneel micropayment protocol. In: VMCAI 2003. Volume 2575 of LNCS., Springer (2003) 238-252
7. CafeOBJ: CafeOBJ web page. http://www.ldl.jaist.ac.jp/cafeobj/ (2001)
8. Diaconescu, R., Futatsugi, K.: CafeOBJ report. AMAST Series in Computing, 6. World Scientific, Singapore (1998)
9. Diaconescu, R., Futatsugi, K.: Behavioural coherence in object-oriented algebraic specification. Journal of Universal Computer Science 6 (2000) 74-96
10. Lowe, G.: An attack on the Needham-Schroeder public-key authentication protocol. Inf. Process. Lett. 56 (1995) 131-133
11. Lowe, G.: Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In: TACAS '96. LNCS 1055, Springer (1996) 147-166
12. Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley, Reading, MA (1988)
13. Needham, R.M., Schroeder, M.D.: Using encryption for authentication in large networks of computers. Comm. ACM 21 (1978) 993-999
14. Dolev, D., Yao, A.C.: On the security of public key protocols. IEEE Trans. Inform. Theory IT-29 (1983) 198-208
15. Hsiang, J.: Refutational Theorem Proving using Term Rewriting Systems. PhD thesis, University of Illinois at Champaign-Urbana (1981)
16. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL - A Proof Assistant for Higer-Order Logic. LNCS 2283. Springer (2002)
17. Diaconescu, R., Futatsugi, K., Iida, S.: Component-based algebraic specification and verification in CafeOBJ. In: World Congress on Formal Methods. Volume 1709 of LNCS., Springer (1999) 1644-1663
18. Lowe, G.: A hierarchy of authentication specifications. In: 10th IEEE Computer Security Foundations Workshop, IEEE CS Press (1997) 31-43
19. Ogata, K., Futatsugi, K.: Rewriting-based verification of authentication protocols. In: WRLA '02. Volume 71 of ENTCS., Elsevier Science Publishers (2002)