{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:24:53Z","timestamp":1743099893240,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319099668"},{"type":"electronic","value":"9783319099675"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-09967-5_3","type":"book-chapter","created":{"date-parts":[[2014,9,30]],"date-time":"2014-09-30T15:10:04Z","timestamp":1412089804000},"page":"39-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Task-Aware Optimization of Dynamic Fractional Permissions"],"prefix":"10.1007","author":[{"given":"Christoph M.","family":"Angerer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/1353535.1346323","volume":"42","author":"S Lu","year":"2008","unstructured":"Lu, S., Park, S., Seo, E., Zhou, Y.: Learning from mistakes: a comprehensive study on real world concurrency bug characteristics. SIGOPS Oper. Syst. Rev. 42, 329\u2013339 (2008)","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Matsakis, N.D., Gross, T.R.: A time-aware type system for data-race protection and guaranteed initialization. In: OOPSLA \u201910, pp. 634\u2013651. ACM, New York (2010)","DOI":"10.1145\/1932682.1869511"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44898-5_4","volume-title":"Static Analysis","author":"J Boyland","year":"2003","unstructured":"Boyland, J.: Checking interference with fractional permissions. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 55\u201372. Springer, Heidelberg (2003)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BFb0030692","volume-title":"Distributed Algorithms","author":"M Moir","year":"1997","unstructured":"Moir, M.: Transparent support for wait-free transactions. In: Mavronicolas, M. (ed.) WDAG 1997. LNCS, vol. 1320, pp. 305\u2013319. Springer, Heidelberg (1997)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Harris, T., Fraser, K.: Language support for lightweight transactions. In: OOPSLA \u201903, pp. 388\u2013402. ACM, New York (2003)","DOI":"10.1145\/949343.949340"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Adl-Tabatabai, A.R., Kozyrakis, C., Saha, B.: Transactional programming in a multi-core environment. In: PPoPP \u201907, p. 272. ACM, New York (2007)","DOI":"10.1145\/1229428.1229484"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Musuvathi, M., Qadeer, S.: Iterative context bounding for systematic testing of multithreaded programs. In: PLDI \u201907, pp. 446\u2013455. ACM, New York (2007)","DOI":"10.1145\/1273442.1250785"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Qadeer, S., Wu, D.: Kiss: keep it simple and sequential. In: PLDI \u201904, pp. 14\u201324. ACM, New York (2004)","DOI":"10.1145\/996893.996845"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Freund, S.N.: Fasttrack: efficient and precise dynamic race detection. In: PLDI \u201909, pp. 121\u2013133. ACM, New York (2009)","DOI":"10.1145\/1543135.1542490"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Angerer, C.M., Gross, T.R.: Exploiting task order information for optimizing sequentially consistent java programs. In: PACT \u201911, pp. 393\u2013402 (2011)","DOI":"10.1109\/PACT.2011.70"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-19595-2_2","volume-title":"Languages and Compilers for Parallel Computing","author":"CM Angerer","year":"2011","unstructured":"Angerer, C.M., Gross, T.R.: Static analysis of dynamic schedules and its application to optimization of parallel programs. In: Cooper, K., Mellor-Crummey, J., Sarkar, V. (eds.) LCPC 2010. LNCS, vol. 6548, pp. 16\u201330. Springer, Heidelberg (2011)"},{"key":"3_CR12","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. In: OSDI \u201904, p. 10. USENIX Association, Berkeley (2004)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Angerer, C.M., Gross, T.R.: Now happens-before later: static schedule analysis of fine-grained parallelism with explicit happens-before relationships. In: Onward!\/SPLASH \u201910, pp. 3\u201310. ACM, New York (2010)","DOI":"10.1145\/1869542.1869544"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/504311.504288","volume":"36","author":"C von Praun","year":"2001","unstructured":"von Praun, C., Gross, T.R.: Object race detection. SIGPLAN Not. 36, 70\u201382 (2001)","journal-title":"SIGPLAN Not."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Smith, L.A., Bull, J.M., Obdrz\u00e1lek, J.: A parallel java grande benchmark suite. In: Supercomputing \u201901, p. 8. ACM, New York (2001)","DOI":"10.1145\/582034.582042"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Terauchi, T.: Checking race freedom via linear programming. In: PLDI \u201908, pp. 1\u201310. ACM, New York (2008)","DOI":"10.1145\/1379022.1375583"},{"key":"3_CR17","first-page":"27:1","volume":"30","author":"T Terauchi","year":"2008","unstructured":"Terauchi, T., Aiken, A.: A capability calculus for concurrency and determinism. ACM Trans. Program. Lang. Syst. 30, 27:1\u201327:30 (2008)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR18","doi-asserted-by":"crossref","first-page":"22:1","DOI":"10.1145\/1749608.1749611","volume":"32","author":"JT Boyland","year":"2010","unstructured":"Boyland, J.T.: Semantics of fractional permissions with nesting. ACM Trans. Program. Lang. Syst. 32, 22:1\u201322:33 (2010)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Feng, M., Leiserson, C.E.: Efficient detection of determinacy races in cilk programs. In: SPAA \u201997, pp. 1\u201311. ACM, New York (1997)","DOI":"10.1145\/258492.258493"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-16612-9_28","volume-title":"Runtime Verification","author":"R Raman","year":"2010","unstructured":"Raman, R., Zhao, J., Sarkar, V., Vechev, M., Yahav, E.: Efficient data race detection for async-finish parallelism. In: Barringer, H., et al. (eds.) RV 2010. LNCS, vol. 6418, pp. 368\u2013383. Springer, Heidelberg (2010)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Yu, Y., Rodeheffer, T., Chen, W.: Racetrack: efficient detection of data race conditions via adaptive tracking. In: SOSP \u201905, pp. 221\u2013234. ACM, New York (2005)","DOI":"10.1145\/1095809.1095832"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Marino, D., Musuvathi, M., Narayanasamy, S.: Literace: effective sampling for lightweight data-race detection. In: PLDI \u201909, pp. 134\u2013143. ACM, New York (2009)","DOI":"10.1145\/1543135.1542491"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Bond, M.D., Coons, K.E., McKinley, K.S.: Pacer: proportional detection of data races. In: PLDI \u201910, pp. 255\u2013268. ACM, New York (2010)","DOI":"10.1145\/1809028.1806626"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09967-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T08:14:08Z","timestamp":1674548048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09967-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319099668","9783319099675"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09967-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"1 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}