8 citations · 17 across the 11 of their papers we have counts for
13 papers
Parameterized Verification of Quantum Circuits (Technical Report)
Parosh Aziz Abdulla, Yu-Fang Chen, Michal Hečko +4
We present the first fully automatic framework for verifying relational properties of parameterized quantum programs, i.e., a program that, given an input size, generates a corresp…
General Decidability Results for Systems with Continuous Counters
A. R. Balasubramanian, Matthew Hague, Rupak Majumdar +2
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs.…
Checking Consistency of Event-driven Traces
Parosh Aziz Abdulla, Mohamed Faouzi Atig, R. Govind +2
Event-driven programming is a popular paradigm where the flow of execution is controlled by two features: (1) shared memory and (2) sending and receiving of messages between multip…
Reachability in Continuous Pushdown VASS
A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam +1
Pushdown Vector Addition Systems with States (PVASS) consist of finitely many control states, a pushdown stack, and a set of counters that can be incremented and decremented, but n…
Checking Refinement of Asynchronous Programs against Context-Free Specifications
Pascal Baumann, Moses Ganardi, Rupak Majumdar +2
In the language-theoretic approach to refinement verification, we check that the language of traces of an implementation all belong to the language of a specification. We consider…
Existential Definability over the Subword Ordering
Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam +1
We study first-order logic (FO) over the structure consisting of finite words over some alphabet , together with the (non-contiguous) subword ordering. In terms of decidability…
Context-Bounded Verification of Thread Pools
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam +1
Thread pooling is a common programming idiom in which a fixed set of worker threads are maintained to execute tasks concurrently. The workers repeatedly pick tasks and execute them…
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show gene…
Context-Bounded Verification of Liveness Properties for Multithreaded Shared-Memory Programs
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam +1
We study context-bounded verification of liveness properties of multi-threaded, shared-memory programs, where each thread can spawn additional threads. Our main result shows that c…
The complexity of bounded context switching with dynamic thread creation
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam +1
Dynamic networks of concurrent pushdown systems (DCPS) are a theoretical model for multi-threaded recursive programs with shared global state and dynamical creation of threads. The…
Regular Separability and Intersection Emptiness are Independent Problems
Ramanathan S. Thinniyam, Georg Zetzsche
The problem of \emph{regular separability} asks, given two languages and , whether there exists a regular language with and . This prob…
Defining Recursive Predicates in Graph Orders
Ramanathan S. Thinniyam
We study the first order theory of structures over graphs i.e. structures of the form () where is the set of all (isomorphism types of) finite undirect…
Modulo quantifiers over functional vocabularies extending addition
A. Baskar, A. V. Sreejith, R. S. Thinniyam
We show that first order logic (FO) and first order logic extended with modulo counting quantifiers (FOMOD) over purely functional vocabularies which extend addition, satisfy the C…