Program for Thursday, October 21st: Talk View

PROGRAM FOR THURSDAY, OCTOBER 21ST: TALK VIEW

Days:

previous day

next day

all days

View: with abstracts session overview

11:00

11:30

12:00

12:30

13:00

13:30

14:00

14:30

15:00

15:30

16:00

11:00-12:00

Algorithms for the People

Seny Kamara

12:05-13:20

Exploiting Isomorphic Subgraphs in SAT

Alexander Ivrii, Ofer Strichman

12:05-13:20

On Decomposition of Maximal Satisfiable Subsets

Jaroslav Bendík

12:05-13:20

Designing Samplers is Easy: The Boon of Testers

Priyanka Golia, Mate Soos, Sourav Chakraborty, Kuldeep S. Meel

12:05-13:20

SAT-Inspired Eliminations for Superposition

Petar Vukmirović, Jasmin Blanchette, Marijn Heule

12:05-13:20

SAT Solving in the Serverless Cloud

Alex Ozdemir, Haoze Wu, Clark Barrett

13:40-14:55

Pruning and Slicing Neural Networks using Formal Verification

Ori Lahav, Guy Katz

13:40-14:55

Towards Scalable Verification of Deep Reinforcement Learning

Guy Amir, Michael Schapira, Guy Katz

13:40-14:55

Synthesizing Pareto-optimal Interpretations for Black-Box Models

Hazem Torfah, Shetal Shah, Supratik Chakraborty, S. Akshay, Sanjit A. Seshia

13:40-14:55

Dynamic Partial Order Reductions for Spinloops

Michalis Kokologiannakis, Xiaowei Ren, Viktor Vafeiadis

13:40-14:55

Robustness between Weak Memory Models

Soham Chakraborty

15:15-16:15 Session 13