{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:25:11Z","timestamp":1742952311809,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030805142"},{"type":"electronic","value":"9783030805159"}],"license":[{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-80515-9_14","type":"book-chapter","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T20:04:54Z","timestamp":1670529894000},"page":"185-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graphs and Gating Functions"],"prefix":"10.1007","author":[{"given":"James","family":"Stanier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrice","family":"Rastello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,12]]},"reference":[{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Baxter, W. T., & Bauer III, H. R. (1989). The program dependence graph and vectorization. Proceedings of the Symposium on Principles of Programming Languages. POPL \u201989 (pp. 1\u201311).","DOI":"10.1145\/75277.75278"},{"key":"14_CR96","doi-asserted-by":"crossref","unstructured":"Dennis, J. B. (1974). First version of a data flow procedure language. In Programming Symposium, Proceedings Colloque sur la Programmation (pp. 362\u2013376).","DOI":"10.1007\/3-540-06859-7_145"},{"key":"14_CR97","doi-asserted-by":"crossref","unstructured":"Dennis, J. B. (1980). Data flow supercomputers. Computer, 13(11), 48\u201356 (1980).","DOI":"10.1109\/MC.1980.1653418"},{"key":"14_CR108","doi-asserted-by":"crossref","unstructured":"Ebner, D., et al. (2008). Generalized instruction selection using SSA-graphs. Proceedings of the International Conference on Languages, Compilers, and Tools for Embedded Systems. LCTES \u201908 (pp. 31\u201340).","DOI":"10.1145\/1375657.1375663"},{"key":"14_CR117","doi-asserted-by":"crossref","unstructured":"Ferrante, J., & Mace, M. (1985). On linearizing parallel code. In Proceedings of the Symposium on Principles of Programming Languages. POPL \u201985 (pp. 179\u2013190).","DOI":"10.1145\/318593.318636"},{"key":"14_CR119","doi-asserted-by":"crossref","unstructured":"Ferrante, J., Mace, M., & Simons, B. (1988). Generating sequential code from parallel code. In Proceedings of the International Conference on Supercomputing. ICS \u201988 (pp. 582\u2013592).","DOI":"10.1145\/55364.55421"},{"issue":"1","key":"14_CR127","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/200994.201003","volume":"17","author":"M P Gerlek","year":"1995","unstructured":"Gerlek, M. P., Stoltz, E., & Wolfe, M. (1995). Beyond induction variables: detecting and classifying sequences using a demand-driven SSA form. In ACM Transactions on Programming Language and Systems, 17(1), 85\u2013122.","journal-title":"In ACM Transactions on Programming Language and Systems"},{"key":"14_CR178","unstructured":"Lawrence, A. C. (2007). Optimizing Compilation with the Value State Dependence Graph. Technical Report UCAM-CL-TR-705. University of Cambridge, Computer Laboratory."},{"key":"14_CR254","doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer, S., & Scholz, B. (2007). Optimal chain rule placement for instruction selection based on SSA graphs. In Proceedings of the International Workshop on Software & Compilers for Embedded Systems. SCOPES \u201907 (pp. 91\u2013100).","DOI":"10.1145\/1269843.1269857"},{"key":"14_CR259","doi-asserted-by":"crossref","unstructured":"Simons, B., Alpern, D., & Ferrante, J. (1990). A foundation for sequentializing parallel code. In Proceedings of the Symposium on Parallel Algorithms and Architectures. SPAA \u201990 (pp. 350\u2013359).","DOI":"10.1145\/97444.97702"},{"key":"14_CR269","unstructured":"Stanier, J. (2011). Removing and Restoring Control Flow with the Value State Dependence Graph. PhD Thesis. University of Sussex, School of Informatics."},{"key":"14_CR291","unstructured":"Upton, E. (2003). Optimal sequentialization of gated data dependence graphs is NP-complete. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (pp. 1767\u20131770)."},{"key":"14_CR306","doi-asserted-by":"crossref","unstructured":"Wolfe, M. (1992). Beyond induction variables. In International Conference on Programming Languages Design and Implementation. PLDI \u201992 (pp. 162\u2013174).","DOI":"10.1145\/143095.143131"}],"container-title":["SSA-based Compiler Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80515-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T20:05:37Z","timestamp":1670529937000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80515-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,12]]},"ISBN":["9783030805142","9783030805159"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80515-9_14","relation":{},"subject":[],"published":{"date-parts":[[2021,6,12]]},"assertion":[{"value":"12 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}