{"id":188158,"date":"2012-07-30T00:00:00","date_gmt":"2012-07-30T19:40:30","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/msr-research-item\/weakness-can-be-quarantined\/"},"modified":"2016-08-22T11:26:46","modified_gmt":"2016-08-22T18:26:46","slug":"weakness-can-be-quarantined","status":"publish","type":"msr-video","link":"https:\/\/www.microsoft.com\/en-us\/research\/video\/weakness-can-be-quarantined\/","title":{"rendered":"Weakness Can Be Quarantined!"},"content":{"rendered":"<div class=\"asset-content\">\n<p>The Data Race Freeness (DRF) property has been advocated as the de-facto technique for reasoning about concurrent programs with a relaxed memory semantics. However, DRF has a &#8220;whole program&#8221; nature, which hinders modularity. The problem is then, how to shield a client from data races in the implementation of a library; and symmetrically, how to shield the implementor of a library from subtle issues of relaxed memory exposed by clients?<\/p>\n<p>We describe two compositional reasoning techniques to mitigate this situation.<\/p>\n<ol>\n<li>We identify a notion of linearizability that is appropriate to relaxed memory models. We prove an abstraction theorem: a component can safely be replaced by its interface in a non-interfering program context, and a composition theorem: the composition of non-interfering components satisfies the composition of their interfaces.<\/li>\n<li>We identify a notion of local sequential consistency (LSC) that permits a component to be viewed solely in terms of its SC traces. LSC can be viewed as a modular (or local) version of DRF. We prove that the composition of non-interfering LSC components is LSC.<\/li>\n<\/ol>\n<p>Our results can be adapted to different memory models: we demonstrate them for SC and variants of TSO and JMM.<\/p>\n<p>Joint work with G. Petri and J. Riely.<\/p>\n<\/div>\n<p><!-- .asset-content --><\/p>\n","protected":false},"excerpt":{"rendered":"<p>The Data Race Freeness (DRF) property has been advocated as the de-facto technique for reasoning about concurrent programs with a relaxed memory semantics. However, DRF has a &#8220;whole program&#8221; nature, which hinders modularity. The problem is then, how to shield a client from data races in the implementation of a library; and symmetrically, how to [&hellip;]<\/p>\n","protected":false},"featured_media":197034,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr_hide_image_in_river":0,"footnotes":""},"research-area":[],"msr-video-type":[],"msr-locale":[268875],"msr-post-option":[],"msr-session-type":[],"msr-impact-theme":[],"msr-pillar":[],"msr-episode":[],"msr-research-theme":[],"class_list":["post-188158","msr-video","type-msr-video","status-publish","has-post-thumbnail","hentry","msr-locale-en_us"],"msr_download_urls":"","msr_external_url":"https:\/\/youtu.be\/o6rL38fn5WM","msr_secondary_video_url":"","msr_video_file":"","_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/188158","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-video"}],"version-history":[{"count":0,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/188158\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media\/197034"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=188158"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=188158"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=188158"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=188158"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=188158"},{"taxonomy":"msr-session-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-session-type?post=188158"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=188158"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=188158"},{"taxonomy":"msr-episode","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-episode?post=188158"},{"taxonomy":"msr-research-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-theme?post=188158"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}