{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T18:10:42Z","timestamp":1773943842755,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540374060","type":"print"},{"value":"9783540374114","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817963_29","type":"book-chapter","created":{"date-parts":[[2006,8,5]],"date-time":"2006-08-05T05:07:51Z","timestamp":1154754471000},"page":"300-314","source":"Crossref","is-referenced-by-count":65,"title":["Model Checking Multithreaded Programs with Asynchronous Atomic Methods"],"prefix":"10.1007","author":[{"given":"Koushik","family":"Sen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Autebert, J.-M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. pp. 111\u2013174 (1997)","DOI":"10.1007\/978-3-642-59136-5_3"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-44585-4_25","volume-title":"Computer Aided Verification","author":"T. Ball","year":"2001","unstructured":"Ball, T., Rajamani, S.: The SLAM Toolkit. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 260\u2013264. Springer, Heidelberg (2001)"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/11590156_28","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"A. Bouajjani","year":"2005","unstructured":"Bouajjani, A., Esparza, J., Schwoon, S., Strejcek, J.: Reachability analysis of multithreaded software with asynchronous communication. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 348\u2013359. Springer, Heidelberg (2005)"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. In: Principles of Programming Languages (POPL 2003) (2003)","DOI":"10.1145\/604131.604137"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/11539452_36","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"A. Bouajjani","year":"2005","unstructured":"Bouajjani, A., Mueller-Olm, M., Touili, T.: Regular symbolic analysis of dynamic networks of pushdown systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 473\u2013487. Springer, Heidelberg (2005)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","volume":"106","author":"D. Caucal","year":"1992","unstructured":"Caucal, D.: On the regular structure of prefix rewriting. Theoretical Computer Science\u00a0106, 61\u201386 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"29_CR7","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1109\/TSE.2004.22","volume":"30","author":"S. Chaki","year":"2004","unstructured":"Chaki, S., Clarke, E., Groce, A., Jha, S., Veith, H.: Modular verification of software components in C. IEEE Transactions on Software Engineering (TSE)\u00a030(6), 388\u2013402 (2004)","journal-title":"IEEE Transactions on Software Engineering (TSE)"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-36577-X_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.M. Cobleigh","year":"2003","unstructured":"Cobleigh, J.M., Giannakopoulou, D., Pasareanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol.\u00a02619, pp. 331\u2013346. Springer, Heidelberg (2003)"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"L.E. Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with r distinct prime factors. American Journal of Mathematics\u00a035, 413\u2013422 (1913)","journal-title":"American Journal of Mathematics"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J. Esparza","year":"1998","unstructured":"Esparza, J.: Decidability and complexity of Petri net problems \u2014 An introduction. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 374\u2013428. Springer, Heidelberg (1998)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Esparza, J., Podelski, A.: Efficient algorithms for pre\u2009\u22c6\u2009 and post\u2009\u22c6\u2009 on interprocedural parallel flow graphs. In: Principles of Programming Languages (POPL 2000), pp. 1\u201311 (2000)","DOI":"10.1145\/325694.325697"},{"issue":"1","key":"29_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science\u00a0256(1), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"29_CR13","series-title":"Electronic Notes in Theor. Comp. Sci.","volume-title":"Proc. 2nd Int. Workshop on Verification of Infinite State Systems (INFINITY 1997)","author":"A. Finkel","year":"1997","unstructured":"Finkel, A., Willems, B., Wolper, P.: A direct symbolic approach to model checking pushdown systems. In: Proc. 2nd Int. Workshop on Verification of Infinite State Systems (INFINITY 1997). Electronic Notes in Theor. Comp. Sci., vol.\u00a09. Elsevier, Amsterdam (1997)"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Qadeer, S.: A type and effect system for atomicity. In: Proc. of the ACM SIGPLAN conference on Programming language design and implementation (PLDI 2003) (2003)","DOI":"10.1145\/781131.781169"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Henzinger, T., Jhala, R., Majumdar, R., Sutre, G.: Lazy Abstraction. In: Proc. of the ACM Symposium on Principles of Programming Languages, pp. 58\u201370 (2002)","DOI":"10.1145\/503272.503279"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-540-45069-6_27","volume-title":"Computer Aided Verification","author":"T.A. Henzinger","year":"2003","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Qadeer, S.: Thread-modular abstraction refinement. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 262\u2013274. Springer, Heidelberg (2003)"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Holub, A.: Taming Java Threads. APress (2000)","DOI":"10.1007\/978-1-4302-1129-7"},{"issue":"3","key":"29_CR18","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0097-3165(72)90063-5","volume":"13","author":"J.B. Kruskal","year":"1972","unstructured":"Kruskal, J.B.: The theory of well-quasi-ordering: A frequently discovered concept. Journal of Combinatorial Theory: Series A\u00a013(3), 297\u2013305 (1972)","journal-title":"Journal of Combinatorial Theory: Series A"},{"key":"29_CR19","unstructured":"Lipton, R.: The reachability problem requires exponential space. Technical Report\u00a062, Yale University (1976)"},{"issue":"1\u20132","key":"29_CR20","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0304-3975(00)00306-6","volume":"274","author":"D. Lugiez","year":"2002","unstructured":"Lugiez, D., Schnoebelen, P.: The regular viewpoint on PA-processes. Theoretical Computer Science\u00a0274(1\u20132), 89\u2013115 (2002)","journal-title":"Theoretical Computer Science"},{"key":"29_CR21","unstructured":"Mayr, R.: Decidability and Complexity of Model Checking Problems for Infinite-State Systems. PhD thesis, Technical University Munich (1998)"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Moller, F.: Infinite results. In: Proceedings of the Conference on Concurrency Theory, pp. 195\u2013216 (1996)","DOI":"10.1007\/3-540-61604-7_56"},{"key":"29_CR23","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2003.09.002","volume":"311","author":"M. M\u00fcller-Olm","year":"2004","unstructured":"M\u00fcller-Olm, M.: Precise interprocedural dependence analysis of parallel programs. Theoretical Computer Science\u00a0311, 325\u2013388 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"29_CR24","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. Journal of the ACM\u00a013(4), 570\u2013581 (1966)","journal-title":"Journal of the ACM"},{"key":"29_CR25","unstructured":"Qadeer, S., Rajamani, S., Rehof, J.: Procedure summaries for model checking multithreaded software. In: Principles of Programming Languages (POPL 2004) (2004)"},{"key":"29_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-31980-1_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Qadeer","year":"2005","unstructured":"Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 93\u2013107. Springer, Heidelberg (2005)"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Qadeer, S., Wu, D.: KISS: keep it simple and sequential. In: ACM SIGPLAN 2004 conference on Programming language design and implementation, pp. 14\u201324 (2004)","DOI":"10.1145\/996841.996845"},{"issue":"2","key":"29_CR28","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1145\/349214.349241","volume":"22","author":"G. Ramalingam","year":"2000","unstructured":"Ramalingam, G.: Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst.\u00a022(2), 416\u2013430 (2000)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"29_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Computer Aided Verification","author":"S. Graf","year":"1997","unstructured":"Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 72\u201383. Springer, Heidelberg (1997)"},{"key":"29_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-46425-5_23","volume-title":"Programming Languages and Systems","author":"H. Seidl","year":"2000","unstructured":"Seidl, H., Steffen, B.: Constraint-based inter-procedural analysis of parallel programs. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol.\u00a01782, p. 351. Springer, Heidelberg (2000)"},{"key":"29_CR31","doi-asserted-by":"crossref","unstructured":"Sen, K., Viswanathan, M.: Model checking multithreaded programs with asynchronous atomic methods. Technical Report UIUCDCS-R-2006-2683, UIUC (2006)","DOI":"10.1007\/11817963_29"},{"key":"29_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-540-24851-4_24","volume-title":"ECOOP 2004 \u2013 Object-Oriented Programming","author":"A. Welc","year":"2004","unstructured":"Welc, A., Jagannathan, S., Hosking, A.L.: Transactional monitors for concurrent objects. In: Odersky, M. (ed.) ECOOP 2004. LNCS, vol.\u00a03086, pp. 519\u2013542. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817963_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:58Z","timestamp":1605644158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817963_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374060","9783540374114"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/11817963_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}