메뉴 건너뛰기




Volumn , Issue , 2002, Pages 38-49

Automated protocol verification in linear logic

Author keywords

Authentication Protocols; Bottom up Evaluation; Linear Logic; Model Checking

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; LOGIC PROGRAMMING; NETWORK PROTOCOLS; THEOREM PROVING;

EID: 0036992206     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/571157.571162     Document Type: Conference Paper
Times cited : (13)

References (34)
  • 1
    • 0034632154 scopus 로고    scopus 로고
    • Tsay algorithmic analysis of programs with well quasi-ordered domains
    • P. A. Abdulla, K. Cerans, B. Jonsson, Y.-K. Tsay Algorithmic Analysis of Programs with Well Quasi-ordered Domains. Information and Computation 160(1-2): 109-127, 2000.
    • (2000) Information and Computation , vol.160 , Issue.1-2 , pp. 109-127
    • Abdulla, P.A.1    Cerans, K.2    Jonsson, B.3    Tsay, Y.-K.4
  • 2
    • 0000421604 scopus 로고
    • Logic programming with focusing proofs in linear logic
    • J.-M. Andreoli. Logic Programming with Focusing Proofs in Linear Logic. Journal of Logic and Computation, 2(3):297-347, 1992.
    • (1992) Journal of Logic and Computation , vol.2 , Issue.3 , pp. 297-347
    • Andreoli, J.-M.1
  • 3
    • 0000077769 scopus 로고
    • Linear objects: Logical processes with built-in inheritance
    • J.-M. Andreoli and R. Pareschi. Linear Objects: Logical Processes with Built-In Inheritance. New Generation Computing, 9(3-4):445-473, 1991.
    • (1991) New Generation Computing , vol.9 , Issue.3-4 , pp. 445-473
    • Andreoli, J.-M.1    Pareschi, R.2
  • 8
    • 0034822279 scopus 로고    scopus 로고
    • An efficient cryptographic protocol verifier based on Prolog rules
    • B. Blanchet. An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In Proc. of CSFW'01, pages 82-96, 2001.
    • (2001) Proc. of CSFW'01 , pp. 82-96
    • Blanchet, B.1
  • 9
    • 0013177958 scopus 로고    scopus 로고
    • Ensuring security through model checking in a logical environment (preliminary results)
    • December
    • M. Bozzano. Ensuring Security through Model Checking in a Logical Environment (Preliminary Results). In Proc. of the ICLP/CP 01 workshop SAVE'01, December 2001.
    • (2001) Proc. of the ICLP/CP 01 Workshop SAVE'01
    • Bozzano, M.1
  • 12
    • 0000998131 scopus 로고
    • Petri nets and linear logic: A case study for logic programming
    • I. Cervesato. Petri Nets and Linear Logic: a Case Study for Logic Programming. In Proc. of GULP-PRODE'95, pages 313-318, 1995.
    • (1995) Proc. of GULP-PRODE'95 , pp. 313-318
    • Cervesato, I.1
  • 13
    • 0013179374 scopus 로고    scopus 로고
    • Typed multiset rewriting specifications of security protocols
    • Cork, Ireland
    • I. Cervesato. Typed Multiset Rewriting Specifications of Security Protocols. In Proc. of MFCSIT'00, Cork, Ireland, 2001.
    • (2001) Proc. of MFCSIT'00
    • Cervesato, I.1
  • 14
    • 84949232265 scopus 로고    scopus 로고
    • Specifying authentication protocols using rewriting and strategies
    • Proc. of PADL'01
    • H. Cirstea. Specifying Authentication Protocols Using Rewriting and Strategies. In Proc. of PADL'01, LNCS 1990, pages 138-152, 2001.
    • (2001) LNCS , vol.1990 , pp. 138-152
    • Cirstea, H.1
  • 16
    • 23044522745 scopus 로고    scopus 로고
    • Specifying and debugging security protocols via hereditary harrop formulas and λProlog - A case-study
    • Proc. of FLOPS'01
    • G. Delzanno. Specifying and Debugging Security Protocols via Hereditary Harrop Formulas and λProlog - A Case-study -. In Proc. of FLOPS'01, LNCS 2024, pages 123-137, 2001.
    • (2001) LNCS , vol.2024 , pp. 123-137
    • Delzanno, G.1
  • 18
    • 84902500281 scopus 로고    scopus 로고
    • Phase semantics and verification of concurrent constraint programs
    • F. Fages, P. Ruet, and S. Soliman. Phase Semantics and Verification of Concurrent Constraint Programs. In Proc. of LICS'98, 1998.
    • (1998) Proc. of LICS'98
    • Fages, F.1    Ruet, P.2    Soliman, S.3
  • 19
    • 0002338883 scopus 로고
    • A model-theoretic reconstruction of the operational semantics of logic programs
    • M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs. Information and Computation, 103(1):86-113, 1993.
    • (1993) Information and Computation , vol.103 , Issue.1 , pp. 86-113
    • Falaschi, M.1    Levi, G.2    Martelli, M.3    Palamidessi, C.4
  • 21
    • 84956860311 scopus 로고    scopus 로고
    • Compiling and verifying security protocols
    • Proc. of LPAR'00
    • F. Jacquemard, M. Rusinowitch, and L. Vigneron. Compiling and Verifying Security Protocols. In Proc. of LPAR'00, LNCS 1955, pages 131-160, 2000.
    • (2000) LNCS , vol.1955 , pp. 131-160
    • Jacquemard, F.1    Rusinowitch, M.2    Vigneron, L.3
  • 22
    • 0000508353 scopus 로고
    • Asynchronous communication model based on linear logic
    • N. Kobayashi and A. Yonezawa. Asynchronous Communication Model based on Linear Logic. Formal Aspects of Computing, 7(2):113-149, 1995.
    • (1995) Formal Aspects of Computing , vol.7 , Issue.2 , pp. 113-149
    • Kobayashi, N.1    Yonezawa, A.2
  • 23
    • 0342658605 scopus 로고    scopus 로고
    • Breaking and fixing the needham-schroeder public-key protocol using FDR
    • Proc. of TACAS'96
    • G. Lowe. Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR. In Proc. of TACAS'96, LNCS 1055, pages 147-166, 1996.
    • (1996) LNCS , vol.1055 , pp. 147-166
    • Lowe, G.1
  • 24
    • 0031633395 scopus 로고    scopus 로고
    • Casper: A compiler for the analysis of security protocols
    • G. Lowe. Casper: A Compiler for the Analysis of Security Protocols. Journal of Computer Security, 6(1):53-84, 1998.
    • (1998) Journal of Computer Security , vol.6 , Issue.1 , pp. 53-84
    • Lowe, G.1
  • 26
    • 0030084918 scopus 로고    scopus 로고
    • The NRL protocol analyzer: An overview
    • C. Meadows. The NRL Protocol Analyzer: An overview. Journal of Logic Programming, 26(2):113-131, 1996.
    • (1996) Journal of Logic Programming , vol.26 , Issue.2 , pp. 113-131
    • Meadows, C.1
  • 27
    • 84913004277 scopus 로고
    • The π-calculus as a theory in linear logic: Preliminary results
    • Proc. of the Workshop on Extensions of Logic Programming
    • D. Miller. The π-Calculus as a Theory in Linear Logic: Preliminary Results. In Proc. of the Workshop on Extensions of Logic Programming, LNCS 660, pages 242-265, 1992.
    • (1992) LNCS , vol.660 , pp. 242-265
    • Miller, D.1
  • 28
    • 0030247475 scopus 로고    scopus 로고
    • Forum: A multiple-conclusion specification logic
    • D. Miller. Forum: A Multiple-Conclusion Specification Logic. Theoretical Computer Science, 165(1):201-232, 1996.
    • (1996) Theoretical Computer Science , vol.165 , Issue.1 , pp. 201-232
    • Miller, D.1
  • 33
    • 0031643297 scopus 로고    scopus 로고
    • The inductive approach to verifying cryptographic protocols
    • L. C. Paulson. The Inductive Approach to Verifying Cryptographic Protocols. Journal of Computer Security, 6(1-2):85-128, 1998.
    • (1998) Journal of Computer Security , vol.6 , Issue.1-2 , pp. 85-128
    • Paulson, L.C.1
  • 34
    • 0033344294 scopus 로고    scopus 로고
    • Proving security protocols with model checkers by data independence techniques
    • A. W. Roscoe and P. J. Broadfoot. Proving Security Protocols with Model Checkers by Data Independence Techniques. Journal of Computer Security, 7(2-3):147-190, 1999.
    • (1999) Journal of Computer Security , vol.7 , Issue.2-3 , pp. 147-190
    • Roscoe, A.W.1    Broadfoot, P.J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.