{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:16Z","timestamp":1725663796164},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573142"},{"type":"electronic","value":"9783540480556"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57314-3_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:46:45Z","timestamp":1330260405000},"page":"151-165","source":"Crossref","is-referenced-by-count":0,"title":["Identifying the available parallelism using static analysis"],"prefix":"10.1007","author":[{"given":"Spiridon","family":"Kalogeropulos","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"issue":"Num.6","key":"13_CR1","first-page":"296","volume":"25","author":"David R. R. Chase","year":"1990","unstructured":"David R. Chase, Mark Wegman, and F. Kenneth Zadeck. Analysis of Pointers and Structures. SIGPLAN'90 Conference on Programming Language Design and Implementation, Vol. 25, Num. 6, pages 296\u2013310, June 1990.","journal-title":"SIGPLAN'90 Conference on Programming Language Design and Implementation"},{"issue":"number7","key":"13_CR2","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/74818.74823","volume":"25","author":"R. Cytron","year":"1989","unstructured":"Ron Cytron, Michael Hind, and Wilson Hsieh. Automatic Generation of DAG Parallelism. SIGPLAN notices, volume 25, number 7, pages 54\u201368, July 1989.","journal-title":"SIGPLAN notices"},{"issue":"Num.7","key":"13_CR3","first-page":"28","volume":"24","author":"S. Horwitz","year":"1989","unstructured":"Susan Horwitz, Phil Pfeiffer, and Thomas Reps. Dependence Analysis for Pointer Variables. Proceedings of the SIGPLAN '89 Symposium on Compiler Construction, Vol. 24, Num. 7, pages 28\u201340, June 1989.","journal-title":"Proceedings of the SIGPLAN '89 Symposium on Compiler Construction"},{"key":"13_CR4","unstructured":"N. D. Jones and S. S. Muchnick. Flow Analysis and Optimization of LISP-like Strutures. Program Flow Analysis: Theory and Applications, chapter 4, pages 102\u2013131, Prentice-Hall, 1981."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"N. D. Jones and S. S. Muchnick. A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures. 9th Annual ACM Symposium on Principles of Programming Languages, pages 66\u201374, January 1982.","DOI":"10.1145\/582153.582161"},{"key":"13_CR6","unstructured":"Spiridon Kalogeropulos. Compiling Techniques for the Parallel Execution of Lisp Programs. Technical report, Bath University, 1990."},{"key":"13_CR7","unstructured":"Spiridon Kalogeropulos. On partitioning lisp programs. Proceedings of the 1990 EUROPAL: High Performance and Parallel Computing in Lisp Conference, November 1990."},{"key":"13_CR8","unstructured":"James R Larus. Restructuring Symbolic Programs for Concurrent Execution on Multiprocessors. Technical Report UCB\/CSD 89\/502, University of California, 1989."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"James R. Larus and Paul N. Hilfinger. Detecting Conflicts Between Structure Accesses. Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation Atlanta, Georgia, pages 21\u201334, June 1988.","DOI":"10.1145\/53990.53993"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"B. K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Global Value Numbers and Redundant Computations. Proceeding of the Fifteenth Annual ACM SIGACTSIGPLAN Symposium on Principles of Programming Languages, p. 12\u201327, 1988.","DOI":"10.1145\/73560.73562"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"C. Ruggieri and T. P. Murtagh. Lifetime Analysis of Dynamically Allocated Objects. Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 285\u2013293, January 1988.","DOI":"10.1145\/73560.73585"},{"issue":"No.2","key":"13_CR12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Robert Tarjan. Depth-First Search and Linear Graph Algorithms. SIAM Journal on Comput. Vol. 1, No. 2, p. 146\u2013160, June 1972.","journal-title":"SIAM Journal on Comput"},{"issue":"3","key":"13_CR13","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/TSE.1975.6312852","volume":"SE-1","author":"B. Wegbreit","year":"1975","unstructured":"Ben Wegbreit. Property Extraction in Well-founded Property Sets. IEEE Transactions on Software Engineering, SE-1 (3), pages 270\u2013285, September 1975.","journal-title":"IEEE Transactions on Software Engineering"}],"container-title":["Lecture Notes in Computer Science","Parallel Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57314-3_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:17Z","timestamp":1605647477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57314-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573142","9783540480556"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57314-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}