{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:45:17Z","timestamp":1725486317664},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540416951"},{"type":"electronic","value":"9783540446934"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44693-1_43","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T01:10:18Z","timestamp":1181610618000},"page":"490-501","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of Copy Constant Detection in Parallel Programs"],"prefix":"10.1007","author":[{"given":"Markus","family":"M\u00fcller-Olm","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,16]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"S. A. Cook. The complexity of theorem-proving procedures. In ACM STOC\u201971, pages 151\u2013158, 1971.","DOI":"10.1145\/800157.805047"},{"key":"43_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/3-540-49019-1_2","volume-title":"FOSSACS\u2019 99","author":"J. Esparza","year":"1999","unstructured":"J. Esparza and J. Knoop. An automata-theoretic approach to interprocedural data-flow analysis. In FOSSACS\u2019 99, LNCS 1578, pages 14\u201330. Springer, 1999."},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"J. Esparza and A. Podelski. Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. In ACM POPL\u20192000, pages 1\u201311, 2000.","DOI":"10.1145\/325694.325697"},{"key":"43_CR4","first-page":"1","volume":"50","author":"R. Giegerich","year":"1981","unstructured":"R. Giegerich, U. M\u00f6ncke, and R. Wilhelm. Invariance of approximative semantics with respect to program transformations. In GI 11. Jahrestagung, Informatik Fachberichte 50, pages 1\u201310. Springer, 1981.","journal-title":"GI 11. Jahrestagung"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"G. A. Kildall. A unified approach to global program optimization. In ACM POPL\u201973, pages 194\u2013206, 1973.","DOI":"10.1145\/512927.512945"},{"key":"43_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/BFb0057887","volume-title":"Euro-Par\u201998","author":"J. Knoop","year":"1998","unstructured":"J. Knoop. Parallel constant propagation. In Euro-Par\u201998, LNCS 1470, pages 445\u2013455. Springer, 1998."},{"issue":"3","key":"43_CR7","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/229542.229545","volume":"18","author":"J. Knoop","year":"1996","unstructured":"J. Knoop, B. Steffen, and J. Vollmer. Parallelism for free: Efficient and optimal bitvector analyses for parallel programs. ACM Transactions on Programming Languages and Systems, 18(3):268\u2013299, 1996.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"43_CR8","volume-title":"Advanced compiler design and implementation","author":"S. S. Muchnick","year":"1997","unstructured":"S. S. Muchnick. Advanced compiler design and implementation. Morgan Kaufmann Publishers, San Francisco, California, 1997."},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"R. Muth and S. Debray. On the complexity of flow-sensitive dataflow analysis. In ACM POPL\u20192000, pages 67\u201381, 2000.","DOI":"10.1145\/325694.325704"},{"key":"43_CR10","unstructured":"C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994."},{"key":"43_CR11","unstructured":"G. Ramalingam. Context-sensitive synchronization-sensitive analysis is undecidable. Technical Report RC 21493, IBM T. J. Watson Research Center, 1999. To appear in TOPLAS."},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"J. R. Reif and H. R. Lewis. Symbolic evaluation and the global value graph. In ACM POPL\u201977, pages 104\u2013118, 1977.","DOI":"10.1145\/512950.512961"},{"key":"43_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-46425-5_23","volume-title":"ESOP\u20192000","author":"H. Seidl","year":"2000","unstructured":"H. Seidl and B. Steffen. Constraint-based interprocedural analysis of parallel programs. In ESOP\u20192000, LNCS 1782, pages 351\u2013365. Springer, 2000."},{"key":"43_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF00263928","volume":"19","author":"R. N. Taylor","year":"1983","unstructured":"R. N. Taylor. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica, 19:57\u201384, 1983.","journal-title":"Acta Informatica"},{"key":"43_CR15","first-page":"121","volume":"3","author":"F. Tip","year":"1995","unstructured":"F. Tip. A survey of program slicing techniques. Journal of Programming Languages, 3:121\u2013181, 1995.","journal-title":"Journal of Programming Languages"},{"issue":"4","key":"43_CR16","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1109\/TSE.1984.5010248","volume":"10","author":"M. Weiser","year":"1984","unstructured":"M. Weiser. Program slicing. IEEE Transactions on Software Engineering, SE-10(4):352\u2013357, 1984.","journal-title":"IEEE Transactions on Software Engineering"}],"container-title":["Lecture Notes in Computer Science","STACS 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44693-1_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T21:30:03Z","timestamp":1556487003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44693-1_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416951","9783540446934"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44693-1_43","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}