메뉴 건너뛰기




Volumn 3229, Issue , 2004, Pages 730-733

SATMC: A SAT-based Model Checker for security protocols

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BOOLEAN ALGEBRA; ENCODING (SYMBOLS); ITERATIVE METHODS; LINEAR EQUATIONS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBLEM SOLVING; SET THEORY;

EID: 22944445210     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30227-8_68     Document Type: Conference Paper
Times cited : (88)

References (16)
  • 1
    • 85006614284 scopus 로고    scopus 로고
    • Verifying security protocols as planning in logic programming
    • Oct.
    • L. C. Aiello and F. Massacci. Verifying security protocols as planning in logic programming. ACM Trans. on Computational Logic, 2(4):542-580, Oct. 2001.
    • (2001) ACM Trans. on Computational Logic , vol.2 , Issue.4 , pp. 542-580
    • Aiello, L.C.1    Massacci, F.2
  • 3
    • 84954313527 scopus 로고    scopus 로고
    • Automatic SAT-compilation of protocol insecurity problems via reduction to planning
    • A. Armando and L. Compagna. Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning. In Proc.of FORTE 2002. 2002.
    • (2002) Proc.of FORTE 2002
    • Armando, A.1    Compagna, L.2
  • 4
    • 35048841165 scopus 로고    scopus 로고
    • Abstraction-driven SAT-based analysis of security protocols
    • LNCS 2919. Springer-Verlag
    • A. Armando and L. Compagna. Abstraction-driven SAT-based Analysis of Security Protocols. In Proc.of SAT 2003, LNCS 2919. Springer-Verlag, 2003.
    • (2003) Proc.of SAT 2003
    • Armando, A.1    Compagna, L.2
  • 5
    • 22944474197 scopus 로고    scopus 로고
    • An optimized intruder Model for SAT-based model-checking of security protocols
    • A. Armando and L. Compagna. An Optimized Intruder Model for SAT-based Model-Checking of Security Protocols. In Proc. of ARSPA Workshop. 2004.
    • (2004) Proc. of ARSPA Workshop
    • Armando, A.1    Compagna, L.2
  • 6
    • 35248876774 scopus 로고    scopus 로고
    • SAT-based model-checking of security protocols using planning graph analysis
    • A. Armando, L. Compagna, and P. Ganty. SAT-based Model-Checking of Security Protocols using Planning Graph Analysis. In Proc.of FME'2003. 2003.
    • (2003) Proc.of FME'2003
    • Armando, A.1    Compagna, L.2    Ganty, P.3
  • 8
    • 84944319371 scopus 로고    scopus 로고
    • Symbolic model checking without BDDs
    • LNCS 1579. Springer-Verlag
    • A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic Model Checking without BDDs. In Proc.of TACAS'99, LNCS 1579. Springer-Verlag, 1999.
    • (1999) Proc.of TACAS'99
    • Biere, A.1    Cimatti, A.2    Clarke, E.3    Zhu, Y.4
  • 14
    • 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
  • 15
    • 0035751921 scopus 로고    scopus 로고
    • Constraint solving for bounded-process cryptographic protocol analysis
    • J. K. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In Proc. of the CCS'01, pages 166-175, 2001.
    • (2001) Proc. of the CCS'01 , pp. 166-175
    • Millen, J.K.1    Shmatikov, V.2
  • 16
    • 0032678887 scopus 로고    scopus 로고
    • A new efficient automatic checker for security protocol analysis
    • D. Song. Athena: A new efficient automatic checker for security protocol analysis. In Proc.of 12th Computer Security Foundation Workshop, pages 192-202, 1999.
    • (1999) Proc.of 12th Computer Security Foundation Workshop , pp. 192-202
    • Athena, D.S.1


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