메뉴 건너뛰기




Volumn 2215, Issue , 2001, Pages 316-339

Model-checking LTL with regular valuations for pushdown systems

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; DATA FLOW ANALYSIS;

EID: 84978974912     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45500-0_16     Document Type: Conference Paper
Times cited : (29)

References (11)
  • 2
    • 84944409047 scopus 로고    scopus 로고
    • Reachability analysis of pushdown automata: Application to model checking
    • LNCS
    • A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model checking. In Proc. CONCUR'97, LNCS 1243, pages 135-150.
    • Proc. CONCUR'97 , pp. 135-150
    • Bouajjani, A.1    Esparza, J.2    Maler, O.3
  • 3
    • 84951123519 scopus 로고    scopus 로고
    • Model checking the full modal mu-calculus for infinite sequential processes
    • Springer
    • O. Burkart and B. Steffen. Model checking the full modal mu-calculus for infinite sequential processes. In Proc. ICALP'97, volume 1256 of LNCS, pages 419-429. Springer, 1997.
    • (1997) Proc. ICALP'97, volume 1256 of LNCS , pp. 419-429
    • Burkart, O.1    Steffen, B.2
  • 5
    • 0023362541 scopus 로고
    • Modalities for model checking: Branching time logic strikes back
    • E. A. Emerson and C. Lei. Modalities for model checking: Branching time logic strikes back. Science of Computer Programming, 8(3): 275-306, 1987.
    • (1987) Science of Computer Programming , vol.8 , Issue.3 , pp. 275-306
    • Emerson, E.A.1    Lei, C.2
  • 6
    • 84944409009 scopus 로고    scopus 로고
    • Efficient algorithms for model checking pushdown systems
    • LNCS 1855,. Springer
    • J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Proc. CAV'00, LNCS 1855, pages 232-247. Springer, 2000.
    • (2000) Proc. CAV'00 , pp. 232-247
    • Esparza, J.1    Hansel, D.2    Rossmanith, P.3    Schwoon, S.4
  • 7
    • 33745656232 scopus 로고    scopus 로고
    • An automata-theoretic approach to interprocedural data-flow analysis
    • Springer
    • J. Esparza and J. Knoop. An automata-theoretic approach to interprocedural data-flow analysis. In Proceedings of FoSSaCS'99, volume 1578 of LNCS, pages 14-30. Springer, 1999.
    • (1999) Proceedings of FoSSaCS'99, volume 1578 of LNCS , pp. 14-30
    • Esparza, J.1    Knoop, J.2
  • 8
    • 84958757867 scopus 로고    scopus 로고
    • A BDD-based model checker for recursive programs
    • LNCS 2102,. Springer
    • J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In Proc. CAV'01, LNCS 2102, pages 324-336. Springer, 2001.
    • (2001) Proc. CAV'01 , pp. 324-336
    • Esparza, J.1    Schwoon, S.2


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