default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRamanathan S. Thinniyam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]A. R. Balasubramanian
, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Reachability in Continuous Pushdown VASS. Proc. ACM Program. Lang. 8(POPL): 90-114 (2024)- 2023
- [j7]Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche:
Existential Definability over the Subword Ordering. Log. Methods Comput. Sci. 19(4) (2023) - [j6]Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Context-Bounded Verification of Context-Free Specifications. Proc. ACM Program. Lang. 7(POPL): 2141-2170 (2023) - [c8]Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Context-Bounded Analysis of Concurrent Programs (Invited Talk). ICALP 2023: 3:1-3:16 - [c7]Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Checking Refinement of Asynchronous Programs Against Context-Free Specifications. ICALP 2023: 110:1-110:20 - [i9]Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Checking Refinement of Asynchronous Programs against Context-Free Specifications. CoRR abs/2306.13058 (2023) - [i8]A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Reachability in Continuous Pushdown VASS. CoRR abs/2310.16798 (2023) - 2022
- [j5]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) - [j4]Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Context-bounded verification of thread pools. Proc. ACM Program. Lang. 6(POPL): 1-28 (2022) - [c6]Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche:
Existential Definability over the Subword Ordering. STACS 2022: 7:1-7:15 - [i7]Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche:
Existential Definability over the Subword Ordering. CoRR abs/2210.15642 (2022) - 2021
- [j3]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): 1-31 (2021) - [c5]Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. TACAS (1) 2021: 449-467 - [i6]Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. CoRR abs/2101.08611 (2021) - [i5]Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Context-Bounded Verification of Thread Pools. CoRR abs/2111.09022 (2021) - 2020
- [j2]R. Ramanujam, Ramanathan S. Thinniyam:
Definability in first-order theories of graph orderings ⋆. J. Log. Comput. 30(1): 403-420 (2020) - [c4]Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
The Complexity of Bounded Context Switching with Dynamic Thread Creation. ICALP 2020: 111:1-111:16 - [i4]Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Context-Bounded Verification of Liveness Properties for Multithreaded Shared-Memory Programs. CoRR abs/2011.04581 (2020) - [i3]Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
The complexity of bounded context switching with dynamic thread creation. CoRR abs/2011.05825 (2020)
2010 – 2019
- 2019
- [c3]Ramanathan S. Thinniyam, Georg Zetzsche:
Regular Separability and Intersection Emptiness Are Independent Problems. FSTTCS 2019: 51:1-51:15 - [i2]Ramanathan S. Thinniyam, Georg Zetzsche:
Regular Separability and Intersection Emptiness are Independent Problems. CoRR abs/1908.04038 (2019) - 2018
- [j1]Ramanathan S. Thinniyam:
Defining Recursive Predicates in Graph Orders. Log. Methods Comput. Sci. 14(3) (2018) - 2017
- [c2]Ramanathan S. Thinniyam:
Definability of Recursive Predicates in the Induced Subgraph Order. ICLA 2017: 211-223 - [i1]Ramanathan S. Thinniyam:
Defining Recursive Predicates in Graph Orders. CoRR abs/1709.03060 (2017) - 2016
- [c1]Ramaswamy Ramanujam, Ramanathan S. Thinniyam:
Definability in First Order Theories of Graph Orderings. LFCS 2016: 331-348
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
