Mon 20 - Fri 24 October 2014 Portland, Oregon, United States
Wed 22 Oct 2014 13:52 - 14:15 at Salon E - Domain Specific Languages Chair(s): Yannis Smaragdakis

Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) have been leveraged in solving a wide variety of important and challenging problems, including automatic test generation, model checking, and program synthesis. For these applications to scale to larger problem instances, developers cannot solely rely on the sophistication of SAT and SMT solvers to efficiently solve their queries; they must also optimize their own orchestration and construction of queries. We present Smten, a high-level language for orchestrating and constructing satisfiability-based search queries. We show that applications developed using Smten require significantly fewer lines of code and less developer effort to achieve results comparable to standard SMT-based tools.

Wed 22 Oct
Times are displayed in time zone: (GMT-07:00) Tijuana, Baja California change

13:30 - 15:00: OOPSLA - Domain Specific Languages at Salon E
Chair(s): Yannis SmaragdakisUniversity of Athens
oopsla201413:30 - 13:52
Eric HolkIndiana University, Ryan R. NewtonIndiana University, Jeremy G. Siek, Andrew LumsdaineIndiana University
Link to publication
oopsla201413:52 - 14:15
Richard UhlerMIT-CSAIL, Nirav DaveSRI International
Link to publication
oopsla201414:15 - 14:37
Jeffrey BosboomMIT CSAIL, Sumanaruban RajaduraiNational University of Singapore, Weng-Fai WongNational University of Singapore, Saman AmarasingheMIT
Link to publication
oopsla201414:37 - 15:00
Emma ToschUniversity of Massachusetts, Amherst, Emery BergerUniversity of Massachusetts, Amherst
Link to publication File Attached