메뉴 건너뛰기




Volumn 3920 LNCS, Issue , 2006, Pages 334-349

Verifying concurrent message-passing C programs with recursive calls

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT ENGINEERING; CONTEXT FREE LANGUAGES; DATA HANDLING; PROBLEM SOLVING; TELECOMMUNICATION SYSTEMS;

EID: 33745779921     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691372_22     Document Type: Conference Paper
Times cited : (48)

References (28)
  • 1
    • 0000422707 scopus 로고    scopus 로고
    • Context-sensitive synchronization-sensitive analysis is undecidable
    • Ramalingam, G.: Context-sensitive synchronization-sensitive analysis is undecidable. TOPLAS 22 (2000) 416-430
    • (2000) TOPLAS , vol.22 , pp. 416-430
    • Ramalingam, G.1
  • 2
    • 0008606319 scopus 로고    scopus 로고
    • An automata-theoretic approach to interprocedural data-flow analysis
    • Esparza, J., Knoop, J.: An automata-theoretic approach to interprocedural data-flow analysis. In: FOSSACS. (1999)
    • (1999) FOSSACS
    • Esparza, J.1    Knoop, J.2
  • 3
    • 0142087096 scopus 로고    scopus 로고
    • A BDD-based model checker for recursive programs
    • Esparza, J., Schwoon, S.: A BDD-based model checker for recursive programs. In: CAV. (2001)
    • (2001) CAV
    • Esparza, J.1    Schwoon, S.2
  • 4
    • 0000785347 scopus 로고    scopus 로고
    • Reachability analysis of pushdown automata: Application to model checking
    • Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model checking. In: CONCUR. (1997)
    • (1997) CONCUR
    • Bouajjani, A.1    Esparza, J.2    Maler, O.3
  • 5
    • 0003246762 scopus 로고    scopus 로고
    • A direct symbolic approach to model checking pushdown systems
    • Finkel, A., Willems, B., Wolper, P.: A direct symbolic approach to model checking pushdown systems. In: Infinity. (1997)
    • (1997) Infinity
    • Finkel, A.1    Willems, B.2    Wolper, P.3
  • 6
    • 0037967764 scopus 로고    scopus 로고
    • A generic approach to the static analysis of concurrent programs with procedures
    • Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. In: POPL. (2003)
    • (2003) POPL
    • Bouajjani, A.1    Esparza, J.2    Touili, T.3
  • 7
    • 26444574396 scopus 로고    scopus 로고
    • A generic approach to the static analysis of concurrent programs with procedures
    • Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. Int. J. Found, of Comp. Sci. (2003)
    • (2003) Int. J. Found, of Comp. Sci.
    • Bouajjani, A.1    Esparza, J.2    Touili, T.3
  • 8
    • 85050550846 scopus 로고
    • Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points
    • Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In: POPL. (1977)
    • (1977) POPL
    • Cousot, P.1    Cousot, R.2
  • 9
    • 0002296868 scopus 로고    scopus 로고
    • Construction of abstract state graphs with PVS
    • Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: CAV. (1997)
    • (1997) CAV
    • Graf, S.1    Saidi, H.2
  • 12
    • 0000422474 scopus 로고    scopus 로고
    • Automatically validating temporal safety properties of interfaces
    • Ball, T., Rajamani, S.: Automatically validating temporal safety properties of interfaces. In: SPIN. (2001)
    • (2001) SPIN
    • Ball, T.1    Rajamani, S.2
  • 14
  • 16
    • 33745781330 scopus 로고    scopus 로고
    • Verifying concurrent message-passing C programs with recursive calls
    • Univ. of Wisconsin
    • Chaki, S., Clarke, E., Kidd, N., Reps, T., Touili, T: Verifying concurrent message-passing C programs with recursive calls. Tech. Rep. 1532, Univ. of Wisconsin (2005)
    • (2005) Tech. Rep. , vol.1532
    • Chaki, S.1    Clarke, E.2    Kidd, N.3    Reps, T.4    Touili, T.5
  • 20
    • 1442332459 scopus 로고    scopus 로고
    • Weighted pushdown systems and their application to interprocedural dataflow analysis
    • Reps, T., Schwoon, S., Jha, S.: Weighted pushdown systems and their application to interprocedural dataflow analysis. In: SAS. (2003)
    • (2003) SAS
    • Reps, T.1    Schwoon, S.2    Jha, S.3
  • 21
    • 24344477041 scopus 로고    scopus 로고
    • Weighted pushdown systems and their application to interprocedural dataflow analysis
    • Reps, T., Schwoon, S., Jha, S., Melski, D.: Weighted pushdown systems and their application to interprocedural dataflow analysis. SCP 58 (2005)
    • (2005) SCP , vol.58
    • Reps, T.1    Schwoon, S.2    Jha, S.3    Melski, D.4
  • 24
    • 8344288219 scopus 로고    scopus 로고
    • KISS: Keep it simple and sequential
    • Qadeer, S., Wu, D.: KISS: Keep it simple and sequential. In: PLDI. (2004)
    • (2004) PLDI
    • Qadeer, S.1    Wu, D.2
  • 25
    • 26444588312 scopus 로고    scopus 로고
    • Context-bounded model checking of concurrent software
    • Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: TACAS. (2005)
    • (2005) TACAS
    • Qadeer, S.1    Rehof, J.2
  • 26
    • 0019054806 scopus 로고
    • Concurrent manipulation of binary search trees
    • Kung, H., Lehman, P.: Concurrent manipulation of binary search trees. TODS 5 (1980)
    • (1980) TODS , vol.5
    • Kung, H.1    Lehman, P.2
  • 27
    • 2442438903 scopus 로고    scopus 로고
    • Summarizing procedures in concurrent programs
    • Qadeer, S., Rajamani, S., Rehof, J.: Summarizing procedures in concurrent programs. In: POPL. (2004)
    • (2004) POPL
    • Qadeer, S.1    Rajamani, S.2    Rehof, J.3
  • 28
    • 33745770907 scopus 로고    scopus 로고
    • Reasoning about threads communicating via locks
    • Kahlon, V., Ivancic, F., Gupta, A.: Reasoning about threads communicating via locks. In: CAV. (2005)
    • (2005) CAV
    • Kahlon, V.1    Ivancic, F.2    Gupta, A.3


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