{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:18:10Z","timestamp":1726409890275},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_17","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T09:04:58Z","timestamp":1260176698000},"page":"200-211","source":"Crossref","is-referenced-by-count":0,"title":["Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs"],"prefix":"10.1007","author":[{"given":"Frank S.","family":"de Boer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Immo","family":"Grabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Static Analysis","year":"2008","unstructured":"Alpuente, M., Vidal, G. (eds.): SAS 2008. LNCS, vol.\u00a05079. Springer, Heidelberg (2008)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/1007352.1007390","volume-title":"STOC","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Visibly Pushdown Languages. In: Babai, L. (ed.) STOC, pp. 202\u2013211. ACM, New York (2004)"},{"key":"17_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: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 348\u2013359. Springer, Heidelberg (2005)"},{"issue":"4","key":"17_CR4","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":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-73208-2_15","volume-title":"Developments in Language Theory","author":"D. Carotenuto","year":"2007","unstructured":"Carotenuto, D., Murano, A., Peron, A.: 2-Visibly Pushdown Automata. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 132\u2013144. Springer, Heidelberg (2007)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/11691372_22","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Chaki","year":"2006","unstructured":"Chaki, S., Clarke, E.M., Kidd, N., Reps, T.W., Touili, T.: Verifying Concurrent Message-Passing C Programs with Recursive Calls. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 334\u2013349. Springer, Heidelberg (2006)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/11513988_49","volume-title":"Computer Aided Verification","author":"V. Kahlon","year":"2005","unstructured":"Kahlon, V., Ivancic, 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)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Kidd, N., Lal, A., Reps, T.W.: Language Strength Reduction. In: Alpuente, Vidal [1], pp. 283\u2013298","DOI":"10.1007\/978-3-540-69166-2_19"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Lammich, P., M\u00fcller-Olm, M.: Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors. In: Alpuente, Vidal [1], pp. 205\u2013220","DOI":"10.1007\/978-3-540-69166-2_14"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Ramalingam, G.: Context-Sensitive Synchronization-Sensitive Analysis is Undecidable. ACM Transactions on Programming Languages and Systems\u00a022 (2000)","DOI":"10.1145\/349214.349241"},{"issue":"11-12","key":"17_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0950-5849(98)00093-7","volume":"40","author":"T.W. Reps","year":"1998","unstructured":"Reps, T.W.: Program Analysis via Graph Reachability. Information & Software Technology\u00a040(11-12), 701\u2013726 (1998)","journal-title":"Information & Software Technology"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-47764-0_1","volume-title":"Static Analysis","author":"M.C. Rinard","year":"2001","unstructured":"Rinard, M.C.: Analysis of Multithreaded Programs. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, pp. 1\u201319. Springer, Heidelberg (2001)"},{"key":"#cr-split#-17_CR13.1","doi-asserted-by":"crossref","unstructured":"van den Brand, M., van Deursen, A., Heering, J., de Jong, H., de Jonge, M., Kuipers, T., Klint, P., Moonen, L., Olivier, P., Scheerder, J., Vinju, J., Visser, E., Visser, J.: The asf+sdf Meta-Environment: A Component-Based Language Development Environment. Electronic Notes in Theoretical Computer Science??44(2), 3???8 (2001);","DOI":"10.1016\/S1571-0661(04)80917-4"},{"key":"#cr-split#-17_CR13.2","unstructured":"LDTA 2001, First Workshop on Language Descriptions, Tools and Applications (a Satellite Event of ETAPS??2001)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T04:45:06Z","timestamp":1558673106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}