{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:16:28Z","timestamp":1725552988742},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642125911"},{"type":"electronic","value":"9783642125928"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12592-8_13","type":"book-chapter","created":{"date-parts":[[2010,4,28]],"date-time":"2010-04-28T06:28:59Z","timestamp":1272436139000},"page":"173-187","source":"Crossref","is-referenced-by-count":0,"title":["Program Parallelization Using Synchronized Pipelining"],"prefix":"10.1007","author":[{"given":"Leonardo","family":"Scandolo","sequence":"first","affiliation":[]},{"given":"C\u00e9sar","family":"Kunz","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1145\/212094.212131","volume":"27","author":"V. Allan","year":"1995","unstructured":"Allan, V., Jones, R., Lee, R., Allan, S.J.: Software pipelining. ACM Computing Surveys\u00a027(3), 367\u2013432 (1995)","journal-title":"ACM Computing Surveys"},{"issue":"11","key":"13_CR2","first-page":"1105","volume":"PDS-11","author":"T. Fahringer","year":"2000","unstructured":"Fahringer, T., Scholz, B.: A unified symbolic evaluation framework for parallelizing compilers. IEEE Transactions on Parallel and Distributed Systems\u00a0PDS-11(11), 1105\u20131125 (2000)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1145\/1411204.1411224","volume-title":"ICFP","author":"M. Fluet","year":"2008","unstructured":"Fluet, M., Rainey, M., Reppy, J., Shaw, A.: Implicitly-threaded parallelism in manticore. In: Hook, J., Thiemann, P. (eds.) ICFP, pp. 119\u2013130. ACM, New York (2008)"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/200994.201003","volume":"17","author":"M. Gerlek","year":"1995","unstructured":"Gerlek, M., Stoltz, E., Wolfe, M.: Beyond induction variables: detecting and classifying sequences using a demand-driven SSA form. ACM Transactions on Programming Languages and Systems\u00a017(1), 85\u2013122 (1995)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR5","unstructured":"Supercomputing Technologies Group: Cilk 5.4.6 reference manual (1998)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-73368-3_42","volume-title":"Computer Aided Verification","author":"S. Gulwani","year":"2007","unstructured":"Gulwani, S., Tiwari, A.: An abstract domain for analyzing heap-manipulating low-level software. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 379\u2013392. Springer, Heidelberg (2007)"},{"key":"13_CR7","volume-title":"Computer Architecture: a quantitative approach","author":"J. Hennessy","year":"2003","unstructured":"Hennessy, J., Patterson, D.: Computer Architecture: a quantitative approach. Morgan Kaufman, San Francisco (2003)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Hummel, J., Hendren, L., Nicolau, A.: A general data dependence test for dynamic, pointer-based data structures. In: PLDI, pp. 218\u2013229 (1994)","DOI":"10.1145\/773473.178262"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-540-75444-2_43","volume-title":"High Performance Computing and Communications","author":"M. Joyner","year":"2007","unstructured":"Joyner, M., Budimlic, Z., Sarkar, V.: Optimizing array accesses in high productivity languages. In: Perrott, R.H., Chapman, B.M., Subhlok, J., de Mello, R.F., Yang, L.T. (eds.) HPCC 2007. LNCS, vol.\u00a04782, pp. 432\u2013445. Springer, Heidelberg (2007)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/1250734.1250759","volume-title":"PLDI","author":"M. Kulkarni","year":"2007","unstructured":"Kulkarni, M., Pingali, K., Walter, B., Ramanarayanan, G., Bala, K., Chew, L.P.: Optimistic parallelism requires abstractions. In: Ferrante, J., McKinley, K. (eds.) PLDI, pp. 211\u2013222. ACM, New York (2007)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Liu, Y., Stoller, S.: From recursion to iteration: What are the optimizations? In: PEPM, pp. 73\u201382 (2000)","DOI":"10.1145\/328691.328700"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-540-89740-8_7","volume-title":"Languages and Compilers for Parallel Computing","author":"M. Marron","year":"2008","unstructured":"Marron, M., Kapur, D., Stefanovic, D., Hermenegildo, M.: Identification of Heap-Carried Data Dependence Via Explicit Store Heap Models. In: Amaral, J.N. (ed.) LCPC 2008. LNCS, vol.\u00a05335, pp. 94\u2013108. Springer, Heidelberg (2008)"},{"key":"13_CR13","first-page":"105","volume-title":"MICRO","author":"G. Ottoni","year":"2005","unstructured":"Ottoni, G., Rangan, R., Stoler, A., August, D.I.: Automatic thread extraction with decoupled software pipelining. In: MICRO, pp. 105\u2013118. IEEE Computer Society, Los Alamitos (2005)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-540-89330-1_10","volume-title":"Programming Languages and Systems","author":"S. Peyton Jones","year":"2008","unstructured":"Peyton Jones, S.: Harnessing the multicores: Nested data parallelism in haskell. In: Ramalingam, G. (ed.) APLAS 2008. LNCS, vol.\u00a05356, p. 138. Springer, Heidelberg (2008)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-00590-9_25","volume-title":"Programming Languages and Systems","author":"M. Raza","year":"2009","unstructured":"Raza, M., Calcagno, C., Gardner, P.: Automatic parallelization with separation logic. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol.\u00a05502, pp. 348\u2013362. Springer, Heidelberg (2009) (to appear)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Rugina, R., Rinard, M.: Automatic parallelization of divide and conquer algorithms. In: PPOPP, pp. 72\u201383 (1999)","DOI":"10.1145\/329366.301111"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1145\/1375581.1375598","volume-title":"PLDI","author":"M. Vechev","year":"2008","unstructured":"Vechev, M., Yahav, E.: Deriving linearizable fine-grained concurrent objects. In: Gupta, R., Amarasinghe, S. (eds.) PLDI, pp. 125\u2013135. ACM, New York (2008)"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12592-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:33:12Z","timestamp":1558290792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12592-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642125911","9783642125928"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12592-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}