{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:00:03Z","timestamp":1725732003065},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642388552"},{"type":"electronic","value":"9783642388569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38856-9_25","type":"book-chapter","created":{"date-parts":[[2013,6,15]],"date-time":"2013-06-15T00:05:28Z","timestamp":1371254728000},"page":"477-498","source":"Crossref","is-referenced-by-count":6,"title":["Contextual Locking for Dynamic Pushdown Networks"],"prefix":"10.1007","author":[{"given":"Peter","family":"Lammich","sequence":"first","affiliation":[]},{"given":"Markus","family":"M\u00fcller-Olm","sequence":"additional","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wenner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Bonnet, R., Chadha, R.: Bounded context-switching and reentrant locking. In: Pfenning, F. (ed.) FOSSACS 2013. LNCS, vol.\u00a07794, pp. 65\u201380. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-37075-5_5"},{"issue":"4","key":"25_CR2","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1142\/S0129054103001893","volume":"14","author":"A. Bouajjani","year":"2003","unstructured":"Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. Int. J. Found. Comput. Sci.\u00a014(4), 551 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"25_CR3","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., M\u00fcller-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":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-28756-5_30","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Chadha","year":"2012","unstructured":"Chadha, R., Madhusudan, P., Viswanathan, M.: Reachability under contextual locking. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol.\u00a07214, pp. 437\u2013450. Springer, Heidelberg (2012)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Esparza, J., Ganty, P.: Complexity of pattern-based verification for multithreaded programs. In: POPL, pp. 499\u2013510. ACM (2011)","DOI":"10.1145\/1925844.1926443"},{"issue":"1-2","key":"25_CR6","first-page":"63","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci.\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Comput. Sci."},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-18275-4_15","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"T.M. Gawlitza","year":"2011","unstructured":"Gawlitza, T.M., Lammich, P., M\u00fcller-Olm, M., Seidl, H., Wenner, A.: Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic process creation. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol.\u00a06538, pp. 199\u2013213. Springer, Heidelberg (2011)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Kahlon, V.: Boundedness vs. unboundedness of lock chains: Characterizing decidability of pairwise cfl-reachability for threads communicating via locks. In: LICS, pp. 27\u201336. IEEE Computer Society (2009)","DOI":"10.1109\/LICS.2009.45"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-23217-6_30","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"V. Kahlon","year":"2011","unstructured":"Kahlon, V.: Reasoning about threads with bounded lock chains. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 450\u2013465. Springer, Heidelberg (2011)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/11513988_49","volume-title":"Computer Aided Verification","author":"V. Kahlon","year":"2005","unstructured":"Kahlon, V., Ivan\u010di\u0107, F., Gupta, A.: Reasoning about threads communicating via locks. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 505\u2013518. Springer, Heidelberg (2005)"},{"issue":"2","key":"25_CR11","first-page":"210","volume":"95","author":"J.B. Kruskal","year":"1960","unstructured":"Kruskal, J.B.: Well-quasi-ordering, the tree theorem, and vazsonyi\u2019s conjecture. Trans. of the American Math. Society\u00a095(2), 210\u2013225 (1960)","journal-title":"Trans. of the American Math. Society"},{"key":"25_CR12","unstructured":"Lammich, P.: Lock-Sensitive Analysis of Parallel Programs. Ph.D. thesis, WWU M\u00fcnster (June 2011)"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-69166-2_14","volume-title":"Static Analysis","author":"P. Lammich","year":"2008","unstructured":"Lammich, P., M\u00fcller-Olm, M.: Conflict analysis of programs with procedures, dynamic thread creation, and monitors. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol.\u00a05079, pp. 205\u2013220. Springer, Heidelberg (2008)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-02658-4_39","volume-title":"Computer Aided Verification","author":"P. Lammich","year":"2009","unstructured":"Lammich, P., M\u00fcller-Olm, M., Wenner, A.: Predecessor sets of dynamic pushdown networks with tree-regular constraints. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 525\u2013539. Springer, Heidelberg (2009)"},{"key":"25_CR15","unstructured":"Mayr, R.: Decidability and Complexity of Model Checking Problems for Infinite-State Systems. Ph.D. thesis, TU M\u00fcnchen (April 1998)"},{"key":"25_CR16","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)"},{"issue":"2","key":"25_CR17","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."},{"issue":"4","key":"25_CR18","first-page":"375","volume":"7","author":"H. Seidl","year":"2000","unstructured":"Seidl, H., Steffen, B.: Constraint-based inter-procedural analysis of parallel programs. Nord. J. Comput.\u00a07(4), 375\u2013400 (2000)","journal-title":"Nord. J. Comput."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38856-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:48:32Z","timestamp":1557794912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38856-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642388552","9783642388569"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38856-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}