Wed 15 Jun 2016 16:00 - 16:30 at Grand Ballroom Santa Ynez - New Languages Chair(s): Michael Carbin

We present Flix, a declarative programming language for specifying and solving least fixed point problems, particularly static program analyses. Flix is inspired by Datalog and extends it with lattices and monotone functions. Using Flix, implementors of static analyses can express a broader range of analyses than is currently possible in pure Datalog, while retaining its familiar rule-based syntax.

We define a model-theoretic semantics of Flix as a natural extension of the Datalog semantics. This semantics captures the meaning of Flix programs without imposing any specific evaluation strategy, allowing for different Flix solvers. We have implemented a prototype compiler frontend and runtime for Flix, and used it to express several well-known static analyses, including the IFDS and IDE algorithms. The declarative nature of Flix clearly exposes the strong connections between these two algorithms.

Wed 15 Jun
Times are displayed in time zone: Tijuana, Baja California change

15:30 - 17:00
15:30
30m
Talk
Configuration Synthesis for Programmable Analog Devices with Arco
Research Papers
Sara AchourMassachusetts Institute of Technology, USA, Rahul SarpeshkarMIT, Martin RinardMassachusetts Institute of Technology, USA
Media Attached
16:00
30m
Talk
From Datalog to Flix: A Declarative Language for Fixed Points on Lattices
Research Papers
Magnus MadsenUniversity of Waterloo, Ming-Ho YeeUniversity of Waterloo, Ondřej LhotákUniversity of Waterloo
DOI Media Attached
16:30
30m
Talk
Latte: A Language, Compiler, and Runtime for Elegant and Efficient Deep Neural Networks
Research Papers
Leonard TruongUC Berkeley / Intel Labs, Raj BarikIntel Labs, Ehsan TotoniIntel Labs, Hai LiuIntel Labs, Chick MarkleyUC Berkeley, Armando FoxUC Berkeley, Tatiana ShpeismanIntel Labs
Media Attached