Process Specification of Logic Programs. - Ramaswamy Ramanujam; R. K. Shyamasundar (FSTTCS, 1984)

Distributed Processes and the Logic of Knowledge. - Rohit Parikh; Ramaswamy Ramanujam (Logic of Programs, 1985)

Proving Fairness of Schedulers. - Ramaswamy Ramanujam; Kamal Lodaya (Logic of Programs, 1985)

Semantics of Distributed Horn Clause Programs. - Ramaswamy Ramanujam (FSTTCS, 1987)

A logic for distributed transition systems. - Kamal Lodaya; Ramaswamy Ramanujam; P. S. Thiagarajan (REX Workshop, 1988)

Semantics of Distributed Definite Clause Programs. - Ramaswamy Ramanujam (Theor. Comput. Sci., 1989)

Tense Logics for Local Reasoning in Distributed Systems. - Kamal Lodaya; Ramaswamy Ramanujam (FSTTCS, 1991)

Temporal Logics for Communicating Sequential Agents: I. - Kamal Lodaya; Ramaswamy Ramanujam; P. S. Thiagarajan (Int. J. Found. Comput. Sci., 1992)

Knowledge and the Ordering of Events in Distributed Systems. - Paul J. Krasucki; Ramaswamy Ramanujam (TARK, 1994)

A Local Presentation of Synchronizing Systems. - R. Ramanujam 001 (STRICT, 1995)

A Logical Study of Distributed Transition Systems - Kamal Lodaya; Rohit Parikh; Ramaswamy Ramanujam; P. S. Thiagarajan (Inf. Comput., 1995)

Trace Consistency and Inevitablity. - Ramaswamy Ramanujam (FSTTCS, 1996)

Locally Linear Time Temporal Logic. - Ramaswamy Ramanujam (LICS, 1996)

Local Knowledge Assertions in a Changing World. - Ramaswamy Ramanujam (TARK, 1996)

Rules for Trace Consistent Reasoning. - Ramaswamy Ramanujam (ASIAN, 1997)

Assumption-Commitment in Automata. - Swarup Mohalik; Ramaswamy Ramanujam (FSTTCS, 1997)

A Presentation of Regular Languages in the Assumption - Commitment Framework. - Swarup Mohalik; Ramaswamy Ramanujam (ACSD, 1998)

View-Based Explicit Knowledge. - Ramaswamy Ramanujam (Ann. Pure Appl. Log., 1999)

Reasoning about Message Passing in Finite State Environments. - B. Meenakshi 002; Ramaswamy Ramanujam (ICALP, 2000)

An Automaton Model of User-Controlled Navigation on the Web. - Kamal Lodaya; Ramaswamy Ramanujam (CIAA, 2000)

Information based reasoning about security protocols. - Ramaswamy Ramanujam; S. P. Suresh (LACPV@CAV, 2001)

Tagging Makes Secrecy Decidable with Unbounded Nonces as Well. - Ramaswamy Ramanujam; S. P. Suresh (FSTTCS, 2003)

A Knowledge Based Semantics of Messages. - Rohit Parikh; Ramaswamy Ramanujam (J. Log. Lang. Inf., 2003)

Reasoning about layered message passing systems. - B. Meenakshi 002; Ramaswamy Ramanujam (Comput. Lang. Syst. Struct., 2004)

Deciding knowledge properties of security protocols. - Ramaswamy Ramanujam; S. P. Suresh (TARK, 2005)

Decidability of context-explicit security protocols. - Ramaswamy Ramanujam; S. P. Suresh (J. Comput. Secur., 2005)

A (restricted) quantifier elimination for security protocols. - Ramaswamy Ramanujam; S. P. Suresh (Theor. Comput. Sci., 2006)

Knowledge-based modelling of voting protocols. - Anguraj Baskar; Ramaswamy Ramanujam; S. P. Suresh (TARK, 2007)

Structured strategies in games on graphs. - Ramaswamy Ramanujam; Sunil Easaw Simon (Logic and Automata, 2008)

08171 Abstracts Collection - Beyond the Finite: New Challenges in Verification and Semistructured Data. - Anca Muscholl; Ramaswamy Ramanujam; Michaël Rusinowitch; Thomas Schwentick; Victor Vianu (Beyond the Finite: New Challenges in Verification and Semistructured Data, 2008)

08171 Summary - Beyond the Finite: New Challenges in Verification and Semistructured Data. - Anca Muscholl; Ramaswamy Ramanujam; Michaël Rusinowitch; Thomas Schwentick; Victor Vianu (Beyond the Finite: New Challenges in Verification and Semistructured Data, 2008)

Dynamic Logic on Games with Structured Strategies. - Ramaswamy Ramanujam; Sunil Easaw Simon (KR, 2008)

A Dolev-Yao Model for Zero Knowledge. - Anguraj Baskar; Ramaswamy Ramanujam; S. P. Suresh (ASIAN, 2009)

Stability under Strategy Switching. - Soumya Paul; Ramaswamy Ramanujam; Sunil Easaw Simon (CiE, 2009)

An Epistemic Logic for Planning with Trials. - Rajdeep Niyogi; Ramaswamy Ramanujam (LORI, 2009)

Counting Multiplicity over Infinite Alphabets. - Amaldev Manuel; Ramaswamy Ramanujam (RP, 2009)

Dynamic restriction of choices: a preliminary logical report. - Soumya Paul; Ramaswamy Ramanujam; Sunil Easaw Simon (TARK, 2009)

Playing Extensive Form Games in Parallel. - Sujata Ghosh; Ramaswamy Ramanujam; Sunil Easaw Simon (CLIMA, 2010)

A Communication Based Model for Games of Imperfect Information. - Ramaswamy Ramanujam; Sunil Easaw Simon (CONCUR, 2010)

A dexptime-Complete Dolev-Yao Theory with Distributive Encryption. - Anguraj Baskar; Ramaswamy Ramanujam; S. P. Suresh (MFCS, 2010)

Imitation in Large Games - Soumya Paul; Ramaswamy Ramanujam (GANDALF, 2010)

Automata for Epistemic Temporal Logic with Synchronous Communication. - Swarup Mohalik; Ramaswamy Ramanujam (J. Log. Lang. Inf., 2010)

Logic and social interaction: introduction. - Sujata Ghosh; Ramaswamy Ramanujam (Synth., 2010)

Strategies in Games: A Logic-Automata Study. - Sujata Ghosh; Ramaswamy Ramanujam (ESSLLI, 2011)

Dynamic Restriction of Choices: Synthesis of Societal Rules. - Soumya Paul; Ramaswamy Ramanujam (LORI, 2011)

Neighbourhood structure in large games. - Soumya Paul; Ramaswamy Ramanujam (TARK, 2011)

Class Counting Automata on Datawords. - Amaldev Manuel; Ramaswamy Ramanujam (Int. J. Found. Comput. Sci., 2011)

Logic in India - Editorial Introduction. - Hans van Ditmarsch; Rohit Parikh; Ramaswamy Ramanujam (J. Philos. Log., 2011)

Automata over Infinite Alphabets. - Amaldev Manuel; Ramaswamy Ramanujam (Modern Applications of Automata Theory, 2012)

Preface to the Special Issue on Gtora 2012. - M. Seetharama Gowda; Nagarajan Krishnamurthy; T. Parthasarathy; R. Ramanujam 001; G. Ravindran (IGTR, 2013)

Dynamics of Choice restriction in Large Games. - Soumya Paul; Ramaswamy Ramanujam (IGTR, 2013)

Logical Player Types for a Theory of Play. - R. Ramanujam 001 (Johan van Benthem on Logic and Information Dynamics, 2014)

Extending Dolev-Yao with Assertions. - Ramaswamy Ramanujam; Vaishnavi Sundararajan; S. P. Suresh (ICISS, 2014)

A Local Logic for Realizability in Web Service Choreographies. - Ramaswamy Ramanujam; S. Sheerazuddin (WWV, 2014)

Subgames within Large Games and the Heuristic of Imitation. - Soumya Paul; Ramaswamy Ramanujam (Stud Logica, 2014)

Automata and Compositional Strategies in Extensive Form Games. - Soumya Paul; Ramaswamy Ramanujam; Sunil Simon (Models of Strategic Reasoning, 2015)

A Retraction Theorem for Distributed Synthesis. - Dietmar Berwanger; Anup Basil Mathew; R. Ramanujam 001 (CoRR, 2016)

Realizable temporal logics for web service choreography. - Ramaswamy Ramanujam; S. Sheerazuddin (J. Log. Algebraic Methods Program., 2016)

Existential Assertions for Voting Protocols. - R. Ramanujam 001; Vaishnavi Sundararajan; S. P. Suresh (Financial Cryptography Workshops, 2017)

Strategy Composition in Dynamic Games with Simultaneous Moves. - Sujata Ghosh; Neethi Konar; R. Ramanujam 001 (ICAART (2), 2017)

Model Checking a Logic over Systems with Regular Sets of Processes. - Anantha Padmanabha; R. Ramanujam 001 (DIAS/EDUDM@ISEC, 2017)

Deviator Detection under Imperfect Monitoring. - Dietmar Berwanger; R. Ramanujam 001 (CoRR, 2017)

Bundled Fragments of First-Order Modal Logic: (Un)Decidability. - Anantha Padmanabha; R. Ramanujam 001; Yanjing Wang 001 (FSTTCS, 2018)

Propositional Modal Logic with Implicit Modal Quantification. - Anantha Padmanabha; R. Ramanujam 001 (ICLA, 2019)

Two variable fragment of Term Modal Logic. - Anantha Padmanabha; R. Ramanujam 001 (MFCS, 2019)

Subset Spaces for Conditional Norms. - Huimin Dong; R. Ramanujam 001; Yì N. Wáng (PRIMA, 2019)

Dolev-Yao Theory with Associative Blindpair Operators. - Anguraj Baskar; R. Ramanujam 001; S. P. Suresh (CIAA, 2019)

Reasoning about Social Choice and Games in Monadic Fixed-Point Logic. - Ramit Das; R. Ramanujam 001; Sunil Simon (TARK, 2019)

The Monodic Fragment of Propositional Term Modal Logic. - Anantha Padmanabha; R. Ramanujam 001 (Stud Logica, 2019)

Verifying Implicitly Quantified Modal Logic over Dynamic Networks of Processes. - Anantha Padmanabha; R. Ramanujam 001 (ICDCIT, 2020)

The complexity of disjunction in intuitionistic logic. - R. Ramanujam 001; Vaishnavi Sundararajan; S. P. Suresh (J. Log. Comput., 2020)

Definability in first-order theories of graph orderings ⋆. - R. Ramanujam 001; Ramanathan S. Thinniyam (J. Log. Comput., 2020)

Reasoning in Large Games with Unboundedly Many Players. - Ramit Das; Anantha Padmanabha; R. Ramanujam 001 (LORI, 2021)

Reasoning about Emergence of Collective Memory. - R. Ramanujam 001 (TARK, 2021)

Generalized Bundled Fragments for First-Order Modal Logic. - Mo Liu 002; Anantha Padmanabha; R. Ramanujam 001; Yanjing Wang 001 (MFCS, 2022)

Are Bundles Good Deals for FOML? - Mo Liu 002; Anantha Padmanabha; Ramaswamy Ramanujam; Yanjing Wang 001 (CoRR, 2022)

Protocol Insecurity with Assertions. - Ramaswamy Ramanujam; Vaishnavi Sundararajan; S. P. Suresh (CoRR, 2022)

Big Ideas from Logic for Mathematics and Computing Education. - R. Ramanujam 001 (ICLA, 2023)

A Logical Description of Priority Separable Games. - Ramit Das; R. Ramanujam 001; Sunil Simon (LORI, 2023)

Preface. - Sujata Ghosh; R. Ramanujam 001 (J. Log. Lang. Inf., 2023)

Are bundles good deals for first-order modal logic? - Mo Liu 002; Anantha Padmanabha; R. Ramanujam 001; Yanjing Wang 001 (Inf. Comput., 2023)

A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic. - Anantha Padmanabha; R. Ramanujam 001 (ACM Trans. Comput. Log., 2023)

Curricular Choices for Computational Thinking in Large Scale Low Resource Environments. - R. Ramanujam 001; Vipul Shah (CMSC, 2024)

Epistemic Model Checking for Privacy. - Fortunat Rajaona; Ioana Boureanu; R. Ramanujam 001; Stephan Wesemeyer (CSF, 2024)

Solving the Insecurity Problem for Assertions. - R. Ramanujam 001; Vaishnavi Sundararajan; S. P. Suresh (CSF, 2024)

Protocol insecurity with finitely many sessions and XOR. - R. Ramanujam 001; Vaishnavi Sundararajan; S. P. Suresh (CoRR, 2025)