메뉴 건너뛰기




Volumn 1179, Issue , 1996, Pages 277-286

Hierarchical verification using verification diagrams

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84947903165     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0027800     Document Type: Conference Paper
Times cited : (4)

References (9)
  • 1
    • 0024144406 scopus 로고
    • The existence of refinement mappings
    • pg., IEEE Computer Society Press
    • M. Abadi and L. Lamport. The existence of refinement mappings. In Proc. 3rd IEEE Symp. Logic in Comp. Sci., pg. 165-175. IEEE Computer Society Press, 1988.
    • (1988) Proc. 3Rd IEEE Symp. Logic in Comp. Sci , pp. 165-175
    • Abadi, M.1    Lamport, L.2
  • 2
    • 0024303044 scopus 로고
    • Verifying temporal properties without temporal logic. ACM Trans. Prog
    • B. Alpern and F.B. Schneider. Verifying temporal properties without temporal logic. ACM Trans. Prog. Lang. Sys., 11:147-167, 1989.
    • (1989) Lang. Sys , vol.11 , pp. 147-167
    • Alpern, B.1    Schneider, F.B.2
  • 5
    • 0023365727 scopus 로고
    • Statecharts: A visual formalism for complex systems
    • D. Harel. Statecharts: A visual formalism for complex systems. Set. Comp. Prog., 8:231-274, 1987.
    • (1987) Set. Comp. Prog , vol.8 , pp. 231-274
    • Harel, D.1
  • 8
    • 84976828744 scopus 로고
    • Synthesis of communicating processes from temporal logic specifications. ACM Trans
    • January
    • Z Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Prog. Lang. Sys., 6(l):68-93, January 1984.
    • (1984) Prog. Lang. Sys , vol.6 , Issue.1 , pp. 68-93
    • Manna, Z.1    Wolper, P.2
  • 9
    • 0020496645 scopus 로고
    • Temporal logic can be more expressive
    • P. Wolper. Temporal logic can be more expressive. Information and Control, 56:72-99, 1983.
    • (1983) Information and Control , vol.56 , pp. 72-99
    • Wolper, P.1


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