Ramanathan S. Thinniyam

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 25

Top Topics

Attribute Grammars

Existentially Quantified

Parallel Programming

Top Venues

Proc. ACM Program. Lang.

Log. Methods Comput. Sci.

Publications

A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Reachability in Continuous Pushdown VASS. Proc. ACM Program. Lang. 8 (POPL) (2024)
Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche
Existential Definability over the Subword Ordering. Log. Methods Comput. Sci. 19 (4) (2023)
Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Checking Refinement of Asynchronous Programs against Context-Free Specifications. CoRR (2023)
Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Checking Refinement of Asynchronous Programs Against Context-Free Specifications. ICALP (2023)
A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Reachability in Continuous Pushdown VASS. CoRR (2023)
Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Context-Bounded Verification of Context-Free Specifications. Proc. ACM Program. Lang. 7 (POPL) (2023)
Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Context-Bounded Analysis of Concurrent Programs (Invited Talk). ICALP (2023)
Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. Log. Methods Comput. Sci. 18 (4) (2022)
Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche
Existential Definability over the Subword Ordering. CoRR (2022)
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Context-bounded verification of thread pools. Proc. ACM Program. Lang. 6 (POPL) (2022)
Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche
Existential Definability over the Subword Ordering. STACS (2022)
Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. CoRR (2021)
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Context-Bounded Verification of Thread Pools. CoRR (2021)
Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. TACAS (1) (2021)
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Context-bounded verification of liveness properties for multithreaded shared-memory programs. Proc. ACM Program. Lang. 5 (POPL) (2021)
R. Ramanujam, Ramanathan S. Thinniyam
Definability in first-order theories of graph orderings ⋆. J. Log. Comput. 30 (1) (2020)
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
The complexity of bounded context switching with dynamic thread creation. CoRR (2020)
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Context-Bounded Verification of Liveness Properties for Multithreaded Shared-Memory Programs. CoRR (2020)
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
The Complexity of Bounded Context Switching with Dynamic Thread Creation. ICALP (2020)
Ramanathan S. Thinniyam, Georg Zetzsche
Regular Separability and Intersection Emptiness Are Independent Problems. FSTTCS (2019)
Ramanathan S. Thinniyam, Georg Zetzsche
Regular Separability and Intersection Emptiness are Independent Problems. CoRR (2019)
Ramanathan S. Thinniyam
Defining Recursive Predicates in Graph Orders. Log. Methods Comput. Sci. 14 (3) (2018)
Ramanathan S. Thinniyam
Definability of Recursive Predicates in the Induced Subgraph Order. ICLA (2017)
Ramanathan S. Thinniyam
Defining Recursive Predicates in Graph Orders. CoRR (2017)
Ramaswamy Ramanujam, Ramanathan S. Thinniyam
Definability in First Order Theories of Graph Orderings. LFCS (2016)