Ramanathan S. Thinniyam

Proc. ACM Program. Lang., January, 2024

2023

Context-Bounded Verification of Context-Free Specifications.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., January, 2023

Existential Definability over the Subword Ordering.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2023

Checking Refinement of Asynchronous Programs Against Context-Free Specifications.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

2022

Context-bounded verification of thread pools.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2022

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

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2022

2021

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

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2021

2020

Definability in first-order theories of graph orderings ⋆.

[BibT_eX]

[DOI]

R. Ramanujam

J. Log. Comput., 2020

The Complexity of Bounded Context Switching with Dynamic Thread Creation.

[BibT_eX]

[DOI]

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

2019

Regular Separability and Intersection Emptiness Are Independent Problems.

[BibT_eX]

[DOI]

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

2018

Defining Recursive Predicates in Graph Orders.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2018

2017

Definability of Recursive Predicates in the Induced Subgraph Order.

[BibT_eX]

[DOI]