메뉴 건너뛰기




Volumn 186, Issue 2, 2003, Pages 355-376

Model checking LTL with regular valuations for pushdown systems

Author keywords

Linear time logic; Model checking; Pushdown automata

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; FORMAL LANGUAGES; FORMAL LOGIC; POLYNOMIALS;

EID: 0142121527     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00139-1     Document Type: Conference Paper
Times cited : (111)

References (13)
  • 1
    • 84947232436 scopus 로고    scopus 로고
    • Bebop: A symbolic model checker for boolean programs
    • SPIN 00: SPIN Workshop, Springer, Berlin
    • T. Ball, S.K. Rajamani, Bebop: a symbolic model checker for boolean programs, SPIN 00: SPIN Workshop, LNCS, vol. 1885, Springer, Berlin, 2000, pp. 113-130.
    • (2000) LNCS , vol.1885 , pp. 113-130
    • Ball, T.1    Rajamani, S.K.2
  • 2
    • 0034963556 scopus 로고    scopus 로고
    • Model checking security properties of control flow graphs
    • F. Besson, T. Jensen, D.L. Métayer, T. Thorn, Model checking security properties of control flow graphs, J. Comput. Secur. 9 (2001) 217-250.
    • (2001) J. Comput. Secur. , vol.9 , pp. 217-250
    • Besson, F.1    Jensen, T.2    Métayer, D.L.3    Thorn, T.4
  • 3
    • 84944409047 scopus 로고    scopus 로고
    • Reachability analysis of pushdown automata: Application to model checking
    • Proceedings of CONCUR'97, Springer, Berlin
    • A. Bouajjani, J. Esparza, O. Maler, Reachability analysis of pushdown automata: application to model checking, Proceedings of CONCUR'97, LNCS, vol. 1243, Springer, Berlin, 1997, pp. 135-150.
    • (1997) LNCS , vol.1243 , pp. 135-150
    • Bouajjani, A.1    Esparza, J.2    Maler, O.3
  • 4
    • 84951123519 scopus 로고    scopus 로고
    • Model checking the full modal mu-calculus for infinite sequential processes
    • Proc. ICALP'97, Springer, Berlin
    • O. Burkart, B. Steffen, Model checking the full modal mu-calculus for infinite sequential processes, Proc. ICALP'97, LNCS, vol. 1256, Springer, Berlin, 1997, pp. 419-429.
    • (1997) LNCS , vol.1256 , pp. 419-429
    • Burkart, O.1    Steffen, B.2
  • 6
    • 0023362541 scopus 로고
    • Modalities for model checking: Branching time logic strikes back
    • E.A. Emerson, C. Lei, Modalities for model checking: branching time logic strikes back, Sci. Comput. Program. 8 (3) (1987) 275-306.
    • (1987) Sci. Comput. Program. , vol.8 , Issue.3 , pp. 275-306
    • Emerson, E.A.1    Lei, C.2
  • 7
    • 84944409009 scopus 로고    scopus 로고
    • Efficient algorithms for model checking pushdown systems
    • Proc. CAV'00, Springer, Berlin
    • J. Esparza, D. Hansel, P. Rossmanith, S. Schwoon, Efficient algorithms for model checking pushdown systems, Proc. CAV'00, LNCS, 1855, Springer, Berlin, 2000, pp. 232-247.
    • (2000) LNCS , vol.1855 , pp. 232-247
    • Esparza, J.1    Hansel, D.2    Rossmanith, P.3    Schwoon, S.4
  • 8
    • 33745656232 scopus 로고    scopus 로고
    • An automata-theoretic approach to interprocedural data-flow analysis
    • Proceedings of FoSSaCS'99, Springer, Berlin
    • J. Esparza, J. Knoop, An automata-theoretic approach to interprocedural data-flow analysis, Proceedings of FoSSaCS'99, LNCS, vol. 1578, Springer, Berlin, 1999, pp. 14-30.
    • (1999) LNCS , vol.1578 , pp. 14-30
    • Esparza, J.1    Knoop, J.2
  • 9
    • 0142087097 scopus 로고    scopus 로고
    • Model-checking LTL with regular valuations for pushdown systems
    • Division of Informatics, University of Edinburgh
    • J. Esparza, A. Kučera, S. Schwoon, Model-checking LTL with regular valuations for pushdown systems, Technical Report EDI-INF-RR0044, Division of Informatics, University of Edinburgh, 2001.
    • (2001) Technical Report , vol.EDI-INF-RR0044
    • Esparza, J.1    Kučera, A.2    Schwoon, S.3
  • 10
    • 84958757867 scopus 로고    scopus 로고
    • A BDD-based model checker for recursive programs
    • Proc. CAV'01, Springer, Berlin
    • J. Esparza, S. Schwoon, A BDD-based model checker for recursive programs, Proc. CAV'01, LNCS, 2102, Springer, Berlin, 2001, pp. 324-336.
    • (2001) LNCS , vol.2102 , pp. 324-336
    • Esparza, J.1    Schwoon, S.2
  • 13
    • 0022704337 scopus 로고
    • Automata theoretic techniques for modal logics of programs
    • M.Y. Vardi, P. Wolper, Automata theoretic techniques for modal logics of programs, J. Comput. Syst. Sci. 32 (1986) 183-221.
    • (1986) J. Comput. Syst. Sci. , vol.32 , pp. 183-221
    • Vardi, M.Y.1    Wolper, P.2


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