Making Numerical Program Analysis Fast
Gagandeep Singh, Markus Püschel, Martin Vechev, PLDI 2015.
Posts by Collection
publications
A Practical Construction for Decomposing Numerical Abstract Domains
Gagandeep Singh, Markus Püschel, Martin Vechev, POPL 2018.
Fast Numerical Program Analysis with Reinforcement Learning
Gagandeep Singh, Markus Püschel, Martin Vechev, CAV 2018.
Fast and Effective Robustness Certification
Gagandeep Singh, Timon Gehr, Matthew Mirman, Markus Püschel, Martin Vechev, NeurIPS 2018.
An Abstract Domain for Certifying Neural Networks
Gagandeep Singh, Timon Gehr, Markus Püschel, Martin Vechev, POPL 2019.
Boosting Robustness Certification of Neural Networks
Gagandeep Singh, Timon Gehr, Markus Püschel, Martin Vechev, ICLR 2019.
Certifying Geometric Robustness of Neural Networks
Mislav Balunovic, Maximilian Baader, Gagandeep Singh, Timon Gehr, Martin Vechev, NeurIPS 2019.
Beyond the Single Neuron Convex Barrier for Neural Network Certification
Gagandeep Singh, Rupanshu Ganvir, Markus Püschel, Martin Vechev, NeurIPS 2019.
Learning Fast and Precise Numerical Analysis
Jingxuan He, Gagandeep Singh, Markus Püschel, Martin Vechev, PLDI 2020.
Adversarial Attacks on Probabilistic Autoregressive Forecasting Models
Raphaël Dang-Nhu, Gagandeep Singh, Pavol Bielik, Martin Vechev, ICML 2020.
Scaling Polyhedral Neural Network Verification on GPUs
Christoph Müller, Francois Serre, Gagandeep Singh, Markus Püschel, Martin Vechev, MLSys 2021.
Scalable Polyhedral Verification of Recurrent Neural Networks
Wonryong Ryou, Jiayu Chen, Mislav Balunovic, Gagandeep Singh, Andrei Dan, Martin Vechev, CAV 2021.