Ramanathan S. Thinniyam

According to our database, Ramanathan S. Thinniyam authored at least 14 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Checking Consistency of Event-Driven Traces.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, R. Govind, Samuel Grahn, Ramanathan S. Thinniyam

Proceedings of the Programming Languages and Systems - 23rd Asian Symposium, 2025

2024

Reachability in Continuous Pushdown VASS.

A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche

Proc. ACM Program. Lang., January, 2024

2023

Context-Bounded Verification of Context-Free Specifications.

Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche

Proc. ACM Program. Lang., January, 2023

Checking Refinement of Asynchronous Programs Against Context-Free Specifications.

Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Context-Bounded Analysis of Concurrent Programs (Invited Talk).

Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Context-bounded verification of thread pools.

Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche

Proc. ACM Program. Lang., 2022

Existential Definability over the Subword Ordering.

Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

Context-bounded verification of liveness properties for multithreaded shared-memory programs.

Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche

Proc. ACM Program. Lang., 2021

General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond.

Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

2020

The Complexity of Bounded Context Switching with Dynamic Thread Creation.

Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Regular Separability and Intersection Emptiness Are Independent Problems.

Ramanathan S. Thinniyam, Georg Zetzsche

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

Defining Recursive Predicates in Graph Orders.

Ramanathan S. Thinniyam

Log. Methods Comput. Sci., 2018

2017

Definability of Recursive Predicates in the Induced Subgraph Order.

Ramanathan S. Thinniyam

Proceedings of the Logic and Its Applications - 7th Indian Conference, 2017

2016

Definability in First Order Theories of Graph Orderings.

Ramaswamy Ramanujam, Ramanathan S. Thinniyam

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016