| 2026 | CAV | Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions. | S. Akshay, Supratik Chakraborty, Soroush Farokhnia, Amir Goharshady, Harshit Jitendra Motwani, Dorde Zikelic |
| 2026 | CAV | Quantifying Sensitivity for Tree Ensembles: A Symbolic and Compositional Approach. | Ajinkya Naik, Chaitanya Garg, S. Akshay, Ashutosh Gupta, Kuldeep S. Meel |
| 2026 | FM | Formal Reasoning About Confidence and Automated Verification of Neural Networks. | Mohammad Afzal, S. Akshay, Blaise Genest, Ashutosh Gupta |
| 2026 | IJCAR | Program Synthesis for Non-linear Real Arithmetic: Going Beyond Realizability. | S. Akshay, Supratik Chakraborty, R. Govind, Aniruddha R. Joshi |
| 2026 | KR | Knowledge Compilation for Quantification in Alternating Automata. | S. Akshay, Alfredo Cantarella, Supratik Chakraborty, Bernd Finkbeiner, Niklas Metzger |
| 2026 | SAT | Proof Systems for QBF Synthesis: Extracting Skolem and Herbrand Functions. | S. Akshay, Olaf Beyersdorff, Supratik Chakraborty, Lea Kasche, Meena Mahajan, Luc Nicolas Spachmann |
| 2026 | TACAS | TEMPORA: Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics. | S. Akshay, Prerak Contractor, Paul Gastin, R. Govind, B. Srivathsan |
| 2025 | ATVA | Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models. | Aniruddha R. Joshi, Supratik Chakraborty, S. Akshay, Shetal Shah, Hazem Torfah, Sanjit A. Seshia |
| 2025 | CONCUR | Omega-Regular Verification and Control for Distributional Specifications in MDPs. | S. Akshay, Ouldouz Neysari, Djorde Zikelic |
| 2025 | CONCUR | Chance and Mass Interpretations of Probabilities in Markov Decision Processes. | Yun Chen Tsai, Kittiphon Phalakarn, S. Akshay, Ichiro Hasuo |
| 2025 | ICLR | Sensitivity Verification for Additive Decision Tree Ensembles. | Arhaan Ahmad, Tanay Vineet Tayal, Ashutosh Gupta, S. Akshay |
| 2025 | IJCAI | LP-Based Weighted Model Integration over Non-Linear Real Arithmetic. | S. Akshay, Supratik Chakraborty, Soroush Farokhnia, Amir Kafshdar Goharshady, Harshit Jitendra Motwani, Dorde Zikelic |
| 2025 | KR | Presburger Functional Synthesis: Complexity and Tractable Normal Forms. | S. Akshay, A. R. Balasubramanian, Supratik Chakraborty, Georg Zetzsche |
| 2024 | AAAI | Auditable Algorithms for Approximate Model Counting. | Kuldeep S. Meel, Supratik Chakraborty, S. Akshay |
| 2024 | CONCUR | MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. | S. Akshay, Paul Gastin, R. Govind, B. Srivathsan |
| 2024 | CONCUR | Causally Deterministic Markov Decision Processes. | S. Akshay, Tobias Meggendorfer, P. S. Thiagarajan |
| 2024 | FM | Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic. | S. Akshay, Supratik Chakraborty, Amir Kafshdar Goharshady, R. Govind, Harshit J. Motwani, Sai Teja Varanasi |
| 2024 | IJCAI | Certified Policy Verification and Synthesis for MDPs under Distributional Reach-Avoidance Properties. | S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic |
| 2024 | LPAR | Automated Synthesis of Decision Lists for Polynomial Specifications over Integers. | S. Akshay, Supratik Chakraborty, Amir Kafshdar Goharshady, R. Govind, Harshit J. Motwani, Sai Teja Varanasi |
| 2024 | TACAS | On Dependent Variables in Reactive Synthesis. | S. Akshay, Eliyahu Basa, Supratik Chakraborty, Dror Fried |
| 2023 | ATVA | Using Counterexamples to Improve Robustness Verification in Neural Networks. | Mohammad Afzal, Ashutosh Gupta, S. Akshay |
| 2023 | CAV | Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis. | S. Akshay, Supratik Chakraborty, Sahil Jain |
| 2023 | CAV | MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives. | S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic |
| 2023 | CAV | A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. | S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan |
| 2023 | RV | Learning Monitor Ensembles for Operational Design Domains. | Hazem Torfah, Aniruddha R. Joshi, Shetal Shah, S. Akshay, Supratik Chakraborty, Sanjit A. Seshia |
| 2022 | CADE | On Eventual Non-negativity and Positivity for the Weighted Sum of Powers of Matrices. | S. Akshay, Supratik Chakraborty, Debtanu Pal |
| 2022 | CONCUR | Simulations for Event-Clock Automata. | S. Akshay, Paul Gastin, R. Govind, B. Srivathsan |
| 2022 | MFCS | On Synthesizing Computable Skolem Functions for First Order Logic. | Supratik Chakraborty, S. Akshay |
| 2022 | STACS | On Robustness for the Skolem and Positivity Problems. | S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala |
| 2021 | CAV | Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata. | S. Akshay, Paul Gastin, Karthik R. Prakash |
| 2021 | FMCAD | Synthesizing Pareto-Optimal Interpretations for Black-Box Models. | Hazem Torfah, Shetal Shah, Supratik Chakraborty, S. Akshay, Sanjit A. Seshia |
| 2021 | LICS | A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis. | Preey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty |
| 2020 | FOSSACS | Timed Negotiations. | S. Akshay, Blaise Genest, Loc Hlout, Sharvik Mital |
| 2020 | LICS | Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice. | Kuldeep S. Meel, S. Akshay |
| 2020 | STACS | Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. | S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas |
| 2020 | TACAS | Revisiting Underapproximate Reachability for Multipushdown Systems. | S. Akshay, Paul Gastin, S. Krishna, Sparsa Roychowdhury |
| 2019 | CP | Functional Significance Checking in Noisy Gene Regulatory Networks. | S. Akshay, Sukanya Basu, Supratik Chakraborty, Rangapriya Sundararajan, Prasanna Venkatraman |
| 2019 | FMCAD | Knowledge Compilation for Boolean Functional Synthesis. | S. Akshay, Jatin Arora, Supratik Chakraborty, Shankara Narayanan Krishna, Divya Raghunathan, Shetal Shah |
| 2019 | FOSSACS | Continuous Reachability for Unordered Data Petri Nets is in PTime. | Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman |
| 2019 | LICS | Timed Systems through the Lens of Logic. | S. Akshay, Paul Gastin, Vincent Jug, Shankara Narayanan Krishna |
| 2018 | CAV | What's Hard About Boolean Functional Synthesis? | S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah |
| 2018 | LICS | Distribution-based objectives for Markov Decision Processes. | S. Akshay, Blaise Genest, Nikhil Vyas |
| 2017 | CONCUR | On Petri Nets with Hierarchical Special Arcs. | S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep |
| 2017 | CONCUR | Towards an Efficient Tree Automata Based Technique for Timed Systems. | S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar |
| 2017 | MFCS | Complexity of Restricted Variants of Skolem and Related Problems. | S. Akshay, Nikhil Balaji, Nikhil Vyas |
| 2017 | TACAS | Towards Parallel Boolean Functional Synthesis. | S. Akshay, Supratik Chakraborty, Ajith K. John, Shetal Shah |
| 2016 | CONCUR | Analyzing Timed Systems Using Tree Automata. | S. Akshay, Paul Gastin, Shankara Narayanan Krishna |
| 2016 | MFCS | Stochastic Timed Games Revisited. | S. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi |
| 2016 | STACS | On Regularity of Unary Probabilistic Automata. | S. Akshay, Blaise Genest, Bruno Karelovic, Nikhil Vyas |
| 2016 | TIME | Combining Free Choice and Time in Petri Nets. | S. Akshay, Loc Hlout, Ramchandra Phawade |
| 2015 | FMCAD | Skolem Functions for Factored Formulas. | Ajith K. John, Shetal Shah, Supratik Chakraborty, Ashutosh Trivedi, S. Akshay |
| 2012 | ICTAC | Symbolically Bounding the Drift in Time-Constrained MSC Graphs. | S. Akshay, Blaise Genest, Loc Hlout, Shaofa Yang |
| 2012 | LICS | Approximate Verification of the Symbolic Dynamics of Markov Chains. | Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan |
| 2008 | CONCUR | Distributed Timed Automata with Independently Evolving Clocks. | S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar |
| 2007 | CONCUR | Checking Coverage for Infinite Collections of Timed Scenarios. | S. Akshay, Madhavan Mukund, K. Narayan Kumar |