메뉴 건너뛰기




Volumn 6174 LNCS, Issue , 2010, Pages 645-659

Dynamic cutoff detection in parameterized concurrent programs

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE METHODS; BOOLEAN PROGRAMS; COMMUNICATION PROTOCOLS; CONCURRENT PROGRAM; COVERABILITY; ENCODINGS; FINITE STATE PROGRAM; LOW COSTS; PARAMETERIZED; PREDICATE ABSTRACTIONS; REACHABILITY ANALYSIS; SHARED VARIABLES; SOFTWARE VERIFICATION; SPACE COMPLEXITY; STATE REACHABILITY;

EID: 77954993718     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14295-6_55     Document Type: Conference Paper
Times cited : (114)

References (19)
  • 2
    • 35048857405 scopus 로고    scopus 로고
    • Parameterized verification of multithreaded software libraries
    • Margaria, T., Yi, W. (eds.) TACAS 2001. Springer, Heidelberg
    • Ball, T., Chaki, S., Rajamani, S.K.: Parameterized verification of multithreaded software libraries. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 158-173. Springer, Heidelberg (2001)
    • (2001) LNCS , vol.2031 , pp. 158-173
    • Ball, T.1    Chaki, S.2    Rajamani, S.K.3
  • 3
    • 70350235071 scopus 로고    scopus 로고
    • Symbolic counter abstraction for concurrent software
    • Bouajjani, A., Maler, O. (eds.) CAV 2009. Springer, Heidelberg
    • Basler, G., Mazzucchi, M., Wahl, T., Kroening, D.: Symbolic counter abstraction for concurrent software. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 64-78. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5643 , pp. 64-78
    • Basler, G.1    Mazzucchi, M.2    Wahl, T.3    Kroening, D.4
  • 4
    • 29144495877 scopus 로고    scopus 로고
    • A new approach to upward-closed set backward reachability analysis
    • Bingham, J.D.: A new approach to upward-closed set backward reachability analysis. Electr. Notes Theor. Comput. Sci. 138(3), 37-48 (2005)
    • (2005) Electr. Notes Theor. Comput. Sci. , vol.138 , Issue.3 , pp. 37-48
    • Bingham, J.D.1
  • 5
    • 24644508515 scopus 로고    scopus 로고
    • Empirically efficient verification for a class of infinite-state systems
    • Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. Springer, Heidelberg
    • Bingham, J.D., Hu, A.J.: Empirically efficient verification for a class of infinite-state systems. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 77-92. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3440 , pp. 77-92
    • Bingham, J.D.1    Hu, A.J.2
  • 6
    • 27244451169 scopus 로고    scopus 로고
    • Regular symbolic analysis of dynamic networks of pushdown systems
    • Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. Springer, Heidelberg
    • Bouajjani, A., Müller-Olm, M., Touili, T.: Regular symbolic analysis of dynamic networks of pushdown systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 473-487. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3653 , pp. 473-487
    • Bouajjani, A.1    Müller-Olm, M.2    Touili, T.3
  • 7
    • 84976664421 scopus 로고
    • Exponential space complete problems for Petri nets and commutative semigroups: Preliminary report
    • Cardoza, E., Lipton, R.J., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative semigroups: Preliminary report. In: STOC, pp. 50-54 (1976)
    • (1976) STOC , pp. 50-54
    • Cardoza, E.1    Lipton, R.J.2    Meyer, A.R.3
  • 8
    • 35748938218 scopus 로고    scopus 로고
    • Verification of Boolean programs with unbounded thread creation
    • Cook, B., Kroening, D., Sharygina, N.: Verification of Boolean programs with unbounded thread creation. Theor. Comput. Sci. 388(1-3), 227-242 (2007)
    • (2007) Theor. Comput. Sci. , vol.388 , Issue.1-3 , pp. 227-242
    • Cook, B.1    Kroening, D.2    Sharygina, N.3
  • 9
    • 84888244602 scopus 로고    scopus 로고
    • Towards the automated verification of multithreaded Java programs
    • Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. Springer, Heidelberg
    • Delzanno, G., Raskin, J.-F., Begin, L.V.: Towards the automated verification of multithreaded Java programs. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 173-187. Springer, Heidelberg (2002)
    • (2002) LNCS , vol.2280 , pp. 173-187
    • Delzanno, G.1    Raskin, J.-F.2    Begin, L.V.3
  • 10
    • 33646165921 scopus 로고    scopus 로고
    • Covering sharing trees: A compact data structure for parameterized verification
    • Delzanno, G., Raskin, J.-F., Begin, L.V.: Covering sharing trees: a compact data structure for parameterized verification. STTT 5(2-3), 268-297 (2004)
    • (2004) STTT , vol.5 , Issue.2-3 , pp. 268-297
    • Delzanno, G.1    Raskin, J.-F.2    Begin, L.V.3
  • 11
    • 84937416737 scopus 로고    scopus 로고
    • Reducing model checking of the many to the few
    • McAllester, D. (ed.) CADE 2000. Springer, Heidelberg
    • Emerson, E.A., Kahlon, V.: Reducing model checking of the many to the few. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 236-254. Springer, Heidelberg (2000)
    • (2000) LNCS , vol.1831 , pp. 236-254
    • Emerson, E.A.1    Kahlon, V.2
  • 12
    • 0029192405 scopus 로고
    • Reasoning about rings
    • Emerson, E.A., Namjoshi, K.S.: Reasoning about rings. In: POPL, pp. 85-94 (1995)
    • (1995) POPL , pp. 85-94
    • Emerson, E.A.1    Namjoshi, K.S.2
  • 14
    • 58149508172 scopus 로고    scopus 로고
    • From many places to few: Automatic abstraction refinement for Petri nets
    • Ganty, P., Raskin, J.-F., Begin, L.V.: From many places to few: Automatic abstraction refinement for Petri nets. Fundam. Inform. 88(3), 275-305 (2008)
    • (2008) Fundam. Inform. , vol.88 , Issue.3 , pp. 275-305
    • Ganty, P.1    Raskin, J.-F.2    Begin, L.V.3
  • 15
    • 26444577420 scopus 로고    scopus 로고
    • Expand, enlarge and check... made efficient
    • Etessami, K., Rajamani, S.K. (eds.) CAV 2005. Springer, Heidelberg
    • Geeraerts, G., Raskin, J.-F., Begin, L.V.: Expand, enlarge and check. . . made efficient. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 394-407. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3576 , pp. 394-407
    • Geeraerts, G.1    Raskin, J.-F.2    Begin, L.V.3
  • 17
    • 26444440346 scopus 로고    scopus 로고
    • Reasoning about threads communicating via locks
    • Etessami, K., Rajamani, S.K. (eds.) CAV 2005. Springer, Heidelberg
    • Kahlon, V., Ivancic, F., Gupta, A.: Reasoning about threads communicating via locks. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 505-518. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3576 , pp. 505-518
    • Kahlon, V.1    Ivancic, F.2    Gupta, A.3
  • 19
    • 77954012254 scopus 로고    scopus 로고
    • Model checking concurrent linux device drivers
    • Witkowski, T., Blanc, N., Kroening, D., Weissenbacher, G.: Model checking concurrent linux device drivers. In: ASE, pp. 501-504 (2007)
    • (2007) ASE , pp. 501-504
    • Witkowski, T.1    Blanc, N.2    Kroening, D.3    Weissenbacher, G.4


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