default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Akshay 0001
Person information
- affiliation: Indian Institute of Technology Bombay, Mumbai, India
- affiliation (former): INRIA/IRISA Rennes, France
Other persons with the same name
- S. Akshay 0002
![[0000-0002-5740-7421]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-5740-7421")
— Amrita Vishwa Vidyapeetham, School of Computing, Mysuru, India - S. Akshay 0003 — Amrita School of Engineering, Coimbatore, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j14]S. Akshay, Supratik Chakraborty, Shetal Shah:
Tractable representations for Boolean functional synthesis. Ann. Math. Artif. Intell. 92(5): 1051-1096 (2024)- [j13]S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala:
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems. Log. Methods Comput. Sci. 20(2) (2024) - [j12]S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
Simulations for Event-Clock Automata. Log. Methods Comput. Sci. 20(3) (2024) - [c53]Kuldeep S. Meel, Supratik Chakraborty, S. Akshay:
Auditable Algorithms for Approximate Model Counting. AAAI 2024: 10654-10661 - [c52]S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. CONCUR 2024: 5:1-5:19 - [c51]S. Akshay, Tobias Meggendorfer, P. S. Thiagarajan:
Causally Deterministic Markov Decision Processes. CONCUR 2024: 6:1-6:22 - [c50]S. Akshay, Supratik Chakraborty, Amir Kafshdar Goharshady, R. Govind, Harshit J. Motwani, Sai Teja Varanasi:
Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic. FM (1) 2024: 111-130 - [c49]S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic:
Certified Policy Verification and Synthesis for MDPs under Distributional Reach-Avoidance Properties. IJCAI 2024: 3-12 - [c48]S. Akshay, Supratik Chakraborty, Amir Kafshdar Goharshady, R. Govind, Harshit J. Motwani, Sai Teja Varanasi:
Automated Synthesis of Decision Lists for Polynomial Specifications over Integers. LPAR 2024: 484-502 - [c47]S. Akshay, Eliyahu Basa, Supratik Chakraborty, Dror Fried:
On Dependent Variables in Reactive Synthesis. TACAS (1) 2024: 123-143 - [i27]S. Akshay, Eliyahu Basa, Supratik Chakraborty, Dror Fried:
On Dependent Variables in Reactive Synthesis. CoRR abs/2401.11290 (2024) - [i26]S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic:
Certified Policy Verification and Synthesis for MDPs under Distributional Reach-avoidance Properties. CoRR abs/2405.04015 (2024) - [i25]S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. CoRR abs/2407.08452 (2024) - [i24]S. Akshay, Bernd Finkbeiner, Kuldeep S. Meel, Ruzica Piskac, Arijit Shaw:
Automated Synthesis: Functional, Reactive and Beyond (Dagstuhl Seminar 24171). Dagstuhl Reports 14(4): 85-107 (2024) - 2023
- [c46]Mohammad Afzal, Ashutosh Gupta, S. Akshay:
Using Counterexamples to Improve Robustness Verification in Neural Networks. ATVA (1) 2023: 422-443 - [c45]S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic:
MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives. CAV (3) 2023: 86-112 - [c44]S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan:
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. CAV (1) 2023: 266-288 - [c43]S. Akshay, Supratik Chakraborty, Sahil Jain:
Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis. CAV (1) 2023: 367-389 - [c42]Hazem Torfah, Aniruddha R. Joshi, Shetal Shah, S. Akshay, Supratik Chakraborty, Sanjit A. Seshia:
Learning Monitor Ensembles for Operational Design Domains. RV 2023: 271-290 - [i23]S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic:
MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives. CoRR abs/2305.16796 (2023) - [i22]S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan:
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. CoRR abs/2305.17824 (2023) - [i21]Kuldeep S. Meel, Supratik Chakraborty, S. Akshay:
Auditable Algorithms for Approximate Model Counting. CoRR abs/2312.12362 (2023) - 2022
- [c41]S. Akshay, Supratik Chakraborty, Debtanu Pal:
On Eventual Non-negativity and Positivity for the Weighted Sum of Powers of Matrices. IJCAR 2022: 671-690 - [c40]S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
Simulations for Event-Clock Automata. CONCUR 2022: 13:1-13:18 - [c39]Supratik Chakraborty, S. Akshay:
On Synthesizing Computable Skolem Functions for First Order Logic. MFCS 2022: 30:1-30:15 - [c38]S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala:
On Robustness for the Skolem and Positivity Problems. STACS 2022: 5:1-5:20 - [i20]S. Akshay, Supratik Chakraborty, Debtanu Pal:
On eventual non-negativity and positivity for the weighted sum of powers of matrices. CoRR abs/2205.09190 (2022) - [i19]S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
Simulations for Event-Clock Automata. CoRR abs/2207.02633 (2022) - [i18]S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala:
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems. CoRR abs/2211.02365 (2022) - 2021
- [j11]S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah:
Boolean functional synthesis: hardness and practical algorithms. Formal Methods Syst. Des. 57(1): 53-86 (2021) - [c37]S. Akshay, Paul Gastin, Karthik R. Prakash:
Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata. CAV (1) 2021: 619-642 - [c36]Hazem Torfah, Shetal Shah, Supratik Chakraborty, S. Akshay, Sanjit A. Seshia:
Synthesizing Pareto-Optimal Interpretations for Black-Box Models. FMCAD 2021: 153-162 - [c35]S. Akshay, Blaise Genest, Loïc Hélouët, S. Krishna, Sparsa Roychowdhury:
Resilience of Timed Systems. FSTTCS 2021: 33:1-33:22 - [c34]Preey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty:
A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis. LICS 2021: 1-13 - [i17]S. Akshay, Supratik Chakraborty:
On synthesizing Skolem functions for first order logic formulae. CoRR abs/2102.07463 (2021) - [i16]Preey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty:
A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis. CoRR abs/2104.14098 (2021) - [i15]S. Akshay, Paul Gastin, Karthik R. Prakash:
Fast zone-based algorithms for reachability in pushdown timed automata. CoRR abs/2105.13683 (2021) - [i14]Hazem Torfah, Shetal Shah, Supratik Chakraborty, S. Akshay, Sanjit A. Seshia:
Synthesizing Pareto-Optimal Interpretations for Black-Box Models. CoRR abs/2108.07307 (2021) - 2020
- [j10]S. Akshay, Loïc Hélouët, Ramchandra Phawade:
Combining free choice and time in Petri nets. J. Log. Algebraic Methods Program. 110 (2020) - [c33]S. Akshay, Blaise Genest, Loïc Hélouët, Sharvik Mital:
Timed Negotiations. FoSSaCS 2020: 37-56 - [c32]Kuldeep S. Meel, S. Akshay:
Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice. LICS 2020: 728-741 - [c31]S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas:
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. STACS 2020: 37:1-37:18 - [c30]S. Akshay, Paul Gastin, S. Krishna, Sparsa Roychowdhury:
Revisiting Underapproximate Reachability for Multipushdown Systems. TACAS (1) 2020: 387-404 - [d1]S. Akshay, Kuldeep S. Meel:
Dataset for Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice. Zenodo, 2020
- [i13]S. Akshay, Paul Gastin, S. Krishna, Sparsa Roychowdhury:
Revisiting Underapproximate Reachability for Multipushdown Systems. CoRR abs/2002.05950 (2020) - [i12]Kuldeep S. Meel, S. Akshay:
Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice. CoRR abs/2004.14692 (2020)
2010 – 2019
- 2019
- [c29]S. Akshay, Sukanya Basu, Supratik Chakraborty, Rangapriya Sundararajan, Prasanna Venkatraman:
Functional Significance Checking in Noisy Gene Regulatory Networks. CP 2019: 767-785 - [c28]S. Akshay, Jatin Arora, Supratik Chakraborty, Shankara Narayanan Krishna, Divya Raghunathan, Shetal Shah:
Knowledge Compilation for Boolean Functional Synthesis. FMCAD 2019: 161-169 - [c27]Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman:
Continuous Reachability for Unordered Data Petri Nets is in PTime. FoSSaCS 2019: 260-276 - [c26]S. Akshay, Hugo Bazille, Eric Fabre, Blaise Genest:
Classification Among Hidden Markov Models. FSTTCS 2019: 29:1-29:14 - [c25]S. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna:
Timed Systems through the Lens of Logic. LICS 2019: 1-13 - [i11]Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman:
Continuous Reachability for Unordered Data Petri nets is in PTime. CoRR abs/1902.05604 (2019) - [i10]S. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna:
Timed Systems through the Lens of Logic. CoRR abs/1903.03773 (2019) - [i9]S. Akshay, Jatin Arora, Supratik Chakraborty, Shankara Narayanan Krishna, Divya Raghunathan, Shetal Shah:
Knowledge Compilation for Boolean Functional Synthesis. CoRR abs/1908.06275 (2019) - 2018
- [j9]S. Akshay, Paul Gastin, Shankara Narayanan Krishna:
Analyzing Timed Systems Using Tree Automata. Log. Methods Comput. Sci. 14(2) (2018) - [c24]S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah:
What's Hard About Boolean Functional Synthesis? CAV (1) 2018: 251-269 - [c23]S. Akshay, Blaise Genest, Nikhil Vyas:
Distribution-based objectives for Markov Decision Processes. LICS 2018: 36-45 - [i8]S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah:
What's hard about Boolean Functional Synthesis. CoRR abs/1804.05507 (2018) - [i7]S. Akshay, Blaise Genest, Nikhil Vyas:
Distribution-based objectives for Markov Decision Processes. CoRR abs/1804.09341 (2018) - 2017
- [c22]S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar:
Towards an Efficient Tree Automata Based Technique for Timed Systems. CONCUR 2017: 39:1-39:15 - [c21]S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep:
On Petri Nets with Hierarchical Special Arcs. CONCUR 2017: 40:1-40:17 - [c20]S. Akshay, Nikhil Balaji, Nikhil Vyas:
Complexity of Restricted Variants of Skolem and Related Problems. MFCS 2017: 78:1-78:14 - [c19]S. Akshay, Supratik Chakraborty, Ajith K. John, Shetal Shah:
Towards Parallel Boolean Functional Synthesis. TACAS (1) 2017: 337-353 - [i6]S. Akshay, Supratik Chakraborty, Ajith K. John, Shetal Shah:
Towards Parallel Boolean Functional Synthesis. CoRR abs/1703.01440 (2017) - [i5]S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep:
On Petri Nets with Hierarchical Special Arcs. CoRR abs/1707.01157 (2017) - [i4]S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar:
Towards an Efficient Tree Automata based technique for Timed Systems. CoRR abs/1707.02297 (2017) - 2016
- [j8]S. Akshay, Loïc Hélouët, Claude Jard, Pierre-Alain Reynier:
Robustness of Time Petri Nets under Guard Enlargement. Fundam. Informaticae 143(3-4): 207-234 (2016) - [c18]S. Akshay, Blaise Genest, Loïc Hélouët:
Decidable Classes of Unbounded Petri Nets with Time and Urgency. Petri Nets 2016: 301-322 - [c17]S. Akshay, Paul Gastin, Shankara Narayanan Krishna:
Analyzing Timed Systems Using Tree Automata. CONCUR 2016: 27:1-27:14 - [c16]S. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Stochastic Timed Games Revisited. MFCS 2016: 8:1-8:14 - [c15]S. Akshay, Blaise Genest, Bruno Karelovic, Nikhil Vyas:
On Regularity of Unary Probabilistic Automata. STACS 2016: 8:1-8:14 - [c14]S. Akshay, Loïc Hélouët, Ramchandra Phawade:
Combining Free Choice and Time in Petri Nets. TIME 2016: 120-129 - [e1]Akash Lal, S. Akshay, Saket Saurabh, Sandeep Sen:
36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India. LIPIcs 65, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-027-9 [contents] - [i3]S. Akshay, Paul Gastin, Shankara Narayanan Krishna:
Analyzing Timed Systems Using Tree Automata. CoRR abs/1604.08443 (2016) - [i2]S. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Stochastic Timed Games Revisited. CoRR abs/1607.05671 (2016) - 2015
- [j7]S. Akshay, Timos Antonopoulos, Joël Ouaknine, James Worrell:
Reachability problems for Markov chains. Inf. Process. Lett. 115(2): 155-158 (2015) - [j6]Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan:
Approximate Verification of the Symbolic Dynamics of Markov Chains. J. ACM 62(1): 2:1-2:34 (2015) - [j5]S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Checking conformance for time-constrained scenario-based specifications. Theor. Comput. Sci. 594: 24-43 (2015) - [c13]Ajith K. John, Shetal Shah, Supratik Chakraborty, Ashutosh Trivedi, S. Akshay:
Skolem Functions for Factored Formulas. FMCAD 2015: 73-80 - [i1]Ajith K. John, Shetal Shah, Supratik Chakraborty, Ashutosh Trivedi, S. Akshay:
Skolem Functions for Factored Formulas. CoRR abs/1508.05497 (2015) - 2014
- [j4]S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks. Fundam. Informaticae 130(4): 377-407 (2014) - [c12]S. Akshay, Loïc Hélouët, Madhavan Mukund:
Sessions with an Unbounded Number of Agents. ACSD 2014: 166-175 - 2013
- [j3]S. Akshay, Benedikt Bollig, Paul Gastin:
Event clock message passing automata: a logical characterization and an emptiness checking algorithm. Formal Methods Syst. Des. 42(3): 262-300 (2013) - [c11]S. Akshay, Ionut Dinca, Blaise Genest, Alin Stefanescu:
Implementing Realistic Asynchronous Automata. FSTTCS 2013: 213-224 - [c10]S. Akshay, Nathalie Bertrand, Serge Haddad, Loïc Hélouët:
The Steady-State Control Problem for Markov Decision Processes. QEST 2013: 290-304 - 2012
- [j2]S. Akshay, Blaise Genest, Loïc Hélouët, Shaofa Yang:
Regular set of representatives for time-constrained MSC graphs. Inf. Process. Lett. 112(14-15): 592-598 (2012) - [j1]Sucheendra K. Palaniappan, S. Akshay, Bing Liu, Blaise Genest, P. S. Thiagarajan:
A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application. IEEE ACM Trans. Comput. Biol. Bioinform. 9(5): 1352-1365 (2012) - [c9]S. Akshay, Loïc Hélouët, Claude Jard, Didier Lime, Olivier H. Roux:
Robustness of Time Petri Nets under Architectural Constraints. FORMATS 2012: 11-26 - [c8]S. Akshay, Blaise Genest, Loïc Hélouët, Shaofa Yang:
Symbolically Bounding the Drift in Time-Constrained MSC Graphs. ICTAC 2012: 1-15 - [c7]Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan:
Approximate Verification of the Symbolic Dynamics of Markov Chains. LICS 2012: 55-64 - [c6]S. Akshay, Loïc Hélouët, Claude Jard, Pierre-Alain Reynier:
Robustness of Time Petri Nets under Guard Enlargement. RP 2012: 92-106 - 2011
- [c5]Sucheendra K. Palaniappan, S. Akshay, Blaise Genest, P. S. Thiagarajan:
A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways. CMSB 2011: 35-44 - 2010
- [c4]S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Model checking time-constrained scenario-based specifications. FSTTCS 2010: 204-215
2000 – 2009
- 2008
- [c3]S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks. CONCUR 2008: 82-97 - 2007
- [c2]S. Akshay, Madhavan Mukund, K. Narayan Kumar:
Checking Coverage for Infinite Collections of Timed Scenarios. CONCUR 2007: 181-196 - [c1]S. Akshay, Benedikt Bollig, Paul Gastin:
Automata and Logics for Timed Message Sequence Charts. FSTTCS 2007: 290-302
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
