S. Akshay

According to our database, S. Akshay authored at least 64 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

Tractable representations for Boolean functional synthesis.

S. Akshay, Supratik Chakraborty, Shetal Shah

Ann. Math. Artif. Intell., October, 2024

Simulations for Event-Clock Automata.

S. Akshay, Paul Gastin, R. Govind, B. Srivathsan

Log. Methods Comput. Sci., 2024

On Robustness for the Skolem, Positivity and Ultimate Positivity Problems.

S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala

Log. Methods Comput. Sci., 2024

Automated Synthesis: Functional, Reactive and Beyond (Dagstuhl Seminar 24171).

S. Akshay, Bernd Finkbeiner, Kuldeep S. Meel, Ruzica Piskac, Arijit Shaw

Dagstuhl Reports, 2024

On Dependent Variables in Reactive Synthesis.

S. Akshay, Eliyahu Basa, Supratik Chakraborty, Dror Fried

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

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

Proceedings of the LPAR 2024: Proceedings of 25th Conference on Logic for Programming, 2024

Certified Policy Verification and Synthesis for MDPs under Distributional Reach-Avoidance Properties.

S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic.

S. Akshay, Supratik Chakraborty, Amir Kafshdar Goharshady, R. Govind, Harshit J. Motwani, Sai Teja Varanasi

Proceedings of the Formal Methods - 26th International Symposium, 2024

Causally Deterministic Markov Decision Processes.

S. Akshay, Tobias Meggendorfer, P. S. Thiagarajan

Proceedings of the 35th International Conference on Concurrency Theory, 2024

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm.

S. Akshay, Paul Gastin, R. Govind, B. Srivathsan

Proceedings of the 35th International Conference on Concurrency Theory, 2024

Auditable Algorithms for Approximate Model Counting.

Kuldeep S. Meel, Supratik Chakraborty, S. Akshay

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Learning Monitor Ensembles for Operational Design Domains.

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

Proceedings of the Runtime Verification - 23rd International Conference, 2023

A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation.

S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.

S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis.

S. Akshay, Supratik Chakraborty, Sahil Jain

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

Using Counterexamples to Improve Robustness Verification in Neural Networks.

Mohammad Afzal, Ashutosh Gupta, S. Akshay

Proceedings of the Automated Technology for Verification and Analysis, 2023

2022

On Robustness for the Skolem and Positivity Problems.

S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

On Synthesizing Computable Skolem Functions for First Order Logic.

Supratik Chakraborty, S. Akshay

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

On Eventual Non-negativity and Positivity for the Weighted Sum of Powers of Matrices.

S. Akshay, Supratik Chakraborty, Debtanu Pal

Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

2021

Boolean functional synthesis: hardness and practical algorithms.

S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah

Formal Methods Syst. Des., 2021

On synthesizing Skolem functions for first order logic formulae.

S. Akshay, Supratik Chakraborty

CoRR, 2021

A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis.

Preey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Resilience of Timed Systems.

S. Akshay, Blaise Genest, Loïc Hélouët, S. Krishna, Sparsa Roychowdhury

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Synthesizing Pareto-Optimal Interpretations for Black-Box Models.

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

Proceedings of the Formal Methods in Computer Aided Design, 2021

Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata.

S. Akshay, Paul Gastin, Karthik R. Prakash

Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020

Dataset for Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice.

S. Akshay, Kuldeep S. Meel

Dataset, April, 2020

Combining free choice and time in Petri nets.

S. Akshay, Loïc Hélouët, Ramchandra Phawade

J. Log. Algebraic Methods Program., 2020

Revisiting Underapproximate Reachability for Multipushdown Systems.

S. Akshay, Paul Gastin, S. Krishna, Sparsa Roychowdhury

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Near-Optimal Complexity Bounds for Fragments of the Skolem Problem.

S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice.

Kuldeep S. Meel, S. Akshay

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Timed Negotiations.

S. Akshay, Blaise Genest, Loïc Hélouët, Sharvik Mital

Proceedings of the Foundations of Software Science and Computation Structures, 2020

2019

Timed Systems through the Lens of Logic.

S. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Classification Among Hidden Markov Models.

S. Akshay, Hugo Bazille, Eric Fabre, Blaise Genest

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Continuous Reachability for Unordered Data Petri Nets is in PTime.

Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman

Proceedings of the Foundations of Software Science and Computation Structures, 2019

Knowledge Compilation for Boolean Functional Synthesis.

S. Akshay, Jatin Arora, Supratik Chakraborty, Shankara Narayanan Krishna, Divya Raghunathan, Shetal Shah

Proceedings of the 2019 Formal Methods in Computer Aided Design, 2019

Functional Significance Checking in Noisy Gene Regulatory Networks.

S. Akshay, Sukanya Basu, Supratik Chakraborty, Rangapriya Sundararajan, Prasanna Venkatraman

Proceedings of the Principles and Practice of Constraint Programming, 2019

2018

Analyzing Timed Systems Using Tree Automata.

S. Akshay, Paul Gastin, Shankara Narayanan Krishna

Log. Methods Comput. Sci., 2018

Distribution-based objectives for Markov Decision Processes.

S. Akshay, Blaise Genest, Nikhil Vyas

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

What's Hard About Boolean Functional Synthesis?

S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah

Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017

Towards Parallel Boolean Functional Synthesis.

S. Akshay, Supratik Chakraborty, Ajith K. John, Shetal Shah

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Complexity of Restricted Variants of Skolem and Related Problems.

S. Akshay, Nikhil Balaji, Nikhil Vyas

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Towards an Efficient Tree Automata Based Technique for Timed Systems.

S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar

Proceedings of the 28th International Conference on Concurrency Theory, 2017

On Petri Nets with Hierarchical Special Arcs.

S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep

Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016

Robustness of Time Petri Nets under Guard Enlargement.

S. Akshay, Loïc Hélouët, Claude Jard, Pierre-Alain Reynier

Fundam. Informaticae, 2016

On Regularity of Unary Probabilistic Automata.

S. Akshay, Blaise Genest, Bruno Karelovic, Nikhil Vyas

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Stochastic Timed Games Revisited.

S. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Decidable Classes of Unbounded Petri Nets with Time and Urgency.

S. Akshay, Blaise Genest, Loïc Hélouët

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2016

2015

Checking conformance for time-constrained scenario-based specifications.

S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar

Theor. Comput. Sci., 2015

Approximate Verification of the Symbolic Dynamics of Markov Chains.

Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan

J. ACM, 2015

Reachability problems for Markov chains.

S. Akshay, Timos Antonopoulos, Joël Ouaknine, James Worrell

Inf. Process. Lett., 2015

Skolem Functions for Factored Formulas.

Ajith K. John, Shetal Shah, Supratik Chakraborty, Ashutosh Trivedi, S. Akshay

Proceedings of the Formal Methods in Computer-Aided Design, 2015

2014

Distributed Timed Automata with Independently Evolving Clocks.

S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar

Fundam. Informaticae, 2014

Sessions with an Unbounded Number of Agents.

S. Akshay, Loïc Hélouët, Madhavan Mukund

Proceedings of the 14th International Conference on Application of Concurrency to System Design, 2014

2013

Event clock message passing automata: a logical characterization and an emptiness checking algorithm.

S. Akshay, Benedikt Bollig, Paul Gastin

Formal Methods Syst. Des., 2013

The Steady-State Control Problem for Markov Decision Processes.

S. Akshay, Nathalie Bertrand, Serge Haddad, Loïc Hélouët

Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

Implementing Realistic Asynchronous Automata.

S. Akshay, Ionut Dinca, Blaise Genest, Alin Stefanescu

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application.

Sucheendra K. Palaniappan, S. Akshay, Bing Liu, Blaise Genest, P. S. Thiagarajan

IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Regular set of representatives for time-constrained MSC graphs.

S. Akshay, Blaise Genest, Loïc Hélouët, Shaofa Yang

Inf. Process. Lett., 2012

Symbolically Bounding the Drift in Time-Constrained MSC Graphs.

S. Akshay, Blaise Genest, Loïc Hélouët, Shaofa Yang

Proceedings of the Theoretical Aspects of Computing - ICTAC 2012, 2012

Robustness of Time Petri Nets under Architectural Constraints.

S. Akshay, Loïc Hélouët, Claude Jard, Didier Lime, Olivier H. Roux

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2012

2011

A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways.

Sucheendra K. Palaniappan, S. Akshay, Blaise Genest, P. S. Thiagarajan

Proceedings of the Computational Methods in Systems Biology, 9th International Conference, 2011

2010

Model checking time-constrained scenario-based specifications.

S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2007

Automata and Logics for Timed Message Sequence Charts.

S. Akshay, Benedikt Bollig, Paul Gastin

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Checking Coverage for Infinite Collections of Timed Scenarios.

S. Akshay, Madhavan Mukund, K. Narayan Kumar

Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007