메뉴 건너뛰기




Volumn 24, Issue 1, 2002, Pages 51-64

An assume-guarantee rule for checking simulation

Author keywords

D.2.4 Software Engineering : Software Program Verification formal methods; F.3.1 Logics and Meanings of Programs : Specifying and Verifying and Reasoning about Programs; Simulation relations; Verification; Verification rules

Indexed keywords

SIMULATION PREORDERS; STATE TRANSITION SYSTEMS;

EID: 0040620592     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/509705.509707     Document Type: Article
Times cited : (22)

References (10)
  • 1
    • 0026154452 scopus 로고
    • The existence of refinement mappings
    • ABADI, M. AND LAMPORT, L. 1991. The existence of refinement mappings. Theoret. Comput. Sci. 82, 2, 253-284.
    • (1991) Theoret. Comput. Sci. , vol.82 , Issue.2 , pp. 253-284
    • Abadi, M.1    Lamport, L.2
  • 4
    • 84957873489 scopus 로고    scopus 로고
    • Fair simulation
    • CONCUR 97: Theories of Concurrency. Springer-Verlag, New York
    • HENZINGER, T., KUPFERMAN, O., AND RAJAMANI, S. 1997. Fair simulation. In CONCUR 97: Theories of Concurrency. Lecture Notes in Computer Science, vol. 1243. Springer-Verlag, New York, 273-287.
    • (1997) Lecture Notes in Computer Science , vol.1243 , pp. 273-287
    • Henzinger, T.1    Kupferman, O.2    Rajamani, S.3
  • 7
    • 84947418436 scopus 로고    scopus 로고
    • A compositional rule for hardware design refinement
    • CAV 97: Computer-Aided Verification. Springer-Verlag, New York
    • MCMILLAN, K. 1997. A compositional rule for hardware design refinement. In CAV 97: Computer-Aided Verification. Lecture Notes in Computer Science, vol. 1254. Springer-Verlag, New York, 24-35.
    • (1997) Lecture Notes in Computer Science , vol.1254 , pp. 24-35
    • McMillan, K.1


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