Checking race freedom via linear programming

Tachio Terauchi*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (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.

Original languageEnglish
Pages (from-to)1-10
Number of pages10
JournalACM SIGPLAN Notices
Issue number6
Publication statusPublished - 2008 Jun 1
Externally publishedYes


  • Fractional Capabilities
  • Linear Programming

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Checking race freedom via linear programming'. Together they form a unique fingerprint.

Cite this