메뉴 건너뛰기




Volumn 138, Issue 3, 2005, Pages 153-178

Reachability analysis of synchronized PA systems

Author keywords

Multithreaded programs with procedure calls; Process algebra; Program analysis; Verification

Indexed keywords

COMPUTATIONAL METHODS; CONCURRENT ENGINEERING; MATHEMATICAL MODELS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; SET THEORY;

EID: 29144531211     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.02.063     Document Type: Conference Paper
Times cited : (8)

References (26)
  • 2
    • 35048857405 scopus 로고    scopus 로고
    • Parameterized verification of multithreaded software libraries
    • TACAS'01
    • T. Ball, S. Chaki, and S.K. Rajamani Parameterized verification of multithreaded software libraries TACAS'01 LNCS 2031 2001
    • (2001) LNCS , vol.2031
    • Ball, T.1    Chaki, S.2    Rajamani, S.K.3
  • 3
    • 0029180339 scopus 로고
    • On the Verification Problem of Nonregular Properties for Nonregular Processes
    • IEEE
    • A. Bouajjani, R. Echahed, and P. Habermehl On the Verification Problem of Nonregular Properties for Nonregular Processes LICS'95 1995 IEEE
    • (1995) LICS'95
    • Bouajjani, A.1    Echahed, R.2    Habermehl, P.3
  • 4
    • 84944409047 scopus 로고    scopus 로고
    • Reachability Analysis of Pushdown Automata: Application to Model Checking
    • CONCUR'97
    • A. Bouajjani, J. Esparza, and O. Maler Reachability Analysis of Pushdown Automata: Application to Model Checking CONCUR'97 LNCS 1243 1997
    • (1997) LNCS , vol.1243
    • Bouajjani, A.1    Esparza, J.2    Maler, O.3
  • 5
    • 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'03 2003 ACM
    • (2003) POPL'03
    • Bouajjani, A.1    Esparza, J.2    Touili, T.3
  • 7
    • 35248872936 scopus 로고    scopus 로고
    • Reachability Analysis of Process Rewrite Systems
    • FSTTCS'03
    • Ahmed Bouajjani, and Tayssir Touili Reachability Analysis of Process Rewrite Systems FSTTCS'03 LNCS 2914 2003
    • (2003) LNCS , vol.2914
    • Ahmed, B.1    Tayssir, T.2
  • 8
    • 27244437597 scopus 로고    scopus 로고
    • On computing reachability sets of process rewrite systems
    • Ahmed Bouajjani and Tayssir Touili. On Computing Reachability Sets of Process Rewrite Systems. In proceedings of RTA'05, 2005
    • (2005) Proceedings of RTA'05
    • Bouajjani, A.1    Touili, T.2
  • 12
    • 1442332530 scopus 로고    scopus 로고
    • Toward the automated verification of multithreaded java programs
    • LNCS
    • G. Delzanno, L. Van Begin, and J.-F. Raskin, Toward the automated verification of multithreaded java programs. In TACAS'02. LNCS, 2002
    • (2002) TACAS'02
    • Delzanno, G.1    Van Begin, L.2    Raskin, J.-F.3
  • 14
    • 84944409009 scopus 로고    scopus 로고
    • Efficient algorithm for model checking pushdown systems
    • CAV'00
    • J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon Efficient algorithm for model checking pushdown systems CAV'00 LNCS volume 1885 2000
    • (2000) LNCS , vol.1885
    • Esparza, J.1    Hansel, D.2    Rossmanith, P.3    Schwoon, S.4
  • 15
    • 33745656232 scopus 로고    scopus 로고
    • An automata-theoretic approach to interprocedural data-flow analysis
    • FoSSaCS'99
    • J. Esparza, and J. Knoop An automata-theoretic approach to interprocedural data-flow analysis FoSSaCS'99 LNCS 1578 1999
    • (1999) LNCS , vol.1578
    • Esparza, J.1    Knoop, J.2
  • 16
    • 0033698872 scopus 로고    scopus 로고
    • Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
    • J. Esparza and A. Podelski. Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. In POPL'00, 2000
    • (2000) POPL'00
    • Esparza, J.1    Podelski, A.2
  • 17
  • 18
    • 0003246762 scopus 로고    scopus 로고
    • A Direct Symbolic Approach to Model Checking Pushdown Systems
    • A. Finkel, B. Willems, and P. Wolper A Direct Symbolic Approach to Model Checking Pushdown Systems ENTCS 9 1997
    • (1997) ENTCS , vol.9
    • Finkel, A.1    Willems, B.2    Wolper, P.3
  • 19
    • 29144433614 scopus 로고    scopus 로고
    • Assume-guarantee model checking
    • Microsoft Research, January
    • Cormac Flanagan and Shaz Qadeer. Assume-Guarantee Model Checking. Technical report, Microsoft Research, January 2003
    • (2003) Technical Report
    • Flanagan, C.1    Qadeer, S.2
  • 20
    • 0032597494 scopus 로고    scopus 로고
    • Parikh's Theorem in Commutative Kleene Algebra
    • IEEE
    • M.W. Hopkins, and D.C. Kozen Parikh's Theorem in Commutative Kleene Algebra LICS'99 1999 IEEE
    • (1999) LICS'99
    • Hopkins, M.W.1    Kozen, D.C.2
  • 21
    • 0037028853 scopus 로고    scopus 로고
    • The Regular Viewpoint on PA-processes
    • D. Lugiez, and P. Schnoebelen The Regular Viewpoint on PA-processes TCS 274 1-2 2002
    • (2002) TCS , vol.274 , Issue.1-2
    • Lugiez, D.1    Schnoebelen, P.2
  • 22
    • 27244453260 scopus 로고    scopus 로고
    • Habilitation Thesis. University of Dortmund
    • Markus Müller-Olm. Variations on Constants. Habilitation Thesis. University of Dortmund, 2002
    • (2002) Variations on Constants
    • Müller-Olm, M.1
  • 23
    • 24944520928 scopus 로고    scopus 로고
    • Procedure summaries for model checking multithreaded software
    • S. Qadeer, S.K. Rajamani, and J. Rehof. Procedure Summaries for Model Checking Multithreaded Software. In POPL'04, 2004
    • (2004) POPL'04
    • Qadeer, S.1    Rajamani, S.K.2    Rehof, J.3
  • 24
    • 29144449454 scopus 로고    scopus 로고
    • Context-sensitive synchronization-sensitive analysis is undecidable
    • G. Ramalingam Context-sensitive synchronization-sensitive analysis is undecidable ACM TOPLAS 22 2000 16 430
    • (2000) ACM TOPLAS , vol.22 , pp. 16-430
    • Ramalingam, G.1
  • 25
    • 64649104000 scopus 로고    scopus 로고
    • Analysis of multithreaded programs
    • SAS'01
    • M. Rinard Analysis of multithreaded programs SAS'01 LNCS 2126 2001
    • (2001) LNCS , vol.2126
    • Rinard, M.1
  • 26
    • 84947290808 scopus 로고    scopus 로고
    • Constraint-based inter-procedural analysis of parallel programs
    • H. Seidl, and B. Steffen Constraint-based inter-procedural analysis of parallel programs Nordic Journal of Computing 7 4 2000 75 400
    • (2000) Nordic Journal of Computing , vol.7 , Issue.4 , pp. 75-400
    • Seidl, H.1    Steffen, B.2


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