I joined Division of Computer Systems , Department of Information Technology , Uppsala University on 1 June 2023 as a Tenure Track Assistant Professor. From May 2019 to April 2023, I was a postdoc at the Max Planck Institute for Software Systems, Kaiserslautern, where I worked with Georg Zetzsche and Rupak Majumdar . From October 2018 to March 2019, I was a Visiting Fellow at Chennai Mathematical Institute. I defended my PhD. thesis titled ``Definability and Decidability in First Order Theories of Graph Order'' on February 12, 2019. I was guided by Prof. R. Ramanujam of the Theoretical Computer Science department at the Institute of Mathematical Sciences, Chennai, India.

### Context-Bounded Analysis of Concurrent Programs.

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

*Invited Paper at ICALP 2023. Paper*

### Checking Refinement of Asynchronous Programs against Context-Free Specifications.

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

*Accepted at ICALP 2023. Arxiv*

### Context-Bounded Verification of Context-Free Specifications.

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

*Proceedings of the ACM on Programming Languages, Volume 7: 2141-2170 (POPL 2023) Paper*

### Existential Definability over the Subword Ordering.

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

*39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Schloss Dagstuhl-Leibniz-Zentrum fur Informatik. Arxiv Version*

### Context-Bounded Verification of Thread Pools.

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

*Proceedings of the ACM on Programming Languages, Volume 6, Article 17, 28 pages (POPL 2022). Arxiv Version*

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

Rupak Majumdar, Ramanathan S Thinniyam, Georg Zetzsche.

*Tools and Algorithms for the Construction and Analysis of Systems - 27th International Conference, TACAS 2021.*

Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2021). Arxiv Version

*EAPLS Best Paper Award*

### Context-Bounded Verification of Liveness Properties for Multithreaded Shared-Memory Programs.

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

*Proceedings of the ACM on Programming Languages, Volume 5, January 2021 (POPL 2021). Arxiv Version*

*Distinguished Paper Award*

### The Complexity of Bounded Context Switching with Dynamic Thread Creation.

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

*47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Schloss Dagstuhl-Leibniz-Zentrum fur Informatik, 2020. Arxiv Version*

### Regular Separability and Intersection Emptiness are Independent Problems.

Ramanathan S Thinniyam, Georg Zetzsche.

*Foundations of Software Technology and Theoretical Computer Science, 2019. Paper*

### Definability of Recursive Predicates in the Induced Subgraph Order.

Ramanathan S Thinniyam.

*Indian Conference on Logic and Its Applications 2017 Jan 5 (pp. 211-223), Springer, Berlin, Heidelberg Paper .*

### Definability in First Order Theories of Graph Orderings.

Ramaswamy Ramanujam, Ramanathan S Thinniyam.

*International Symposium on Logical Foundations of Computer Science 2016 Jan 4 (pp. 331-348). Springer, Cham. Paper*

### Network Coding in Optical Networks With O/E/O Based Wavelength Conversion.

Ramanathan S Thinniyam, Kim M, Medard M, O Reilly U.

*Optical Fiber Communication (OFC), collocated National Fiber Optic Engineers Conference, 2010 Conference on (OFC/NFOEC) 2010 Mar 21 (pp. 1-3) IEEE. Paper*

### General decidability results for asynchronous shared-memory programs: Higher-order and beyond.

Rupak Majumdar, Ramanathan S. Thinniyam, and Georg Zetzsche.

*Logical Methods in Computer Science 18 (2022). Paper.*

### Definability in First-Order Theories of Graph Orderings.

Ramaswamy Ramanujam, Ramanathan S Thinniyam.

*Journal of Logic and Computation 30.1 (2020): 403-420. Paper.*

### Defining Recursive Predicates in Graph Orders.

Ramanathan S Thinniyam.

*Logical Methods in Computer Science (LMCS). Sep 2018. Volume 14 Issue 3. Paper.*

### Context-Bounded Verification of Concurrent Programs.

Invited talk at Algorithmic Verification Group, Uppsala university, 19 October 2022.

### Context-Bounded Verification of Multithreaded Shared Memory Programs.

Invited talk at STCS seminar, TIFR, Mumbai India, 5 April 2022 (Seminar website).

### Context-Bounded Liveness Verification of Multithreaded Shared-Memory Programs.

Invited talk at IARCS Verification Seminar Series, 1 February 2022 (Seminar website).

### Context Bounded Safety Verification of Thread Pooling in Multithreaded Shared Memory Programs.

Invited talk at the weekly seminar of the PaVeS group, TU Munich, 25 November 2021.

Visiting address:
Room ÅNG 105179 hus 10, Lägerhyddsvägen 1

Postal address: Box 337, 751 05 Uppsala, Sweden

Email: ramanathan [DOT] s [DOT] thinniyam
[AT] it [DOT] uu [DOT] se