메뉴 건너뛰기




Volumn 10, Issue 1, 1997, Pages 47-71

Another Look at LTL Model Checking

Author keywords

Automatic verification; Binary decision diagrams; Model checking; Temporal logic

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; CONSTRAINT THEORY; DECISION THEORY; FORMAL LOGIC;

EID: 0031071522     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008615614281     Document Type: Article
Times cited : (114)

References (18)
  • 1
    • 0020880468 scopus 로고
    • The temporal logic of branching time
    • M. Ben-Ari, Z. Manna, and A. Pnueli. "The temporal logic of branching time," Acta Informatica, Vol. 20, pp. 207-226, 1983.
    • (1983) Acta Informatica , vol.20 , pp. 207-226
    • Ben-Ari, M.1    Manna, Z.2    Pnueli, A.3
  • 3
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • R. E. Bryant. "Graph-based algorithms for boolean function manipulation," IEEE Transactions on Computers, Vol. C-35, 1986.
    • (1986) IEEE Transactions on Computers , vol.C-35
    • Bryant, R.E.1
  • 5
    • 0001587421 scopus 로고
    • Verification tools for finite-state concurrent systems
    • Noordwijkerhout, The Netherlands, June 1993. Lecture Notes In Computer Science, Springer Verlag
    • E. Clarke, O. Grumberg, and D. Long. "Verification tools for finite-state concurrent systems," In A Decade of Concurrency, Noordwijkerhout, The Netherlands, June 1993. Lecture Notes In Computer Science, Springer Verlag: vol. 684, pp. 124-175, 1994.
    • (1994) A Decade of Concurrency , vol.684 , pp. 124-175
    • Clarke, E.1    Grumberg, O.2    Long, D.3
  • 7
    • 0027634774 scopus 로고
    • A unified approach for showing language containment and equivalence between various types of ω-automata
    • E. M. Clarke, I. A. Draghicescu, and R. P. Kurshan. "A unified approach for showing language containment and equivalence between various types of ω-automata," Information Processing Letters, Vol. 46, pp. 301-308, 1993.
    • (1993) Information Processing Letters , vol.46 , pp. 301-308
    • Clarke, E.M.1    Draghicescu, I.A.2    Kurshan, R.P.3
  • 9
  • 11
    • 0011589477 scopus 로고
    • Verifying temporal properties of sequential machines without building their state diagrams
    • R. P. Kurshan and E. M. Clarke, editors, June
    • O. Coudert, J. C. Madre, and C. Berthet. "Verifying temporal properties of sequential machines without building their state diagrams," In R. P. Kurshan and E. M. Clarke, editors, Proceedings of the 1990 Workshop on Computer-Aided Verification, June 1990.
    • (1990) Proceedings of the 1990 Workshop on Computer-Aided Verification
    • Coudert, O.1    Madre, J.C.2    Berthet, C.3
  • 12
    • 0022514018 scopus 로고
    • Sometimes" and "Not Never" revisited: On branching time versus linear time
    • E.A. Emerson and J.Y. Halpern. "Sometimes" and "Not Never" revisited: On branching time versus linear time." Journal of the ACM, vol. 33, pp. 151-178, 1986
    • (1986) Journal of the ACM , vol.33 , pp. 151-178
    • Emerson, E.A.1    Halpern, J.Y.2
  • 17
    • 0022092438 scopus 로고
    • Complexity of propositional temporal logics
    • July
    • A. P. Sistla and E.M. Clarke. "Complexity of propositional temporal logics," Journal of the ACM, Vol. 32, pp. 733-749, July 1986.
    • (1986) Journal of the ACM , vol.32 , pp. 733-749
    • Sistla, A.P.1    Clarke, E.M.2


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