Tue 6 Nov 2018 10:30 - 11:00 at St. James - DSLs that compute

Reachability in pushdown automata has a variety of applications in program analysis. As analyses grow more complex, so do the automata they use. While mathematically elegant, the implementation of reachability for complex automata is an engineering-intensive process. We present a DSL designed to simplify the specification of complex pushdown automata and aid in the development of more sophisticated program analyses.

Tue 6 Nov

dsldi-2018-talks
10:30 - 12:00: DSLDI 2018 - DSLs that compute at St. James
dsldi-2018-talks10:30 - 11:00
Talk
Zachary PalmerSwarthmore College, Charlotte RatySwarthmore College
dsldi-2018-talks11:00 - 11:30
Talk
Nada AminUniversity of Cambridge, William E. ByrdUniversity of Alabama at Birmingham, USA
dsldi-2018-talks11:30 - 12:00
Talk