메뉴 건너뛰기




Volumn 5283 LNCS, Issue , 2008, Pages 548-562

State space reduction in the maude-NRL protocol analyzer

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; SECURITY SYSTEMS;

EID: 57049108197     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88313-5_35     Document Type: Conference Paper
Times cited : (20)

References (16)
  • 4
    • 57049137696 scopus 로고    scopus 로고
    • Effectively checking or disproving the finite variant property
    • Proc. of Term Rewriting and Applications, RTA, Springer, Heidelberg to appear
    • Escobar, S., Meseguer, J., Sasse, R.: Effectively checking or disproving the finite variant property. In: Proc. of Term Rewriting and Applications, RTA 2008. LNCS. Springer, Heidelberg (to appear, 2008)
    • (2008) LNCS
    • Escobar, S.1    Meseguer, J.2    Sasse, R.3
  • 7
    • 33750477656 scopus 로고    scopus 로고
    • A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties
    • Escobar, S., Meadows, C., Meseguer, J.: A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties. Theoretical Computer Science 367(1-2) (2006)
    • (2006) Theoretical Computer Science , vol.367 , Issue.1-2
    • Escobar, S.1    Meadows, C.2    Meseguer, J.3
  • 9
    • 38049123677 scopus 로고    scopus 로고
    • Escobar, S., Meseguer, J.: Symbolic model checking of infinite-state systems using narrowing. In: Baader, F. (ed.) RTA 2007. LNCS, 4533, pp. 153-168. Springer, Heidelberg (2007)
    • Escobar, S., Meseguer, J.: Symbolic model checking of infinite-state systems using narrowing. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 153-168. Springer, Heidelberg (2007)
  • 11
    • 0030084918 scopus 로고    scopus 로고
    • The NRL protocol analyzer: An overview
    • Meadows, C.: 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
  • 12
    • 0027113376 scopus 로고
    • Conditional rewriting logic as a unified model of concurrency
    • Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1), 73-155 (1992)
    • (1992) Theoretical Computer Science , vol.96 , Issue.1 , pp. 73-155
    • Meseguer, J.1
  • 13
    • 84957873927 scopus 로고    scopus 로고
    • Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, 1376, pp. 18-61. Springer, Heidelberg (1998)
    • Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18-61. Springer, Heidelberg (1998)
  • 14
    • 34047234972 scopus 로고    scopus 로고
    • Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
    • Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. Higher-Order and Symbolic Computation 20(1-2), 123-160 (2007)
    • (2007) Higher-Order and Symbolic Computation , vol.20 , Issue.1-2 , pp. 123-160
    • Meseguer, J.1    Thati, P.2
  • 15
    • 0031627781 scopus 로고    scopus 로고
    • Efficient finite-state analysis for large security protocols
    • IEEE Computer Society Press, Los Alamitos
    • Shmatikov, V., Stern, U.: Efficient finite-state analysis for large security protocols. In: 11th Computer Security Foundations Workshop - CSFW-11. IEEE Computer Society Press, Los Alamitos (1998)
    • (1998) 11th Computer Security Foundations Workshop - CSFW-11
    • Shmatikov, V.1    Stern, U.2
  • 16
    • 1242286270 scopus 로고    scopus 로고
    • Terese ed, Cambridge University Press, Cambridge
    • Terese (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)
    • (2003) Term Rewriting Systems


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