{"id":186159,"date":"2011-04-21T00:00:00","date_gmt":"2011-04-27T20:45:25","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/msr-research-item\/staged-concurrent-program-analysis\/"},"modified":"2016-08-22T11:31:29","modified_gmt":"2016-08-22T18:31:29","slug":"staged-concurrent-program-analysis","status":"publish","type":"msr-video","link":"https:\/\/www.microsoft.com\/en-us\/research\/video\/staged-concurrent-program-analysis\/","title":{"rendered":"Staged Concurrent Program Analysis"},"content":{"rendered":"<div class=\"asset-content\">\n<p>Concurrent program verification is challenging because it involves exploring a large number of possible thread interleavings together with complex sequential reasoning. Consequently, most concurrent program verifiers resort to some form of bi-modal reasoning, which alternates between reasoning over intra-thread (sequential) semantics and inter-thread (concurrent) semantics. Such reasoning often involves repeated sequential reasoning for exploring each interleaving and leads to inefficiency. Moreover, most methods employ a control-centric mechanism, e.g., a scheduler, for composing threads which obstructs direct reasoning about inter-thread data flow.<\/p>\n<p>In this talk, I will present a new staged analysis technique which both (a) decouples intra- and inter-thread reasoning and (b) enables data-centric reasoning. The first stage uses sequential program semantics to obtain a precise summary of each thread in terms of its global memory accesses only. The second stage performs inter-thread reasoning by employing the data-centric notion of sequential consistency to compose these thread-modular summaries. Concurrency errors are then checked using an off-the-shelf SMT solver. An implementation of our approach in the FUSION framework developed at NEC for checking concurrent C programs shows that staged reasoning improves the scalability of the analysis significantly.<\/p>\n<\/div>\n<p><!-- .asset-content --><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Concurrent program verification is challenging because it involves exploring a large number of possible thread interleavings together with complex sequential reasoning. Consequently, most concurrent program verifiers resort to some form of bi-modal reasoning, which alternates between reasoning over intra-thread (sequential) semantics and inter-thread (concurrent) semantics. Such reasoning often involves repeated sequential reasoning for exploring each [&hellip;]<\/p>\n","protected":false},"featured_media":196099,"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-186159","msr-video","type-msr-video","status-publish","has-post-thumbnail","hentry","msr-locale-en_us"],"msr_download_urls":"","msr_external_url":"https:\/\/youtu.be\/mNVk0Oy0bKY","msr_secondary_video_url":"","msr_video_file":"","_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/186159","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\/186159\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media\/196099"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=186159"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=186159"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=186159"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=186159"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=186159"},{"taxonomy":"msr-session-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-session-type?post=186159"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=186159"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=186159"},{"taxonomy":"msr-episode","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-episode?post=186159"},{"taxonomy":"msr-research-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-theme?post=186159"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}