메뉴 건너뛰기




Volumn , Issue , 1998, Pages 102-112

Improving efficiency of symbolic model checking for state-based system requirements

Author keywords

Abstraction; Binary decision diagrams; Formal verification; Partitioned transition relation; Reachability analysis; RSML TCAS II; Statecharts; Symbolic model checking; System requirements specification

Indexed keywords

AIRCRAFT ACCIDENTS; BINARY DECISION DIAGRAMS; EFFICIENCY; FORMAL VERIFICATION; REQUIREMENTS ENGINEERING; SOFTWARE TESTING; SPECIFICATIONS; SPECTROMETRY;

EID: 84944385106     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/271771.271798     Document Type: Conference Paper
Times cited : (25)

References (28)
  • 2
    • 0028574677 scopus 로고
    • Case study: Applying formal methods to the traffic alert and collision avoidance system (tcas)
    • Gaithersburg MD USA June/July IEEE
    • J. J. Britt. Case study: Applying formal methods to the Traffic Alert and Collision Avoidance System (TCAS) II. In COMPASS'14 Proceedings of the 9th Annual Conference on Computer A. surance pages 39-51 Gaithersburg MD USA June/July 1934. IEEE.
    • (1934) COMPASS'14 Proceedings of the 9th Annual Conference on Computer A. Surance , vol.2 , pp. 39-51
    • Britt, J.J.1
  • 3
    • 0024035719 scopus 로고
    • Characterizing finite jipke structures in prepositional temporal logic
    • July
    • M. C. Browne E. M. Clarke and O. Griimberg. Characterizing finite jipke structures in prepositional temporal logic. Theoretical Computer Science 59(1/2): 115-131 July 1988.
    • (1988) Theoretical Computer Science , vol.59 , Issue.1-2 , pp. 115-131
    • Browne, M.C.1    Clarke, E.M.2    Griimberg, O.3
  • 4
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipu ation
    • August
    • R. E. Bryart. Graph-based algorithms for boolean function manipu ation. IEEE Transactions on Computers C-35(6):677-678 August 1986.
    • (1986) IEEE Transactions on Computers , vol.C35 , Issue.6 , pp. 677-678
    • Bryart, R.E.1
  • 5
    • 0026107125 scopus 로고
    • On the complexity of VLSI implementations and graph n presentation of boolean functions with applications to inte ;er multiplication
    • February
    • R. E. Bryan. On the complexity of VLSI implementations and graph n presentation of boolean functions with applications to inte ;er multiplication. IEEE Transactions on Computers 40(2; :205-213 February 1991.
    • (1991) IEEE Transactions on Computers , vol.40 , Issue.2 , pp. 205-213
    • Bryan, R.E.1
  • 7
    • 0030672545 scopus 로고    scopus 로고
    • Disjunctive partitioning and partial iterative squaring: An effective approach for symbolic traversal of large circuits
    • Anaheim CA USA June ACM
    • G. Cabodi R Camurati L. Lavagno and S. Quer. Disjunctive partitioning and partial iterative squaring: An effective approach for symbolic traversal of large circuits. In 34th Design Automation Conference Proceedings 1997 pages 728-733 Anaheim CA USA June 1997. ACM.
    • (1997) 34th Design Automation Conference Proceedings 1997 , pp. 728-733
    • Cabodi, G.1    Camurati, R.2    Lavagno, L.3    Quer, S.4
  • 10
    • 0022706656 scopus 로고
    • Automatic verification of finite-state concurrent systems using temporal logic specifications
    • April
    • E. M. Clarke E. A. Emerson and A. R Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8(2):244-263 April 1986.
    • (1986) ACM Transactions on Programming Languages and Systems , vol.8 , Issue.2 , pp. 244-263
    • Clarke, E.M.1    Emerson, E.A.2    Sistla, A.R.3
  • 16
    • 0023365727 scopus 로고
    • Statecharts: A visual formalism for complex systems
    • June
    • D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming 8(3):231-274 June 1987.
    • (1987) Science of Computer Programming , vol.8 , Issue.3 , pp. 231-274
    • Harel, D.1
  • 18
    • 4544221419 scopus 로고    scopus 로고
    • Completeness and consistency in hierarchical state-based requirements
    • June
    • M. R E. Heimdahl and N. G. Leveson. Completeness and consistency in hierarchical state-based requirements. IEEE Transactions on Software Engineering 22(6):363-377 June 1996.
    • (1996) IEEE Transactions on Software Engineering , vol.22 , Issue.6 , pp. 363-377
    • Heimdahl, M.R.E.1    Leveson, N.G.2
  • 20
    • 0027246928 scopus 로고
    • Reducing BDD size by exploiting functional dependencies
    • Dallas TX USA June 1993
    • A. J. Hu and D. L. Dill. Reducing BDD size by exploiting functional dependencies. In 30th ACM/IEEE Design Automation Conference Proceedings 1993 pages 266-27'1 Dallas TX USA June 1993.
    • (1993) 30th ACM/ IEEE Design Automation Conference Proceedings , pp. 266-271
    • Hu, A.J.1    Dill, D.L.2


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