Checking race freedom via linear programming

研究成果: Conference contribution

25 被引用数 (Scopus)

抄録

We present a new static analysis for race freedom and race detection. The analysis checks race freedom by reducing the problem to (rational) linear programming. Unlike conventional static analyses for race freedom or race detection, our analysis avoids explicit computation of locksets and lock linearity/must-aliasness. Our analysis can handle a variety of synchronization idioms that more conventional approaches often have difficulties with, such as thread joining, semaphores, and signals. We achieve efficiency by utilizing modern linear programming solvers that can quickly solve large linear programming instances. This paper reports on the formal properties of the analysis and the experience with applying an implementation to real world C programs. copyright

本文言語English
ホスト出版物のタイトルPLDI'08
ホスト出版物のサブタイトルProceedings of the 2008 SIGPLAN Conference on Programming Language Design and Implementation
ページ1-10
ページ数10
DOI
出版ステータスPublished - 2008 12 12
外部発表はい
イベント2008 ACM SIGPLAN Conference on Programming Language Design and Implementation 2008, PLDI'08 - Tucson, AZ, United States
継続期間: 2007 6 72007 6 13

出版物シリーズ

名前Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Other

Other2008 ACM SIGPLAN Conference on Programming Language Design and Implementation 2008, PLDI'08
CountryUnited States
CityTucson, AZ
Period07/6/707/6/13

ASJC Scopus subject areas

  • Software

フィンガープリント 「Checking race freedom via linear programming」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル