{"id":"https://openalex.org/W2086512828","doi":"https://doi.org/10.1145/1328438.1328449","title":"Semantics of transactional memory and automatic mutual exclusion","display_name":"Semantics of transactional memory and automatic mutual exclusion","publication_year":2008,"publication_date":"2008-01-07","ids":{"openalex":"https://openalex.org/W2086512828","doi":"https://doi.org/10.1145/1328438.1328449","mag":"2086512828"},"language":"en","primary_location":{"id":"doi:10.1145/1328438.1328449","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328438.1328449","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109387322","display_name":"Mart\u0131\u0301n Abadi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Mart\u00edn Abadi","raw_affiliation_strings":["Microsoft Research, Silicon Valley","Microsoft Research, Silicon, Valley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Silicon Valley","institution_ids":["https://openalex.org/I4210124949"]},{"raw_affiliation_string":"Microsoft Research, Silicon, Valley","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070330470","display_name":"Andrew Birrell","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Andrew Birrell","raw_affiliation_strings":["Microsoft Research, Silicon Valley","Microsoft Research, Silicon, Valley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Silicon Valley","institution_ids":["https://openalex.org/I4210124949"]},{"raw_affiliation_string":"Microsoft Research, Silicon, Valley","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018504427","display_name":"Tim Harris","orcid":"https://orcid.org/0000-0001-9628-130X"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Tim Harris","raw_affiliation_strings":["Microsoft Research, Cambridge, United Kingdom","Microsoft Research, Cambridge, United Kingdom ("],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft Research, Cambridge, United Kingdom (","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089543053","display_name":"Michael Isard","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Michael Isard","raw_affiliation_strings":["Microsoft Research, Silicon Valley","Microsoft Research, Silicon, Valley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Silicon Valley","institution_ids":["https://openalex.org/I4210124949"]},{"raw_affiliation_string":"Microsoft Research, Silicon, Valley","institution_ids":["https://openalex.org/I4210124949"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":166,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"63","last_page":"74"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.982699990272522,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13471","display_name":"Cognitive Functions and Memory","score":0.9740999937057495,"subfield":{"id":"https://openalex.org/subfields/3205","display_name":"Experimental and Cognitive Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8716843128204346},{"id":"https://openalex.org/keywords/transactional-memory","display_name":"Transactional memory","score":0.7497071027755737},{"id":"https://openalex.org/keywords/software-transactional-memory","display_name":"Software transactional memory","score":0.6773500442504883},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.6681496500968933},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.6015400886535645},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5999366044998169},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5529471039772034},{"id":"https://openalex.org/keywords/mutual-exclusion","display_name":"Mutual exclusion","score":0.5195691585540771},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41756486892700195},{"id":"https://openalex.org/keywords/database-transaction","display_name":"Database transaction","score":0.3726420998573303}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8716843128204346},{"id":"https://openalex.org/C134277064","wikidata":"https://www.wikidata.org/wiki/Q878206","display_name":"Transactional memory","level":3,"score":0.7497071027755737},{"id":"https://openalex.org/C167149655","wikidata":"https://www.wikidata.org/wiki/Q1189004","display_name":"Software transactional memory","level":4,"score":0.6773500442504883},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6681496500968933},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.6015400886535645},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5999366044998169},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5529471039772034},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.5195691585540771},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41756486892700195},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.3726420998573303}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1328438.1328449","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328438.1328449","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.164.9234","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.9234","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucsc.edu/~abadi/Papers/paper-long-ame-semantics.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.187.7599","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.7599","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/en-us/projects/ame/ame-popl08.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.3656","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.3656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/~tharris/papers/2008-popl.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.7900000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W68674173","https://openalex.org/W75086091","https://openalex.org/W91716996","https://openalex.org/W138895183","https://openalex.org/W1482207865","https://openalex.org/W1496111390","https://openalex.org/W1503253544","https://openalex.org/W1511597195","https://openalex.org/W1521891776","https://openalex.org/W1542975293","https://openalex.org/W1550017767","https://openalex.org/W1576905273","https://openalex.org/W1761177680","https://openalex.org/W1980939032","https://openalex.org/W2017700354","https://openalex.org/W2033348393","https://openalex.org/W2053935034","https://openalex.org/W2060499019","https://openalex.org/W2079854797","https://openalex.org/W2091085450","https://openalex.org/W2092911542","https://openalex.org/W2094222793","https://openalex.org/W2105789303","https://openalex.org/W2108204150","https://openalex.org/W2111134484","https://openalex.org/W2111946621","https://openalex.org/W2116145395","https://openalex.org/W2119653453","https://openalex.org/W2122139510","https://openalex.org/W2126501440","https://openalex.org/W2129240242","https://openalex.org/W2129990308","https://openalex.org/W2133662847","https://openalex.org/W2134997781","https://openalex.org/W2138411837","https://openalex.org/W2144248538","https://openalex.org/W2149473197","https://openalex.org/W2152390090","https://openalex.org/W2152988224","https://openalex.org/W2153099072","https://openalex.org/W2160928099","https://openalex.org/W2166615267","https://openalex.org/W2168163009","https://openalex.org/W2172064476","https://openalex.org/W3004250778","https://openalex.org/W4213423413","https://openalex.org/W4230702135","https://openalex.org/W4238982306","https://openalex.org/W4242949098","https://openalex.org/W4300810260"],"related_works":["https://openalex.org/W2088444093","https://openalex.org/W133473147","https://openalex.org/W2152491655","https://openalex.org/W2076409732","https://openalex.org/W924353067","https://openalex.org/W4252722439","https://openalex.org/W2992926879","https://openalex.org/W1144911151","https://openalex.org/W2526476098","https://openalex.org/W2138476373"],"abstract_inverted_index":{"Software":[0],"Transactional":[1],"Memory":[2],"(STM)":[3],"is":[4,124],"an":[5],"attractive":[6],"basis":[7],"for":[8,14,56],"the":[9,18,33,38,45,57,60,142,145],"development":[10],"of":[11,20,40,59,84,122,147],"language":[12,47],"features":[13,22],"concurrent":[15],"programming.":[16],"However,":[17],"semantics":[19,52,80],"these":[21,148],"can":[23],"be":[24],"delicate":[25],"and":[26,44,53,104,117],"problematic.":[27],"In":[28],"this":[29,79],"paper":[30],"we":[31,50,86,115],"explore":[32],"tradeoffs":[34],"between":[35],"semantic":[36],"simplicity,":[37],"viability":[39],"efficient":[41,127],"implementation":[42,89],"strategies,":[43],"flexibilityof":[46],"constructs.":[48],"Specifically,":[49],"develop":[51],"type":[54],"systems":[55,94],"constructs":[58],"Automatic":[61],"Mutual":[62],"Exclusion":[63],"(AME)":[64],"programming":[65],"model;":[66],"our":[67],"results":[68],"apply":[69],"also":[70],"to":[71],"other":[72],"constructs,":[73],"such":[74],"as":[75,81],"atomic":[76],"blocks.":[77],"With":[78],"a":[82,134,140],"point":[83],"reference,":[85],"study":[87],"several":[88],"strategies.":[90],"We":[91],"model":[92],"STM":[93],"that":[95,114,125],"use":[96],"in-place":[97],"update,":[98],"optimistic":[99],"concurrency,":[100],"lazy":[101],"conflict":[102],"detection,":[103],"roll-back.":[105],"These":[106],"strategies":[107],"are":[108],"correct":[109],"only":[110],"under":[111],"non-trivial":[112],"assumptions":[113,143],"identify":[116],"analyze.":[118],"One":[119],"important":[120],"source":[121],"errors":[123],"some":[126],"implementations":[128],"create":[129],"dangerous":[130],"'zombie'":[131],"computations":[132],"where":[133],"transaction":[135],"keeps":[136],"running":[137],"after":[138],"experiencing":[139],"conflict;":[141],"confine":[144],"effects":[146],"computations.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":15}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}