메뉴 건너뛰기




Volumn 2988, Issue , 2004, Pages 482-496

Liveness with incomprehensible ranking

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL;

EID: 35048869668     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_36     Document Type: Article
Times cited : (13)

References (19)
  • 1
    • 0022720442 scopus 로고
    • Limits for automatic program verification of finite-state concurrent systems
    • [AK86]
    • [AK86] K. R. Apt and D. Kozen. Limits for automatic program verification of finite-state concurrent systems. IPL, 22(6), 1986.
    • (1986) IPL , vol.22 , Issue.6
    • Apt, K.R.1    Kozen, D.2
  • 4
    • 84947707419 scopus 로고
    • Verifying parametrized networks using abstraction and regular languages
    • th CONCUR
    • th CONCUR, LNCS 962, 395-407, 1995.
    • (1995) LNCS , vol.962 , pp. 395-407
    • Clarke, E.M.1    Grumberg, O.2    Jha, S.3
  • 5
    • 84937566009 scopus 로고    scopus 로고
    • Practical methods for proving program termination
    • th CAV
    • th CAV, LNCS 2404, 442-454, 2002.
    • (2002) LNCS , vol.2404 , pp. 442-454
    • Colon, M.1    Sipma, H.2
  • 9
    • 84903205463 scopus 로고    scopus 로고
    • On-the-fly model checking under fairness that exploits symmetry
    • th TACAS
    • th TACAS, LNCS 1384, 424-438, 1998.
    • (1998) LNCS , vol.1384 , pp. 424-438
    • Gyuris, V.1    Sistla, A.P.2
  • 11
    • 84863921735 scopus 로고    scopus 로고
    • Transitive closures of regular relations for verifying infinite-state systems
    • th TACAS
    • th TACAS, LNCS 1785,2000.
    • (2000) LNCS , vol.1785
    • Jonsson, B.1    Nilsson, M.2
  • 12
    • 35248854412 scopus 로고    scopus 로고
    • Bridging the gap between fair simulation and trace inclusion
    • th CAV
    • th CAV, LNCS 2725, 381-392. 2003.
    • (2003) LNCS , vol.2725 , pp. 381-392
    • Kesten, Y.1    Piterman, N.2    Pnueli, A.3
  • 14
    • 84863924303 scopus 로고    scopus 로고
    • Verification of an implementation of Tomasulo's algorithm by compositional model checking
    • th CAV
    • th CAV, LNCS 1427, 110-121, 1998.
    • (1998) LNCS , vol.1427 , pp. 110-121
    • McMillan, K.L.1
  • 16
    • 0003652264 scopus 로고
    • User guide for the PVS specification and verification system (draft)
    • [OSR93] CS Lab., SRI International, CA
    • [OSR93] S. Owre, N. Shankar, and J.M. Rushby. User guide for the PVS specification and verification system (draft). Tech. report, CS Lab., SRI International, CA, 1993.
    • (1993) Tech. Report
    • Owre, S.1    Shankar, N.2    Rushby, J.M.3
  • 17
    • 84903156915 scopus 로고    scopus 로고
    • Automatic deductive verification with invisible invariants
    • th TACAS
    • th TACAS, LNCS 2031, 82-97, 2001.
    • (2001) LNCS , vol.2031 , pp. 82-97
    • Pnueli, A.1    Ruah, S.2    Zuck, L.3
  • 18
    • 84937552463 scopus 로고    scopus 로고
    • Liveness with (0, 1, ∞)-counter abstraction
    • th CAV
    • th CAV, LNCS 2404, 107-122. 2002.
    • (2002) LNCS , vol.2404 , pp. 107-122
    • Pnueli, A.1    Xu, J.2    Zuck, L.3
  • 19
    • 33749034318 scopus 로고    scopus 로고
    • [Sha00]
    • [Sha00] E. Shahar. The TLV Manual, 2000. http://www.wisdom.weizmann.ac. il/verify/tlv.
    • (2000) The TLV Manual
    • Shahar, E.1


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