Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDC. Aiswarya
Person information
- affiliation: Chennai Mathematical Institute
- affiliation: Uppsala University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2014
[b1]Aiswarya Cyriac:
Verification of communicating recursive programs via split-width. (Vérification de programmes récursifs et communicants via split-width). École normale supérieure de Cachan, France, 2014
Journal Articles
- 2022
- [j4]C. Aiswarya, Vikraman Arvind, Saket Saurabh:
Theory research in India: 2019-2022. Commun. ACM 65(11): 88-93 (2022) - [j3]C. Aiswarya:
How treewidth helps in verification. ACM SIGLOG News 9(1): 6-21 (2022) - 2018
- [j2]C. Aiswarya
, Benedikt Bollig, Paul Gastin:
An automata-theoretic approach to the verification of distributed algorithms. Inf. Comput. 259(3): 305-327 (2018) - 2014
- [j1]Benedikt Bollig, C. Aiswarya, Paul Gastin, Marc Zeitoun:
Temporal logics for concurrent recursive programs: Satisfiability and model checking. J. Appl. Log. 12(4): 395-416 (2014)
Conference and Workshop Papers
- 2024
- [c19]C. Aiswarya, Soumodev Mal, Prakash Saivasan:
Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers. STACS 2024: 5:1-5:20 - 2022
- [c18]C. Aiswarya, Sahil Mhaskar, M. Praveen:
Checking Regular Invariance Under Tightly-Controlled String Modifications. DLT 2022: 57-68 - [c17]C. Aiswarya, Soumodev Mal, Prakash Saivasan:
On the Satisfiability of Context-free String Constraints with Subword-Ordering. LICS 2022: 6:1-6:13 - 2020
- [c16]C. Aiswarya, Paul Gastin:
Weighted Tiling Systems for Graphs: Evaluation Complexity. FSTTCS 2020: 34:1-34:17 - [c15]C. Aiswarya:
On Network Topologies and the Decidability of Reachability Problem. NETYS 2020: 3-10 - 2019
- [c14]Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali:
Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding. PODS 2019: 335-352 - 2018
- [c13]Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali, Othmane Rezine:
Complexity of Reachability for Data-Aware Dynamic Systems. ACSD 2018: 11-20 - 2017
- [c12]Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig:
Data Multi-Pushdown Automata. CONCUR 2017: 38:1-38:17 - 2016
- [c11]Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig:
Data Communicating Processes with Unreliable Channels. LICS 2016: 166-175 - [c10]Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali, Othmane Rezine:
Recency-Bounded Verification of Dynamic Database-Driven Systems. PODS 2016: 195-210 - 2015
- [c9]C. Aiswarya, Benedikt Bollig, Paul Gastin:
An Automata-Theoretic Approach to the Verification of Distributed Algorithms. CONCUR 2015: 340-353 - [c8]C. Aiswarya:
Model Checking Dynamic Distributed Systems. NETYS 2015: 48-61 - 2014
- [c7]C. Aiswarya, Paul Gastin, K. Narayan Kumar:
Verifying Communicating Multi-pushdown Systems via Split-Width. ATVA 2014: 1-17 - [c6]C. Aiswarya, Paul Gastin, K. Narayan Kumar:
Controllers for the Verification of Communicating Multi-pushdown Systems. CONCUR 2014: 297-311 - [c5]C. Aiswarya, Paul Gastin:
Reasoning About Distributed Systems: WYSIWYG (Invited Talk). FSTTCS 2014: 11-30 - 2013
- [c4]Benedikt Bollig, Aiswarya Cyriac, Loïc Hélouët, Ahmet Kara, Thomas Schwentick:
Dynamic Communicating Automata and Branching High-Level MSCs. LATA 2013: 177-189 - 2012
- [c3]Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar:
MSO Decidability of Multi-Pushdown Systems via Split-Width. CONCUR 2012: 547-561 - [c2]Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar:
Model Checking Languages of Data Words. FoSSaCS 2012: 391-405 - 2011
- [c1]Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun:
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. MFCS 2011: 132-144
Informal and Other Publications
- 2024
- [i7]C. Aiswarya, Soumodev Mal, Prakash Saivasan:
Satisfiability of Context-free String Constraints with Subword-ordering and Transducers. CoRR abs/2401.07996 (2024) - 2023
- [i6]C. Aiswarya, Amaldev Manuel, Saina Sunny:
Deciding Conjugacy of a Rational Relation. CoRR abs/2307.06777 (2023) - 2020
- [i5]C. Aiswarya, Paul Gastin:
Weighted Tiling Systems for Graphs: Evaluation Complexity. CoRR abs/2009.14542 (2020) - 2016
- [i4]Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali, Othmane Rezine:
Recency-Bounded Verification of Dynamic Database-Driven Systems (Extended Version). CoRR abs/1604.03413 (2016) - [i3]C. Aiswarya, Paul Gastin, Prakash Saivasan:
Nested Words for Order-2 Pushdown Systems. CoRR abs/1609.06290 (2016) - 2015
- [i2]C. Aiswarya, Benedikt Bollig, Paul Gastin:
An Automata-Theoretic Approach to the Verification of Distributed Algorithms. CoRR abs/1504.06534 (2015) - 2008
- [i1]Aiswarya Cyriac, K. Murali Krishnan:
Lower Bound for the Communication Complexity of the Russian Cards Problem. CoRR abs/0805.1974 (2008)
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-03-13 00:23 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:
