We describe an online approach to SMT solver selection using nearest neighbor classification and runtime estimation. We implement and evaluate our approach with MedleySolver, finding that it makes nearly optimal selections and evaluates a dataset of queries three times faster than any indivdual solver.
Wed 23 SepDisplayed time zone: (UTC) Coordinated Universal Time change
Wed 23 Sep
Displayed time zone: (UTC) Coordinated Universal Time change
02:20 - 03:20 | |||
02:20 5mPoster | Dynamic Algorithm Selection for SMT Student Research Competition Nikhil Pimpalkhare University of California, Berkeley | ||
02:25 5mPoster | CrossPriv: User Privacy Preservation Model for Cross-Silo Federated Software Student Research Competition Harshita Diddee Guru Gobind Singh Indraprastha University, Bhrigu Kansra Guru Gobind Singh Indraprastha University | ||
02:30 5mPoster | Scalability and Precision Improvement of Neural Program Synthesis Student Research Competition Yating Zhang National University of Defense Technology | ||
02:35 5mPoster | The Classification and Propagation of Program CommentsSecond place SRC - Undergraduate Student Research Competition Xiangzhe Xu Nanjing University | ||
02:40 5mPoster | Source Code and Binary Level Vulnerability Detection and Hot PatchingThird place SRC - Graduate Student Research Competition Zhengzi Xu Nanyang Technological University | ||
02:45 5mPoster | FLUX: From SQL to GQL query translation tool Student Research Competition Chandan Sharma Auckland University of Technology | ||
02:50 5mPoster | Discovering UI Display Issues with Visual UnderstandingWinner SRC - Graduate Student Research Competition Zhe Liu Laboratory for Internet Software Technologies, Institute of Software Chinese Academy of Sciences, University of Chinese Academy of Sciences | ||