{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:40:04Z","timestamp":1748335204334,"version":"3.41.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Parallel Programming"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1023\/a:1018772514882","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T20:54:14Z","timestamp":1045688054000},"page":"563-589","source":"Crossref","is-referenced-by-count":16,"title":["A Constant Propagation Algorithm for Explicitly Parallel Programs"],"prefix":"10.1007","volume":"26","author":[{"given":"Jaejin","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel P.","family":"Midkiff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David A.","family":"Padua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"228641_CR1","unstructured":"Jaejin Lee, Samuel P. Midkiff, and David A. Padua, Concurrent Static Single Assignment Form and Constant Propagation for Explicitly Parallel Programs, Proc. Tenth Int' l Workshop on Lang. Compilers for Parallel Computing (August 1997)."},{"key":"228641_CR2","unstructured":"S. P. Midkiff and D. A. Padua, Issues in the Optimization of Parallel Programs, Proc. Int' l Conf. Parallel Processing, Vol. II Software, pp. 105\u2013113 (August 1990)."},{"key":"228641_CR3","unstructured":"Kourosh Gharachorloo, Memory Consistency Models for Shared-Memory Multiprocessors, Ph.D. thesis, Stanford University (1995)."},{"issue":"9","key":"228641_CR4","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"C-28","author":"L. Lamport","year":"1979","unstructured":"Leslie Lamport, How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs, IEEE Trans. Computers, C-28(9):690\u2013691 (September 1979).","journal-title":"IEEE Trans. Computers"},{"issue":"6","key":"228641_CR5","doi-asserted-by":"crossref","first-page":"1684","DOI":"10.1145\/197320.197331","volume":"16","author":"M. M. Brandis","year":"1994","unstructured":"Mark M. Brandis and Hanspeter M\u00f6ssenb\u00f6ck, Single-Pass Generation of Static Single Assignment Form for Structured Languages, ACM Trans. Progr. Lang. and Syst., 16(6):1684\u20131698 (1994).","journal-title":"ACM Trans. Progr. Lang. and Syst."},{"issue":"4","key":"228641_CR6","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"Ron Cytron, Jeanne Ferrante, Barry K. Rosen, and Mark N. Wegman, Efficiently Computing Static Single Assignment Form and the Control Dependence Graph, ACM Trans. Progr. Lang. and Syst., 13(4):451\u2013490 (October 1991).","journal-title":"ACM Trans. Progr. Lang. and Syst."},{"issue":"2","key":"228641_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/103135.103136","volume":"13","author":"M. N. Wegman","year":"1991","unstructured":"Mark N. Wegman and F. Kenneth Zadeck, Constant Propagation with Conditional Branches, ACM Trans. Progr. Lang. Syst., 13(2):181\u2013210 (April 1991).","journal-title":"ACM Trans. Progr. Lang. Syst."},{"key":"228641_CR8","doi-asserted-by":"crossref","unstructured":"Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck, Gloabal Value Numbers and Redundant Computations, Conf. Record 15th ACM Symp. Principles of Progr. Lang., pp. 12\u201327 (January 1988).","DOI":"10.1145\/73560.73562"},{"key":"228641_CR9","doi-asserted-by":"crossref","unstructured":"Preston Briggs and Keith D. Cooper, Effective Partial redundancy Elimination, Proc. ACM SIGPLAN ' 94 Conf. Progr. Lang. Design and Implementation, pp. 159\u2013170 (June 1994).","DOI":"10.1145\/178243.178257"},{"issue":"1","key":"228641_CR10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/200994.201003","volume":"17","author":"M. P. Gerlek","year":"1995","unstructured":"Michael P. Gerlek, Eric Stoltz, and Michael Wolfe, Beyond Induction Variables: Detecting and Classifying Sequences Using a Demand-Driven SSA Form, ACM Trans. Progr. Lang. and Syst., 17(1):85\u2013122 (January 1995).","journal-title":"ACM Trans. Progr. Lang. and Syst."},{"key":"228641_CR11","unstructured":"Harini Srinivasan and Dirk Grunwald, An Efficient Construction of Parallel Static Single Assignment Form for Structured Parallel Programs, Technical Report CU-CS-564\u201391, University of Colorado at Boulderi (December 1991)."},{"key":"228641_CR12","doi-asserted-by":"crossref","unstructured":"Harini Srinivasan, James Hook, and Michael Wolfe, Static Single Assignment for Explicitly Parallel Programs, Proc. 20th ACM Symp. Principles of Progr. Lang., pp. 260\u2013272 (January 1993).","DOI":"10.1145\/158511.158644"},{"key":"228641_CR13","doi-asserted-by":"crossref","unstructured":"Vivek Sarkar, Analysis and Optimization of Explicitly Parallel Programs Using the Parallel Program Graph Representation, Tenth Ann. Workshop on Lang. Compilers for Parallel Computing (August 1997).","DOI":"10.1007\/BFb0032686"},{"key":"228641_CR14","unstructured":"Vivek Sarkar and Barbara Simons, Parallel Program Graphs and Their Classification, In Utpal Banerjee, David Gelernter, Alex Nicolau, and David Padua, (eds.), Sixth Ann. Workshop on Lang. Compilers for Parallel Computing, Volume 768 of Lecture Notes in Computer Science, Springer-Verlag (August 1993)."},{"key":"228641_CR15","doi-asserted-by":"crossref","unstructured":"Michael Wolfe and Harini Srinivasan, Data Structures for Optimizing Programs with Explicit Parallelism, Proc. First Int'l Conf. Austrian Center for Parallel Computation (September 1991).","DOI":"10.1007\/3-540-55437-8_77"},{"key":"228641_CR16","unstructured":"Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman, Compilers: Principles, Techniques, and Tools, Addison Wesley (1986)."},{"key":"228641_CR17","doi-asserted-by":"crossref","unstructured":"David Callahan and Jaspal Subhlok, Static Analysis of Low-Level Synchronization, Proc. ACM SIGPLAN\/SIGOPS Workshop on Parallel and Distributed Debugging, pp. 100\u2013111 (May 1988.).","DOI":"10.1145\/68210.69225"},{"key":"228641_CR18","doi-asserted-by":"crossref","unstructured":"Perry A. Emrath, Sanjoy Ghosh, and David A. Padua, Event Synchronization Analysis for Debugging Parallel Programs, Proc. Supercomputing '89, pp. 580\u2013588 (1989).","DOI":"10.1145\/76263.76329"},{"key":"228641_CR19","doi-asserted-by":"crossref","unstructured":"Perry A. Emrath, Sanjoy Ghosh, and David A. Padua, Detecting Nondeterminacy in Parallel Programs, IEEE Software, pp. 69\u201377 (January 1992).","DOI":"10.1109\/52.108783"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018772514882.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018772514882\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018772514882.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:15:26Z","timestamp":1748333726000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018772514882"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["228641"],"URL":"https:\/\/doi.org\/10.1023\/a:1018772514882","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}