Ramanathan S. Thinniyam

MaRDI QIDQ2044218zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The complexity of bounded context switching with dynamic thread creation	2026-03-18	Paper
Context-bounded analysis of concurrent programs (invited talk)	2024-11-14	Paper
Checking refinement of asynchronous programs against context-free specifications	2024-11-14	Paper
Existential definability over the subword ordering	2024-04-23	Paper
Existential Definability over the Subword Ordering Logical Methods in Computer Science	2024-01-16	Paper
Regular Separability and Intersection Emptiness Are Independent Problems (available as arXiv preprint)	2023-02-03	Paper
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond Logical Methods in Computer Science	2023-01-09	Paper
General decidability results for asynchronous shared-memory programs: higher-order and beyond (available as arXiv preprint)	2021-08-04	Paper
Definability of recursive predicates in the induced subgraph order Logic and Its Applications	2019-07-24	Paper
Defining recursive predicates in graph orders (available as arXiv preprint)	2018-09-26	Paper

Research outcomes over time

This page was built for person: Ramanathan S. Thinniyam