메뉴 건너뛰기
Theoretical Computer Science
Volumn 411, Issue 38-39, 2010, Pages 3460-3468
Verifying parallel programs with dynamic communication structures
Author keywords

Concurrent programs; Model checking; Pushdown Networks; Reachability analysis; Recognizable sets
Indexed keywords

COMMUNICATION STRUCTURES; CONCURRENT PROGRAM; CONTROL STATE; DYNAMIC COMMUNICATION; DYNAMIC NETWORK; GENERAL MODEL; PARALLEL PROGRAM; PHASE GRAPHS; PROCEDURE CALL; PUSHDOWN NETWORKS; PUSHDOWN SYSTEMS; REACHABILITY; REACHABILITY ANALYSIS; REACHABILITY PROBLEM; RECOGNIZABLE SETS; SEMI-DECISION PROCEDURES; VERIFICATION PROBLEMS; WINDOWS NT;
EID: 77955854305     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.05.028     Document Type: Conference Paper
Times cited : (7)
References (25)
  • 1
    • 33745656232 scopus 로고    scopus 로고
    • An automata-theoretic approach to interprocedural data-flow analysis
    • FoSSaCS, Springer
    • J. Esparza, and J. Knoop An automata-theoretic approach to interprocedural data-flow analysis FoSSaCS LNCS vol. 1578 1999 Springer 14 30
    • (1999) LNCS , vol.1578 , pp. 14-30
    • Esparza, J.1    Knoop, J.2
  • 2
    • 84958757867 scopus 로고    scopus 로고
    • A BDD-based model checker for recursive programs
    • CAV, Springer
    • J. Esparza, and S. Schwoon A BDD-based model checker for recursive programs CAV LNCS vol. 2102 2001 Springer 324 336
    • (2001) LNCS , vol.2102 , pp. 324-336
    • Esparza, J.1    Schwoon, S.2
  • 3
    • 35248814801 scopus 로고    scopus 로고
    • Weighted pushdown systems and their application to interprocedural dataflow analysis
    • SAS, Springer
    • T. Reps, S. Schwoon, and S. Jha Weighted pushdown systems and their application to interprocedural dataflow analysis SAS LNCS vol. 2694 2003 Springer 189 213
    • (2003) LNCS , vol.2694 , pp. 189-213
    • Reps, T.1    Schwoon, S.2    Jha, S.3
  • 4
    • 84944409047 scopus 로고    scopus 로고
    • Reachability analysis of pushdown automata: Application to model-checking
    • CONCUR, Springer
    • A. Bouajjani, J. Esparza, and O. Maler Reachability analysis of pushdown automata: application to model-checking CONCUR LNCS vol. 1243 1997 Springer 135 150
    • (1997) LNCS , vol.1243 , pp. 135-150
    • Bouajjani, A.1    Esparza, J.2    Maler, O.3
  • 6
    • 0037967764 scopus 로고    scopus 로고
    • A generic approach to the static analysis of concurrent programs with procedures
    • ACM
    • A. Bouajjani, J. Esparza, and T. Touili A generic approach to the static analysis of concurrent programs with procedures POPL 2003 ACM 62 73
    • (2003) POPL , pp. 62-73
    • Bouajjani, A.1    Esparza, J.2    Touili, T.3
  • 7
    • 24644522982 scopus 로고    scopus 로고
    • Context-bounded model checking of concurrent software
    • TACAS, Springer
    • S. Qadeer, and J. Rehof Context-bounded model checking of concurrent software TACAS LNCS vol. 3440 2005 Springer 93 107
    • (2005) LNCS , vol.3440 , pp. 93-107
    • Qadeer, S.1    Rehof, J.2
  • 8
    • 27244451169 scopus 로고    scopus 로고
    • Regular symbolic analysis of dynamic networks of pushdown systems
    • CONCUR, Springer
    • A. Bouajjani, M. Mller-Olm, and T. Touili Regular symbolic analysis of dynamic networks of pushdown systems CONCUR LNCS vol. 3653 2005 Springer 473 487
    • (2005) LNCS , vol.3653 , pp. 473-487
    • Bouajjani, A.1    Mller-Olm, M.2    Touili, T.3
  • 9
    • 33744902357 scopus 로고    scopus 로고
    • Reachability analysis of multithreaded software with asynchronous communication
    • FSTTCS, Springer
    • A. Bouajjani, J. Esparza, S. Schwoon, and J. Strejcek Reachability analysis of multithreaded software with asynchronous communication FSTTCS LNCS vol. 3821 2005 Springer 348 359
    • (2005) LNCS , vol.3821 , pp. 348-359
    • Bouajjani, A.1    Esparza, J.2    Schwoon, S.3    Strejcek, J.4
  • 10
    • 33745779921 scopus 로고    scopus 로고
    • Verifying concurrent message-passing C programs with recursive calls
    • TACAS, Springer
    • S. Chaki, E. Clarke, N. Kidd, T. Reps, and T. Touili Verifying concurrent message-passing C programs with recursive calls TACAS LNCS vol. 3920 2006 Springer 334 349
    • (2006) LNCS , vol.3920 , pp. 334-349
    • Chaki, S.1    Clarke, E.2    Kidd, N.3    Reps, T.4    Touili, T.5
  • 11
    • 54249120819 scopus 로고    scopus 로고
    • On the reachability analysis of acyclic networks of pushdown systems
    • CONCUR, Springer
    • M.F. Atig, A. Bouajjani, and T. Touili On the reachability analysis of acyclic networks of pushdown systems CONCUR LNCS vol. 5201 2008 Springer 356 371
    • (2008) LNCS , vol.5201 , pp. 356-371
    • Atig, M.F.1    Bouajjani, A.2    Touili, T.3
  • 12
    • 54249098716 scopus 로고    scopus 로고
    • Symbolic context-bounded analysis of multithreaded Java programs
    • D. Suwimonteerabuth, J. Esparza, S. Schwoon, Symbolic context-bounded analysis of multithreaded Java programs, in: SPIN, 2008, pp. 270287.
    • (2008) SPIN , pp. 270-287
    • Suwimonteerabuth, D.1    Esparza, J.2    Schwoon, S.3
  • 13
    • 8344288219 scopus 로고    scopus 로고
    • Kiss: Keep it simple and sequential
    • ACM
    • S. Qadeer, and D. Wu Kiss: keep it simple and sequential PLDI 2004 ACM 14 24
    • (2004) PLDI , pp. 14-24
    • Qadeer, S.1    Wu, D.2
  • 14
    • 84945955894 scopus 로고    scopus 로고
    • The regular viewpoint on pa-processes
    • CONCUR, Springer
    • D. Lugiez, and P. Schnoebelen The regular viewpoint on pa-processes CONCUR LNCS vol. 1466 1998 Springer 50 66
    • (1998) LNCS , vol.1466 , pp. 50-66
    • Lugiez, D.1    Schnoebelen, P.2
  • 15
    • 0033698872 scopus 로고    scopus 로고
    • Efficient algorithms for pre- and post- on interprocedural parallel flow graphs
    • ACM
    • J. Esparza, and A. Podelski Efficient algorithms for pre- and post- on interprocedural parallel flow graphs POPL 2000 ACM 1 11
    • (2000) POPL , pp. 1-11
    • Esparza, J.1    Podelski, A.2
  • 16
    • 84947290808 scopus 로고    scopus 로고
    • Constraint-based inter-procedural analysis of parallel programs
    • ESOP, Springer
    • H. Seidl, and B. Steffen Constraint-based inter-procedural analysis of parallel programs ESOP LNCS vol. 1782 2000 Springer 351 365
    • (2000) LNCS , vol.1782 , pp. 351-365
    • Seidl, H.1    Steffen, B.2
  • 17
    • 27244453260 scopus 로고    scopus 로고
    • Variations on constants
    • Dortmund University
    • M. Müller-Olm, Variations on constants, Habilitation thesis, Dortmund University, 2002.
    • (2002) Habilitation Thesis
    • Müller-Olm, M.1
  • 18
    • 35248872936 scopus 로고    scopus 로고
    • Reachability analysis of process rewrite systems
    • FSTTCS, Springer
    • A. Bouajjani, and T. Touili Reachability analysis of process rewrite systems FSTTCS LNCS vol. 2914 2003 Springer 74 87
    • (2003) LNCS , vol.2914 , pp. 74-87
    • Bouajjani, A.1    Touili, T.2
  • 19
    • 24944536280 scopus 로고    scopus 로고
    • On computing reachability sets of process rewrite systems
    • RTA, Springer
    • A. Bouajjani, and T. Touili On computing reachability sets of process rewrite systems RTA LNCS vol. 3467 2005 Springer 484 499
    • (2005) LNCS , vol.3467 , pp. 484-499
    • Bouajjani, A.1    Touili, T.2
  • 20
    • 82755165825 scopus 로고    scopus 로고
    • A robust class of context-sensitive languages
    • IEEE Computer Society
    • S.L. Torre, P. Madhusudan, and G. Parlato A robust class of context-sensitive languages LICS 2007 IEEE Computer Society 161 170
    • (2007) LICS , pp. 161-170
    • Torre, S.L.1    Madhusudan, P.2    Parlato, G.3
  • 21
    • 26444440346 scopus 로고    scopus 로고
    • Reasoning about threads communicating via locks
    • CAV, Springer
    • V. Kahlon, F. Ivancic, and A. Gupta Reasoning about threads communicating via locks CAV LNCS vol. 3576 2005 Springer 505 518
    • (2005) LNCS , vol.3576 , pp. 505-518
    • Kahlon, V.1    Ivancic, F.2    Gupta, A.3
  • 22
    • 34548241752 scopus 로고    scopus 로고
    • On the analysis of interacting pushdown systems
    • ACM
    • V. Kahlon, and A. Gupta On the analysis of interacting pushdown systems POPL 2007 ACM 303 314
    • (2007) POPL , pp. 303-314
    • Kahlon, V.1    Gupta, A.2
  • 23
    • 38149068191 scopus 로고    scopus 로고
    • Decidability results for well-structured transition systems with auxiliary storage
    • Springer
    • R. Chadha, and M. Viswanathan Decidability results for well-structured transition systems with auxiliary storage CONCUR LNCS vol. 4703 2007 Springer 136 150
    • (2007) CONCUR LNCS , vol.4703 , pp. 136-150
    • Chadha, R.1    Viswanathan, M.2
  • 24
    • 47249155301 scopus 로고    scopus 로고
    • Context-bounded analysis of concurrent queue systems
    • TACAS, Springer
    • S.L. Torre, P. Madhusudan, and G. Parlato Context-bounded analysis of concurrent queue systems TACAS LNCS vol. 4963 2008 Springer 299 314
    • (2008) LNCS , vol.4963 , pp. 299-314
    • Torre, S.L.1    Madhusudan, P.2    Parlato, G.3
  • 25
    • 77951462945 scopus 로고    scopus 로고
    • Reachability analysis of communicating pushdown systems
    • FOSSACS, Springer
    • A. Heußner, J. Leroux, A. Muscholl, and G. Sutre Reachability analysis of communicating pushdown systems FOSSACS LNCS vol. 6014 2010 Springer 267 281
    • (2010) LNCS , vol.6014 , pp. 267-281
    • Heußner, A.1    Leroux, J.2    Muscholl, A.3    Sutre, G.4

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