10 citations · 14 across the 5 of their papers we have counts for
10 papers
Type-Checking for Pattern-Based Tree Transformations
C. Aiswarya, Sahil Mhaskar, M. Praveen
We introduce and study pattern-based tree transformations. As an illustrating example, consider a source pattern and a target pattern …
Bounded treewidth, multiple context-free grammars, and downward closures
C. Aiswarya, Pascal Baumann, Prakash Saivasan +2
The reachability problem in multi-pushdown automata (MPDA) has many applications in static analysis of recursive programs. An example is safety verification of multi-threaded recur…
Edit Distance of Finite State Transducers
C. Aiswarya, Amaldev Manuel, Saina Sunny
We lift metrics over words to metrics over word-to-word transductions, by defining the distance between two transductions as the supremum of the distances of their respective outpu…
Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
C Aiswarya, Soumodev Mal, Prakash Saivasan
We study the satisfiability of string constraints where context-free membership constraints may be imposed on variables. Additionally a variable may be constrained to be a subword…
Deciding Conjugacy of a Rational Relation
C. Aiswarya, Amaldev Manuel, Saina Sunny
The study of rational relations is fundamental to the study of formal languages and automata theory. A rational relation is conjugate if each pair of words in the relation is conju…
Games on Graphs: From Logic and Automata to Algorithms
Nathanaël Fijalkow, C. Aiswarya, Guy Avni +22
The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared…
Weighted Tiling Systems for Graphs: Evaluation Complexity
C. Aiswarya, Paul Gastin
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes…
Nested Words for Order-2 Pushdown Systems
C. Aiswarya, Paul Gastin, Prakash Saivasan
We study linear time model checking of collapsible higher-order pushdown systems (CPDS) of order 2 (manipulating stack of stacks) against MSO and PDL (propositional dynamic logic w…
Recency-Bounded Verification of Dynamic Database-Driven Systems (Extended Version)
Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig +2
We propose a formalism to model database-driven systems, called database manipulating systems (DMS). The actions of a DMS modify the current instance of a relational database by ad…
An Automata-Theoretic Approach to the Verification of Distributed Algorithms
C. Aiswarya, Benedikt Bollig, Paul Gastin
We introduce an automata-theoretic method for the verification of distributed algorithms running on ring networks. In a distributed algorithm, an arbitrary number of processes coop…