{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:13:38Z","timestamp":1725491618295},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744061"},{"type":"electronic","value":"9783540744078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74407-8_20","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T10:30:48Z","timestamp":1187433048000},"page":"287-302","source":"Crossref","is-referenced-by-count":11,"title":["Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures"],"prefix":"10.1007","author":[{"given":"Peter","family":"Lammich","sequence":"first","affiliation":[]},{"given":"Markus","family":"M\u00fcller-Olm","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","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":"20_CR2","first-page":"238","volume-title":"Proc. of POPL 1977","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proc. of POPL 1977, Los Angeles, California, pp. 238\u2013252. ACM Press, New York (1977)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-49019-1_2","volume-title":"Foundations of Software Science and Computation Structures","author":"J. Esparza","year":"1999","unstructured":"Esparza, J., Knoop, J.: An automata-theoretic approach to interprocedural data-flow analysis. In: Thomas, W. (ed.) ETAPS 1999 and FOSSACS 1999. LNCS, vol.\u00a01578, pp. 14\u201330. Springer, Heidelberg (1999)"},{"key":"20_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":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/229542.229545","volume":"18","author":"J. Knoop","year":"1996","unstructured":"Knoop, J., Steffen, B., Vollmer, J.: Parallelism for free: Efficient and optimal bitvector analyses for parallel programs. TOPLAS\u00a018(3), 268\u2013299 (1996)","journal-title":"TOPLAS"},{"key":"20_CR6","unstructured":"Lammich, P.: Fixpunkt-basierte optimale Analyse von Programmen mit Thread-Erzeugung. Master\u2019s thesis, University of Dortmund (May 2006)"},{"key":"20_CR7","unstructured":"Lammich, P., M\u00fcller-Olm, M.: Precise fixpoint-based analysis of programs with thread-creation. Version with appendix. Available from \n                    \n                       http:\/\/cs.uni-muenster.de\/u\/mmo\/pubs\/"},{"key":"20_CR8","unstructured":"Lammich, P., M\u00fcller-Olm, M.: Precise fixed point based analysis of programs with thread-creation. In: Proc. of MEMICS 2006, pp. 91\u201398. Faculty of Information Technology, Brno University of Technology (2006)"},{"issue":"1-3","key":"20_CR9","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":"20_CR10","first-page":"647","volume-title":"Proc. of STOC 2001","author":"M. M\u00fcller-Olm","year":"2001","unstructured":"M\u00fcller-Olm, M., Seidl, H.: On optimal slicing of parallel programs. In: Proc. of STOC 2001, pp. 647\u2013656. ACM Press, New York, NY, USA (2001)"},{"key":"20_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999)"},{"issue":"2","key":"20_CR12","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":"20_CR13","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)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2007 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74407-8_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:25:01Z","timestamp":1619504701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74407-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744061","9783540744078"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74407-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}