메뉴 건너뛰기




Volumn 2021 LNCS, Issue , 2001, Pages 419-434

Faithful translations among models and specifications

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; FORMAL SPECIFICATION; SOFTWARE ENGINEERING;

EID: 84881134565     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45251-6_23     Document Type: Conference Paper
Times cited : (8)

References (33)
  • 1
    • 0000627069 scopus 로고
    • Appraising fairness in languages for distributed programming
    • K. R. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming. Distributed Computing, 2:226-241, 1988.
    • (1988) Distributed Computing , vol.2 , pp. 226-241
    • Apt, K.R.1    Francez, N.2    Katz, S.3
  • 6
    • 0024035719 scopus 로고
    • Characterizing finite kripke structures in propositional temporal logic
    • July
    • M. C. Browne, E. M. Clarke, and O. Grumberg. Characterizing finite kripke structures in propositional temporal logic. Theoretical Computer Science, 59(1-2), July 1988.
    • (1988) Theoretical Computer Science , vol.59 , Issue.1-2
    • Browne, M.C.1    Clarke, E.M.2    Grumberg, O.3
  • 10
    • 0022706656 scopus 로고
    • Automatic verification of finite state concurrent systems using temporal logic specifications
    • April
    • E.M. Clarke, E.A. Emerson, and A.P. 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.P.3
  • 15
    • 0023365727 scopus 로고
    • Statecharts: A visual formalism for complex systems
    • D. Harel. Statecharts: a visual formalism for complex systems. Science of Computer Programming, 8:231-274, 1987.
    • (1987) Science of Computer Programming , vol.8 , pp. 231-274
    • Harel, D.1
  • 21
    • 0043055250 scopus 로고    scopus 로고
    • Refinement with global equivalence proofs in temporal logic
    • D. Peled, V. Pratt, and G. Holzmann, editors, American Mathematical Society, DIMACS Series in Discrete Mathematics and Theoretical Computer Science
    • S. Katz. Refinement with global equivalence proofs in temporal logic. In D. Peled, V. Pratt, and G. Holzmann, editors, Partial Order Methods in Verification, pages 59-78. American Mathematical Society, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 29.
    • (1997) Partial Order Methods in Verification , vol.29 , pp. 59-78
    • Katz, S.1
  • 22
    • 0025506042 scopus 로고
    • Interleaving set temporal logic
    • Preliminary version appeared in the 6th ACM-PODC, 1987
    • S. Katz and D. Peled. Interleaving set temporal logic. Theoretical Computer Science, 75:263-287, 1990. Preliminary version appeared in the 6th ACM-PODC, 1987.
    • (1990) Theoretical Computer Science , vol.75 , pp. 263-287
    • Katz, S.1    Peled, D.2
  • 24
    • 0020910824 scopus 로고
    • What good is temporal logic
    • IFIP
    • L. Lamport. What good is temporal logic. In 9th World Congress, pages 657-668. IFIP, 1983.
    • (1983) 9th World Congress , pp. 657-668
    • Lamport, L.1
  • 28
    • 84881160552 scopus 로고    scopus 로고
    • http://wwwbrauer.informatik.tu-muenchen.de/gruppen/theorie/KIT/.
  • 30
    • 0029251055 scopus 로고
    • Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS
    • February
    • Sam Owre, John Rushby, Natarajan Shankar, and Friedrich von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107-125, February 1995.
    • (1995) IEEE Transactions on Software Engineering , vol.21 , Issue.2 , pp. 107-125
    • Owre, S.1    Rushby, J.2    Shankar, N.3    Von Henke, F.4


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