{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:30:53Z","timestamp":1767929453912,"version":"3.49.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1116907"],"award-info":[{"award-number":["CCF-1116907"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CISUC","award":["326\/97"],"award-info":[{"award-number":["326\/97"]}]},{"DOI":"10.13039\/100007063","name":"Mellon College of Science, Carnegie Mellon University","doi-asserted-by":"publisher","award":["CMU-PT\/SE\/0038\/2008"],"award-info":[{"award-number":["CMU-PT\/SE\/0038\/2008"]}],"id":[{"id":"10.13039\/100007063","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["SFRH\/BD\/33522\/2008"],"award-info":[{"award-number":["SFRH\/BD\/33522\/2008"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2014,3]]},"abstract":"<jats:p>\n            Writing concurrent applications is extremely challenging, not only in terms of producing bug-free and maintainable software, but also for enabling developer productivity. In this article we present the \u00c6minium concurrent-by-default programming language. Using \u00c6minium programmers express data dependencies rather than control flow between instructions. Dependencies are expressed using permissions, which are used by the type system to automatically parallelize the application. The \u00c6minium approach provides a modular and composable mechanism for writing concurrent applications, preventing data races in a provable way. This allows programmers to shift their attention from low-level, error-prone reasoning about thread interleaving and synchronization to focus on the core functionality of their applications. We study the semantics of \u00c6minium through\n            <jats:italic>\u03bc<\/jats:italic>\n            \u00c6minium, a sound core calculus that leverages permission flow to enable concurrent-by-default execution. After discussing our prototype implementation we present several case studies of our system. Our case studies show up to 6.5X speedup on an eight-core machine when leveraging data group permissions to manage access to shared state, and more than 70% higher throughput in a Web server application.\n          <\/jats:p>","DOI":"10.1145\/2543920","type":"journal-article","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T13:45:50Z","timestamp":1395668750000},"page":"1-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["\u00c6minium"],"prefix":"10.1145","volume":"36","author":[{"given":"Sven","family":"Stork","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Karl","family":"Naden","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Joshua","family":"Sunshine","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Manuel","family":"Mohr","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology"}]},{"given":"Alcides","family":"Fonseca","sequence":"additional","affiliation":[{"name":"University of Coimbra"}]},{"given":"Paulo","family":"Marques","sequence":"additional","affiliation":[{"name":"University of Coimbra"}]},{"given":"Jonathan","family":"Aldrich","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]}],"member":"320","published-online":{"date-parts":[[2014,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2048066.2048106"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1787234.1787255"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639950.1640073"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Aldrich J. Beckman N. E. Bocchino R. Naden K. Saini D. Stork S. and Sunshine J. 2012. The plaid language: Typed core specification. Tech. rep. CMU-ISR-12-103 Carnegie Mellon University.","DOI":"10.21236\/ADA558841"},{"key":"e_1_2_1_5_1","unstructured":"Allen E. Chase D. Hallett J. Luchangco V. Maessen J. Ryu S. Steele Jr G. and Tobinhochstadt S. 2008. The fortress language specification version 1.0. Tech. rep. Sun Microsystems."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375600"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449764.1449783"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/232627.232650"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/209936.209958"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640097"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926447"},{"key":"e_1_2_1_12_1","unstructured":"Boehm H.-J. 2009. Transactional memory should be an implementation technique not a programming interface. Tech. rep. HPL-2009-45 HP Laboratories."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/582419.582440"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760267.1760273"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/286936.286947"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","unstructured":"Click C. and Paleczny M. 1995. A simple graph-based intermediate representation. In Papers from the ACM SIGPLAN Workshop on Intermediate Representations (IR\u201995). ACM Press New York 35--49. 10.1145\/202529.202534","DOI":"10.1145\/202529.202534"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11970-5_9"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512532"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/522344.825701"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/319838.319848"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","unstructured":"Goldberg A. and Robson D. 1983. Smalltalk-80: The Language and its Implementation. Addison-Wesley Longman Publishing Boston MA.","DOI":"10.5555\/273"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1178597.1178611"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/320384.320395"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/286936.286953"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/543552.512559"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/364995.365000"},{"key":"e_1_2_1_28_1","unstructured":"Microsoft Corporation 2009. Axum programmer\u2019s guide. http:\/\/msdn.microsoft.com\/en-us\/devlabs\/dd795202.aspx."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328448"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103722"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/509043"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/534475"},{"key":"e_1_2_1_36_1","unstructured":"Stork S. Aldrich J. and Marques P. 2010. Micro-AEmimium language specification. Tech. rep. CMU-ISR-10-125R2 Carnegie Mellon University."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639950.1640060"},{"key":"e_1_2_1_38_1","unstructured":"Stork S. Naden K. and Sunshine J. 2012. AEminium code repository. http:\/\/goo.gl\/olbMs."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2048066.2048122"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1883978.1884000"}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2543920","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2543920","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2543920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:10:15Z","timestamp":1750234215000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2543920"}},"subtitle":["A Permission-Based Concurrent-by-Default Programming Language Approach"],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["10.1145\/2543920"],"URL":"https:\/\/doi.org\/10.1145\/2543920","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3]]},"assertion":[{"value":"2012-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}