C. Aiswarya

Orcid: 0000-0002-4878-7581

Affiliations:
  • Chennai Mathematical Institute
  • Uppsala University


According to our database1, C. Aiswarya authored at least 26 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023
Deciding Conjugacy of a Rational Relation.
CoRR, 2023

2022
How treewidth helps in verification.
ACM SIGLOG News, 2022

Theory research in India: 2019-2022.
Commun. ACM, 2022

On the Satisfiability of Context-free String Constraints with Subword-Ordering.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Checking Regular Invariance Under Tightly-Controlled String Modifications.
Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2020
On Network Topologies and the Decidability of Reachability Problem.
Proceedings of the Networked Systems - 8th International Conference, 2020

Weighted Tiling Systems for Graphs: Evaluation Complexity.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019
Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

2018
An automata-theoretic approach to the verification of distributed algorithms.
Inf. Comput., 2018

Complexity of Reachability for Data-Aware Dynamic Systems.
Proceedings of the 18th International Conference on Application of Concurrency to System Design, 2018

2017
Data Multi-Pushdown Automata.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Nested Words for Order-2 Pushdown Systems.
CoRR, 2016

Recency-Bounded Verification of Dynamic Database-Driven Systems (Extended Version).
CoRR, 2016

Recency-Bounded Verification of Dynamic Database-Driven Systems.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Data Communicating Processes with Unreliable Channels.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015
Model Checking Dynamic Distributed Systems.
Proceedings of the Networked Systems - Third International Conference, 2015

2014
Verification of communicating recursive programs via split-width. (Vérification de programmes récursifs et communicants via split-width).
PhD thesis, 2014

Temporal logics for concurrent recursive programs: Satisfiability and model checking.
J. Appl. Log., 2014

Reasoning About Distributed Systems: WYSIWYG (Invited Talk).
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Controllers for the Verification of Communicating Multi-pushdown Systems.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Verifying Communicating Multi-pushdown Systems via Split-Width.
Proceedings of the Automated Technology for Verification and Analysis, 2014

2013
Dynamic Communicating Automata and Branching High-Level MSCs.
Proceedings of the Language and Automata Theory and Applications, 2013

2012
Model Checking Languages of Data Words.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

MSO Decidability of Multi-Pushdown Systems via Split-Width.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2008
Lower Bound for the Communication Complexity of the Russian Cards Problem
CoRR, 2008


  Loading...