메뉴 건너뛰기




Volumn , Issue , 2003, Pages 171-178

Automated verification of the dependability of object-oriented real-time systems

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED VERIFICATION; CONCURRENT OBJECTS; EFFECTIVE APPROACHES; EXECUTABLE SPECIFICATIONS; FUNCTIONAL COMPONENTS; OPERATIONAL SEMANTICS; TEMPORAL MODELING; TIMING CONSTRAINTS;

EID: 84883131864     PISSN: 15301443     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WORDS.2003.1267505     Document Type: Conference Paper
Times cited : (10)

References (24)
  • 2
    • 84976763727 scopus 로고
    • Concurrent object-oriented programming
    • G. Agha. Concurrent object-oriented programming. Communication of the ACM, 33(9):125-141, 1990.
    • (1990) Communication of the ACM , vol.33 , Issue.9 , pp. 125-141
    • Agha, G.1
  • 3
    • 38549139380 scopus 로고    scopus 로고
    • Actors: A model for reasoning about open distributed systems
    • In H. Bowman and J. Derrick, editors chapter 8 Cambridge University Press
    • G. Agha, P. Thati, and R. Ziaei. Actors: a model for reasoning about open distributed systems. In H. Bowman and J. Derrick, editors, Formal Methods for Distributed Processing-An Object Oriented Approach, chapter 8, pages 155-176. Cambridge University Press, 2001.
    • (2001) Formal Methods for Distributed Processing-An Object Oriented Approach , pp. 155-176
    • Agha, G.1    Thati, P.2    Ziaei, R.3
  • 9
    • 84979008720 scopus 로고    scopus 로고
    • Proof-theoretic foundations for the design of actor systems
    • Carlos H. C. Duarte. Proof-theoretic foundations for the design of actor systems. Mathematical Structures in Computer Science, 9(3):227-252, 1999.
    • (1999) Mathematical Structures in Computer Science , vol.9 , Issue.3 , pp. 227-252
    • Duarte, C.H.C.1
  • 11
    • 84949205931 scopus 로고    scopus 로고
    • The refinement relation of graph-based generic programs
    • In M. Jazayeri, R. Loos, and D. Musser, editors, 1998 Springer
    • K. Lieberherr and B. Patt-Shamir. The refinement relation of graph-based generic programs. In M. Jazayeri, R. Loos, and D. Musser, editors, 1998 Schloss Dagstuhl Workshop on Generic Programming, pages 40-52. Springer, 2000.
    • (2000) Schloss Dagstuhl Workshop on Generic Programming , pp. 40-52
    • Lieberherr, K.1    Patt-Shamir, B.2
  • 14
    • 84955586238 scopus 로고    scopus 로고
    • Rewriting logic as a semantic framework for concurrency: A progress report
    • J. Meseguer. Rewriting logic as a semantic framework for concurrency: a progress report. In International Conference on Concurrency Theory, pages 331-372, 1996.
    • (1996) International Conference on Concurrency Theory , pp. 331-372
    • Meseguer, J.1
  • 15
    • 0001981634 scopus 로고    scopus 로고
    • Membership algebra as a logical framework for equational specification
    • J. Meseguer. Membership algebra as a logical framework for equational specification. In Workshop on Algebraic Development Techniques, pages 18-61, 1997.
    • (1997) Workshop on Algebraic Development Techniques , pp. 18-61
    • Meseguer, J.1
  • 22
    • 0035394327 scopus 로고    scopus 로고
    • Using simplicity to control complexity
    • July/August
    • L. Sha. Using simplicity to control complexity. IEEE Software, 18(4):20-28, July/August 2001.
    • (2001) IEEE Software , vol.18 , Issue.4 , pp. 20-28
    • Sha, L.1
  • 23
    • 84883102608 scopus 로고    scopus 로고
    • Upgrading embedded software in the field: Dependability and survivability
    • L. Sha. Upgrading embedded software in the field: Dependability and survivability. Lecture Notes in Computer Science, 2491, 2002.
    • (2002) Lecture Notes in Computer Science , vol.2491
    • Sha, L.1


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