메뉴 건너뛰기




Volumn 6887 LNCS, Issue , 2011, Pages 129-145

On sequentializing concurrent programs

Author keywords

[No Author keywords available]

Indexed keywords

COMPOSITIONAL REASONING; CONCURRENT PROGRAM; EXECUTION CONTEXT; GENERAL CLASS; KEY FEATURE; PARAMETERIZED; SEQUENTIAL PROGRAMS; SHARED MEMORIES;

EID: 80053094820     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23702-7_13     Document Type: Conference Paper
Times cited : (32)

References (25)
  • 2
    • 70349966902 scopus 로고    scopus 로고
    • Context-bounded analysis for concurrent programs with dynamic creation of threads
    • Kowalewski, S., Philippou, A. (eds.) LNCS Springer, Heidelberg
    • Atig, M.F., Bouajjani, A., Qadeer, S.: Context-bounded analysis for concurrent programs with dynamic creation of threads. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 107-123. Springer, Heidelberg (2009)
    • (2009) TACAS 2009 , vol.5505 , pp. 107-123
    • Atig, M.F.1    Bouajjani, A.2    Qadeer, S.3
  • 6
    • 85050550846 scopus 로고
    • Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
    • ACM, New York
    • Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL 1977: Proc. 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 238-252. ACM, New York (1977)
    • (1977) POPL 1977: Proc. 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages , pp. 238-252
    • Cousot, P.1    Cousot, R.2
  • 7
    • 34250195633 scopus 로고    scopus 로고
    • BoogiePL: A typed procedural language for checking object-oriented programs
    • Microsoft Research
    • DeLine, R., Leino, K.R.M.: BoogiePL: A typed procedural language for checking object-oriented programs. Technical Report MSR-TR-2005-70, Microsoft Research (2005)
    • (2005) Technical Report MSR-TR-2005-70
    • DeLine, R.1    Leino, K.R.M.2
  • 9
    • 77955020155 scopus 로고    scopus 로고
    • Bounded underapproximations
    • Touili, T., Cook, B., Jackson, P. (eds.) LNCS Springer, Heidelberg
    • Ganty, P., Majumdar, R., Monmege, B.: Bounded underapproximations. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 600-614. Springer, Heidelberg (2010)
    • (2010) CAV 2010 , vol.6174 , pp. 600-614
    • Ganty, P.1    Majumdar, R.2    Monmege, B.3
  • 10
    • 79953169922 scopus 로고    scopus 로고
    • Compositionality entails sequentializability
    • Ab-dulla, P.A., Leino, K.R.M. (eds.) LNCS Springer, Heidelberg
    • Garg, P., Madhusudan, P.: Compositionality entails sequentializability. In: Ab-dulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 26-40. Springer, Heidelberg (2011)
    • (2011) TACAS 2011 , vol.6605 , pp. 26-40
    • Garg, P.1    Madhusudan, P.2
  • 11
    • 78149396969 scopus 로고    scopus 로고
    • Context-bounded translations for concurrent software: An empirical evaluation
    • van de Pol, J., Weber, M. (eds.) LNCS Springer, Heidelberg
    • Ghafari, N., Hu, A.J., Rakamaríc, Z.: Context-bounded translations for concurrent software: An empirical evaluation. In: van de Pol, J., Weber, M. (eds.) Model Checking Software. LNCS, vol. 6349, pp. 227-244. Springer, Heidelberg (2010)
    • (2010) Model Checking Software , vol.6349 , pp. 227-244
    • Ghafari, N.1    Hu, A.J.2    Rakamaríc, Z.3
  • 14
    • 78149400687 scopus 로고    scopus 로고
    • One stack to run them all: Reducing concurrent analysis to sequential analysis under priority scheduling
    • van de Pol, J., Weber, M. (eds.) LNCS Springer, Heidelberg
    • Kidd, N., Jagannathan, S., Vitek, J.: One stack to run them all: Reducing concurrent analysis to sequential analysis under priority scheduling. In: van de Pol, J., Weber, M. (eds.) Model Checking Software. LNCS, vol. 6349, pp. 245-261. Springer, Heidelberg (2010)
    • (2010) Model Checking Software , vol.6349 , pp. 245-261
    • Kidd, N.1    Jagannathan, S.2    Vitek, J.3
  • 15
    • 70350241658 scopus 로고    scopus 로고
    • Reducing context-bounded concurrent reachability to sequential reachability
    • Bouajjani, A., Maler, O. (eds.) LNCS Springer, Heidelberg
    • La Torre, S., Madhusudan, P., Parlato, G.: Reducing context-bounded concurrent reachability to sequential reachability. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 477-492. Springer, Heidelberg (2009)
    • (2009) CAV 2009 , vol.5643 , pp. 477-492
    • La Torre, S.1    Madhusudan, P.2    Parlato, G.3
  • 17
    • 77955003220 scopus 로고    scopus 로고
    • Model-checking parameterized concurrent programs using linear interfaces
    • Touili, T., Cook, B., Jackson, P. (eds.) LNCS Springer, Heidelberg
    • La Torre, S., Madhusudan, P., Parlato, G.: Model-checking parameterized concurrent programs using linear interfaces. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 629-644. Springer, Heidelberg (2010)
    • (2010) CAV 2010 , vol.6174 , pp. 629-644
    • La Torre, S.1    Madhusudan, P.2    Parlato, G.3
  • 19
    • 70350222217 scopus 로고    scopus 로고
    • Static and precise detection of concurrency errors in systems code using SMT solvers
    • Bouajjani, A., Maler, O. (eds.) LNCS Springer, Heidelberg
    • Lahiri, S.K., Qadeer, S., Rakamaríc, Z.: Static and precise detection of concurrency errors in systems code using SMT solvers. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 509-524. Springer, Heidelberg (2009)
    • (2009) CAV 2009 , vol.5643 , pp. 509-524
    • Lahiri, S.K.1    Qadeer, S.2    Rakamaríc, Z.3
  • 20
    • 69049097002 scopus 로고    scopus 로고
    • Reducing concurrent analysis under a context bound to sequential analysis
    • Lal, A., Reps, T.W.: Reducing concurrent analysis under a context bound to sequential analysis. Formal Methods in System Design 35(1), 73-97 (2009)
    • (2009) Formal Methods in System Design , vol.35 , Issue.1 , pp. 73-97
    • Lal, A.1    Reps, T.W.2
  • 21
    • 67650093997 scopus 로고    scopus 로고
    • Iterative context bounding for systematic testing of multithreaded programs
    • DOI 10.1145/1250734.1250785, PLDI'07: Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation
    • Musuvathi, M., Qadeer, S.: Iterative context bounding for systematic testing of multithreaded programs. In: PLDI 2007: Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 446-455. ACM, New York (2007) (Pubitemid 47630711)
    • (2007) Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) , pp. 446-455
    • Musuvathi, M.1    Qadeer, S.2
  • 22
    • 24644522982 scopus 로고    scopus 로고
    • Context-bounded model checking of concurrent software
    • Tools and Algorithms for the Construction and Analysis of Systems - 11th Int. Conference, TACAS 2005, held as part of the Joint European Conf. on Theory and Practice of Software, ETAPS 2005, Proc.
    • Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 93-107. Springer, Heidelberg (2005) (Pubitemid 41273736)
    • (2005) Lecture Notes in Computer Science , vol.3440 , pp. 93-107
    • Qadeer, S.1    Rehof, J.2
  • 25
    • 24344477041 scopus 로고    scopus 로고
    • Weighted pushdown systems and their application to interprocedural dataflow analysis
    • DOI 10.1016/j.scico.2005.02.009, PII S0167642305000493, Static Analysis Symposium 2003
    • Reps, T.W., Schwoon, S., Jha, S., Melski, D.: Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Comput. Program. 58(1-2), 206-263 (2005) (Pubitemid 41261382)
    • (2005) Science of Computer Programming , vol.58 , Issue.1-2 , pp. 206-263
    • Reps, T.1    Schwoon, S.2    Jha, S.3    Melski, D.4


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