Concurrent data representation synthesis

Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin Rinard, Mooly Sagiv

Research output: Contribution to journalArticlepeer-review


We describe an approach for synthesizing data representations for concurrent programs. Our compiler takes as input a program written using concurrent relations and synthesizes a representation of the relations as sets of cooperating data structures as well as the placement and acquisition of locks to synchronize concurrent access to those data structures. The resulting code is correct by construction: individual relational operations are implemented correctly and the aggregate set of operations is serializable and deadlock free. The relational specification also permits a high-level optimizer to choose the best performing of many possible legal data representations and locking strategies, which we demonstrate with an experiment autotuning a graph benchmark.

Original languageEnglish
Pages (from-to)417-427
Number of pages11
JournalACM SIGPLAN Notices
Issue number6
StatePublished - Aug 2012


  • Lock placement
  • Synthesis


Dive into the research topics of 'Concurrent data representation synthesis'. Together they form a unique fingerprint.

Cite this