S. Akshay

Orcid: 0000-0002-2471-5997

Affiliations:
  • Indian Institute of Technology Bombay, Mumbai, India
  • INRIA/IRISA Rennes, France (former)


According to our database1, S. Akshay authored at least 56 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Dependent Variables in Reactive Synthesis.
CoRR, 2024

Auditable Algorithms for Approximate Model Counting.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Learning Monitor Ensembles for Operational Design Domains.
Proceedings of the Runtime Verification - 23rd International Conference, 2023

A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

Using Counterexamples to Improve Robustness Verification in Neural Networks.
Proceedings of the Automated Technology for Verification and Analysis, 2023

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

On Robustness for the Skolem and Positivity Problems.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

On Synthesizing Computable Skolem Functions for First Order Logic.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Simulations for Event-Clock Automata.
Proceedings of the 33rd International Conference on Concurrency Theory, 2022

On Eventual Non-negativity and Positivity for the Weighted Sum of Powers of Matrices.
Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

2021
Boolean functional synthesis: hardness and practical algorithms.
Formal Methods Syst. Des., 2021

On synthesizing Skolem functions for first order logic formulae.
CoRR, 2021

A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Resilience of Timed Systems.
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.
Proceedings of the Formal Methods in Computer Aided Design, 2021

Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Combining free choice and time in Petri nets.
J. Log. Algebraic Methods Program., 2020

Revisiting Underapproximate Reachability for Multipushdown Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Near-Optimal Complexity Bounds for Fragments of the Skolem Problem.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Timed Negotiations.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

2019
Timed Systems through the Lens of Logic.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Classification Among Hidden Markov Models.
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.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

Knowledge Compilation for Boolean Functional Synthesis.
Proceedings of the 2019 Formal Methods in Computer Aided Design, 2019

Functional Significance Checking in Noisy Gene Regulatory Networks.
Proceedings of the Principles and Practice of Constraint Programming, 2019

2018
Analyzing Timed Systems Using Tree Automata.
Log. Methods Comput. Sci., 2018

Distribution-based objectives for Markov Decision Processes.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

What's Hard About Boolean Functional Synthesis?
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
Towards Parallel Boolean Functional Synthesis.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Complexity of Restricted Variants of Skolem and Related Problems.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Towards an Efficient Tree Automata Based Technique for Timed Systems.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

On Petri Nets with Hierarchical Special Arcs.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Robustness of Time Petri Nets under Guard Enlargement.
Fundam. Informaticae, 2016

On Regularity of Unary Probabilistic Automata.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Stochastic Timed Games Revisited.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Decidable Classes of Unbounded Petri Nets with Time and Urgency.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2016

2015
Checking conformance for time-constrained scenario-based specifications.
Theor. Comput. Sci., 2015

Approximate Verification of the Symbolic Dynamics of Markov Chains.
J. ACM, 2015

Reachability problems for Markov chains.
Inf. Process. Lett., 2015

Skolem Functions for Factored Formulas.
Proceedings of the Formal Methods in Computer-Aided Design, 2015

2014
Distributed Timed Automata with Independently Evolving Clocks.
Fundam. Informaticae, 2014

Sessions with an Unbounded Number of Agents.
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.
Formal Methods Syst. Des., 2013

The Steady-State Control Problem for Markov Decision Processes.
Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

Implementing Realistic Asynchronous Automata.
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.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Regular set of representatives for time-constrained MSC graphs.
Inf. Process. Lett., 2012

Symbolically Bounding the Drift in Time-Constrained MSC Graphs.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2012, 2012

Robustness of Time Petri Nets under Architectural Constraints.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2012

2011
A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways.
Proceedings of the Computational Methods in Systems Biology, 9th International Conference, 2011

2010
Model checking time-constrained scenario-based specifications.
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.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Checking Coverage for Infinite Collections of Timed Scenarios.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007


  Loading...