메뉴 건너뛰기




Volumn 29, Issue 1-2, 1997, Pages 79-98

Symbolic techniques for formally verifying industrial systems

Author keywords

Binary decision diagrams; CTL; Futurebus+; PCI Local Bus; Quantitative timing analysis; SMV; Symbolic model checking; Temporal logic model checking

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; COMPUTER SYSTEMS; COMPUTER TESTING; ERROR CORRECTION; ERRORS; FORMAL LOGIC;

EID: 0031188120     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6423(96)00030-5     Document Type: Article
Times cited : (5)

References (11)
  • 1
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • R.E. Bryant, Graph-based algorithms for boolean function manipulation, IEEE Transactions on Computers. C-35 (8) (1986) 677-91.
    • (1986) IEEE Transactions on Computers. , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 5
    • 0022706656 scopus 로고
    • Automatic verification of finite-state concurrent systems using temporal logic specifications
    • E.M. Clarke, E.A. Emerson and A.P. Sistla, Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Trans. Programm. Languages Systems 8 (2) (1986) 244-263.
    • (1986) ACM Trans. Programm. Languages Systems , vol.8 , Issue.2 , pp. 244-263
    • Clarke, E.M.1    Emerson, E.A.2    Sistla, A.P.3


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