< view all research areas

This project studies how to declaratively specify combinations of data structures with complex sharing relationships from which a synthesis engine can generate provably correct and efficient code.

People

• Peter Hawkins
• Alex Aiken
• Martin Rinard
• Mooly Sagiv

Papers

• P. Hawkins, A. Aiken, K. Fisher, M. Rinard, and M. Sagiv. Concurrent data representation synthesis. In PLDI ’12: Proceedings of the 2012 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2012. Winner of 2012 PLDI Distinguished Paper Award.
• P. Hawkins, A. Aiken, K. Fisher, M. Rinard, and M. Sagiv. Reasoning about lock placements. In European Symposium on Programming, 2012.
• P. Hawkins, A. Aiken, K. Fisher, M. Rinard, and M. Sagiv. Data representation synthesis. In PLDI ’11: Proceedings of the 2011 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2011. Winner of 2011 PLDI Best Paper Award.

GitHub

• https://github.com/amiltner/LensSynth