메뉴 건너뛰기




Volumn 206, Issue 9-10, 2008, Pages 1161-1177

Verification of scope-dependent hierarchical state machines

Author keywords

Automata; Hierarchical state machines; Model checking; Temporal logic

Indexed keywords

ATOMIC PHYSICS; ATOMS; CANNING; CHLORINE COMPOUNDS; COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; MODEL CHECKING; SPECIFICATIONS;

EID: 50149099553     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2008.03.017     Document Type: Article
Times cited : (20)

References (21)
  • 1
    • 85037030721 scopus 로고    scopus 로고
    • E.M. Clarke, E.A. Emerson, Design and synthesis of synchronization skeletons using branching-time temporal logic, in: D. Kozen (Ed.), Logic of Programs, Lecture Notes in Computer Science, vol. 131, 1981, pp. 52-71.
    • E.M. Clarke, E.A. Emerson, Design and synthesis of synchronization skeletons using branching-time temporal logic, in: D. Kozen (Ed.), Logic of Programs, Lecture Notes in Computer Science, vol. 131, 1981, pp. 52-71.
  • 2
    • 0030165121 scopus 로고    scopus 로고
    • Computer-aided verification
    • Clarke E.M., and Kurshan R.P. Computer-aided verification. IEEE Spectrum 33 6 (1996) 61-67
    • (1996) IEEE Spectrum , vol.33 , Issue.6 , pp. 61-67
    • Clarke, E.M.1    Kurshan, R.P.2
  • 6
    • 0042908982 scopus 로고    scopus 로고
    • Model checking of hierarchical state machines
    • Alur R., and Yannakakis M. Model checking of hierarchical state machines. ACM Trans. Program. Lang. Syst. 23 3 (2001) 273-303
    • (2001) ACM Trans. Program. Lang. Syst. , vol.23 , Issue.3 , pp. 273-303
    • Alur, R.1    Yannakakis, M.2
  • 7
    • 84887432229 scopus 로고    scopus 로고
    • Communicating hierarchical state machines
    • ICALP. Wiedermann J., van Emde Boas P., and Nielsen M. (Eds), Springer
    • Alur R., Kannan S., and Yannakakis M. Communicating hierarchical state machines. In: Wiedermann J., van Emde Boas P., and Nielsen M. (Eds). ICALP. Lecture Notes in Computer Science vol. 1644 (1999), Springer 169-178
    • (1999) Lecture Notes in Computer Science , vol.1644 , pp. 169-178
    • Alur, R.1    Kannan, S.2    Yannakakis, M.3
  • 8
    • 35248871028 scopus 로고    scopus 로고
    • Hierarchical and recursive state machines with context-dependent properties
    • ICALP. Baeten J.C.M., Lenstra J.K., Parrow J., and Woeginger G.J. (Eds), Springer
    • La Torre S., Napoli M., Parente M., and Parlato G. Hierarchical and recursive state machines with context-dependent properties. In: Baeten J.C.M., Lenstra J.K., Parrow J., and Woeginger G.J. (Eds). ICALP. Lecture Notes in Computer Science vol. 2719 (2003), Springer 776-789
    • (2003) Lecture Notes in Computer Science , vol.2719 , pp. 776-789
    • La Torre, S.1    Napoli, M.2    Parente, M.3    Parlato, G.4
  • 9
    • 85047040703 scopus 로고    scopus 로고
    • A. Pnueli, The temporal logic of programs, In: FOCS, IEEE, 1977, pp. 46-57.
    • A. Pnueli, The temporal logic of programs, In: FOCS, IEEE, 1977, pp. 46-57.
  • 10
    • 84944413589 scopus 로고    scopus 로고
    • Efficient reachability analysis of hierarchical reactive machines
    • CAV. Allen Emerson E., and Prasad Sistla A. (Eds), Springer
    • Alur R., Grosu R., and McDougall M. Efficient reachability analysis of hierarchical reactive machines. In: Allen Emerson E., and Prasad Sistla A. (Eds). CAV. Lecture Notes in Computer Science vol. 1855 (2000), Springer 280-295
    • (2000) Lecture Notes in Computer Science , vol.1855 , pp. 280-295
    • Alur, R.1    Grosu, R.2    McDougall, M.3
  • 11
    • 84937546745 scopus 로고    scopus 로고
    • Exploiting behavioral hierarchy for efficient model checking
    • CAV. Brinksma E., and Larsen K.G. (Eds), Springer
    • Alur R., McDougall M., and Yang Z. Exploiting behavioral hierarchy for efficient model checking. In: Brinksma E., and Larsen K.G. (Eds). CAV. Lecture Notes in Computer Science vol. 2404 (2002), Springer 338-342
    • (2002) Lecture Notes in Computer Science , vol.2404 , pp. 338-342
    • Alur, R.1    McDougall, M.2    Yang, Z.3
  • 13
    • 35048839796 scopus 로고    scopus 로고
    • A temporal logic of nested calls and returns
    • TACAS. Jensen K., and Podelski A. (Eds), Springer
    • Alur R., Etessami K., and Madhusudan P. A temporal logic of nested calls and returns. In: Jensen K., and Podelski A. (Eds). TACAS. Lecture Notes in Computer Science vol. 2988 (2004), Springer 467-481
    • (2004) Lecture Notes in Computer Science , vol.2988 , pp. 467-481
    • Alur, R.1    Etessami, K.2    Madhusudan, P.3
  • 14
    • 35048869340 scopus 로고    scopus 로고
    • Structural model checking for communicating hierarchical machines
    • MFCS. Fiala J., Koubek V., and Kratochvíl J. (Eds), Springer
    • Lanotte R., Maggiolo-Schettini A., and Peron A. Structural model checking for communicating hierarchical machines. In: Fiala J., Koubek V., and Kratochvíl J. (Eds). MFCS. Lecture Notes in Computer Science vol. 3153 (2004), Springer 525-536
    • (2004) Lecture Notes in Computer Science , vol.3153 , pp. 525-536
    • Lanotte, R.1    Maggiolo-Schettini, A.2    Peron, A.3
  • 15
    • 33745642477 scopus 로고    scopus 로고
    • Verification of well-formed communicating recursive state machines
    • VMCAI. Allen Emerson E., and Namjoshi K.S. (Eds), Springer
    • Bozzelli L., La Torre S., and Peron A. Verification of well-formed communicating recursive state machines. In: Allen Emerson E., and Namjoshi K.S. (Eds). VMCAI. Lecture Notes in Computer Science vol. 3855 (2006), Springer 412-426
    • (2006) Lecture Notes in Computer Science , vol.3855 , pp. 412-426
    • Bozzelli, L.1    La Torre, S.2    Peron, A.3
  • 16
    • 26444569586 scopus 로고    scopus 로고
    • Modular strategies for recursive game graphs
    • TACAS. Garavel H., and Hatcliff J. (Eds), Springer
    • Alur R., La Torre S., and Madhusudan P. Modular strategies for recursive game graphs. In: Garavel H., and Hatcliff J. (Eds). TACAS. Lecture Notes in Computer Science vol. 2619 (2003), Springer 363-378
    • (2003) Lecture Notes in Computer Science , vol.2619 , pp. 363-378
    • Alur, R.1    La Torre, S.2    Madhusudan, P.3
  • 17
    • 33644689137 scopus 로고    scopus 로고
    • Modular strategies for infinite games on recursive graphs
    • CAV. Hunt Jr. W.A., and Somenzi F. (Eds), Springer
    • Alur R., La Torre S., and Madhusudan P. Modular strategies for infinite games on recursive graphs. In: Hunt Jr. W.A., and Somenzi F. (Eds). CAV. Lecture Notes in Computer Science vol. 2725 (2003), Springer 67-79
    • (2003) Lecture Notes in Computer Science , vol.2725 , pp. 67-79
    • Alur, R.1    La Torre, S.2    Madhusudan, P.3
  • 18
    • 50149114331 scopus 로고    scopus 로고
    • E.A. Emerson, Temporal and modal logic, in: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), 1990, pp. 995-1072.
    • E.A. Emerson, Temporal and modal logic, in: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), 1990, pp. 995-1072.
  • 19
    • 0022704337 scopus 로고
    • Automata-theoretic techniques for modal logics of programs
    • Vardi M.Y., and Wolper P. Automata-theoretic techniques for modal logics of programs. J. Comput. Syst. Sci. 32 2 (1986) 183-221
    • (1986) J. Comput. Syst. Sci. , vol.32 , Issue.2 , pp. 183-221
    • Vardi, M.Y.1    Wolper, P.2
  • 20
    • 84947232436 scopus 로고    scopus 로고
    • Bebop: A symbolic model checker for boolean programs
    • SPIN. Havelund K., Penix J., and Visser W. (Eds), Springer
    • Ball T., and Rajamani S.K. Bebop: A symbolic model checker for boolean programs. In: Havelund K., Penix J., and Visser W. (Eds). SPIN. Lecture Notes in Computer Science vol. 1885 (2000), Springer 113-130
    • (2000) Lecture Notes in Computer Science , vol.1885 , pp. 113-130
    • Ball, T.1    Rajamani, S.K.2


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