{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:46:09Z","timestamp":1725515169972},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540691631"},{"type":"electronic","value":"9783540691662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69166-2_14","type":"book-chapter","created":{"date-parts":[[2008,7,13]],"date-time":"2008-07-13T05:25:03Z","timestamp":1215926703000},"page":"205-220","source":"Crossref","is-referenced-by-count":14,"title":["Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors"],"prefix":"10.1007","author":[{"given":"Peter","family":"Lammich","sequence":"first","affiliation":[]},{"given":"Markus","family":"M\u00fcller-Olm","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Artho, C., Havelund, K., Biere, A.: High-level data races. In: Isa\u00edas, P.T., Sedes, F., Augusto, J.C., Ultes-Nitsche, U. (eds.) NDDL\/VVEIS, 2003-08-21, pp. 82\u201393. ICEIS Press (2003) ISBN:972-09916-2-6","DOI":"10.1002\/stvr.281"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2005)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Cousot, P.: Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation. Electronic Notes in Theoretical Computer Science\u00a06 (1997), \n                    \n                      www.elsevier.nl\/locate\/entcs\/volume6.html","DOI":"10.1016\/S1571-0661(05)80168-9"},{"key":"14_CR4","first-page":"1","volume-title":"Proc. of POPL 2000","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Podelski, A.: Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. In: Proc. of POPL 2000, pp. 1\u201311. Springer, Heidelberg (2000)"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/333979.333989","volume":"47","author":"R. Giacobazzi","year":"2000","unstructured":"Giacobazzi, R., Ranzato, F., Scozzari, F.: Making abstract interpretations complete. Journal of the ACM\u00a047(2), 361\u2013416 (2000)","journal-title":"Journal of the ACM"},{"key":"14_CR6","first-page":"101","volume-title":"Proc. of LICS 2006","author":"V. Kahlon","year":"2006","unstructured":"Kahlon, V., Gupta, A.: An automata-theoretic approach for model checking threads for LTL properties. In: Proc. of LICS 2006, pp. 101\u2013110. IEEE Computer Society, Los Alamitos (2006)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Kahlon, V., Gupta, A.: On the analysis of interacting pushdown systems. In: POPL, pp. 303\u2013314 (2007)","DOI":"10.1145\/1190216.1190262"},{"key":"14_CR8","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":"14_CR9","unstructured":"Lammich, P., M\u00fcller-Olm, M.: Conflict analysis of programs with procedures, dynamic thread creation, and monitors. Technical Report, \n                    \n                      http:\/\/cs.uni-muenster.de\/u\/mmo\/pubs\/"},{"key":"14_CR10","unstructured":"Lammich, P., M\u00fcller-Olm, M.: Formalization of conflict analysis of programs with procedures, thread creation, and monitors. In: Klein, G., Nipkow, T., Paulson, L. (eds.) The Archive of Formal Proofs (December 2007), \n                    \n                      http:\/\/afp.sourceforge.net\/entries\/Program-Conflict-Analysis.shtml\n                    \n                    \n                   (Formal proof development)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-74407-8_20","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"P. Lammich","year":"2007","unstructured":"Lammich, P., M\u00fcller-Olm, M.: Precise fixpoint-based analysis of programs with thread-creation. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR. LNCS, vol.\u00a04703, pp. 287\u2013302. Springer, Heidelberg (2007)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/3-540-17162-2_130","volume-title":"Category Theory and Computer Programming","author":"A. Melton","year":"1986","unstructured":"Melton, A., Schmidt, D.A., Strecker, G.E.: Galois connections and computer science applications. In: Poign\u00e9, A., Pitt, D.H., Rydeheard, D.E., Abramsky, S. (eds.) Category Theory and Computer Programming. LNCS, vol.\u00a0240, pp. 299\u2013312. Springer, Heidelberg (1986)"},{"issue":"1-3","key":"14_CR13","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. Theor. Comput. Sci.\u00a0311(1-3), 325\u2013388 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.T.: Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"issue":"2","key":"14_CR15","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. TOPLAS\u00a022(2), 416\u2013430 (2000)","journal-title":"TOPLAS"},{"issue":"4","key":"14_CR16","first-page":"375","volume":"7","author":"H. Seidl","year":"2000","unstructured":"Seidl, H., Steffen, B.: Constraint-Based Inter-Procedural Analysis of Parallel Programs. Nordic Journal of Computing (NJC)\u00a07(4), 375\u2013400 (2000)","journal-title":"Nordic Journal of Computing (NJC)"},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/373243.360206","volume":"36","author":"E. Yahav","year":"2001","unstructured":"Yahav, E.: Verifying safety properties of concurrent Java programs using 3-valued logic. ACM SIGPLAN Notices\u00a036(3), 27\u201340 (2001)","journal-title":"ACM SIGPLAN Notices"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69166-2_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:30:10Z","timestamp":1620001810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69166-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540691631","9783540691662"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69166-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}