ICSP and Its Relationship with ACSP and CSP. - K. Narayan Kumar; Paritosh K. Pandya (FSTTCS, 1993)

Infinitary Parallelism without Unbounded Nondeterminism in CSP. - K. Narayan Kumar; Paritosh K. Pandya (Acta Informatica, 1993)

On the Computational Power of Operators in ICSP with Fairness. - K. Narayan Kumar; Paritosh K. Pandya (FSTTCS, 1994)

Keeping Track of the Latest Gossip in Message-Passing Systems. - Madhavan Mukund; K. Narayan Kumar; Milind A. Sohoni (STRICT, 1995)

Towards a Characterisation of Finite-State Message-Passing Systems. - Madhavan Mukund; K. Narayan Kumar; Jaikumar Radhakrishnan; Milind A. Sohoni (ASIAN, 1998)

Infinite Probabilistic and Nonprobabilistic Testing. - K. Narayan Kumar; Rance Cleaveland; Scott A. Smolka (FSTTCS, 1998)

Robust Asynchronous Protocols Are Finite-State. - Madhavan Mukund; K. Narayan Kumar; Jaikumar Radhakrishnan; Milind A. Sohoni (ICALP, 1998)

Logic Programming and Model Checking. - Baoqiu Cui; Yifei Dong; Xiaoqun Du; K. Narayan Kumar; C. R. Ramakrishnan 001; I. V. Ramakrishnan; Abhik Roychoudhury; Scott A. Smolka; David Scott Warren (PLILP/ALP, 1998)

Faster Model Checking for Open Systems. - Madhavan Mukund; K. Narayan Kumar; Scott A. Smolka (ASIAN, 1999)

Generalized Unfold/fold Transformation Systems for Normal Logic Programs. - Abhik Roychoudhury; K. Narayan Kumar; I. V. Ramakrishnan (ICLP, 1999)

A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs. - Abhik Roychoudhury; K. Narayan Kumar; C. R. Ramakrishnan 001; I. V. Ramakrishnan (PPDP, 1999)

Synthesizing Distributed Finite-State Systems from MSCs. - Madhavan Mukund; K. Narayan Kumar; Milind A. Sohoni (CONCUR, 2000)

On Message Sequence Graphs and Finitely Generated Regular MSC Languages. - Jesper G. Henriksen; Madhavan Mukund; K. Narayan Kumar; P. S. Thiagarajan (ICALP, 2000)

Regular Collections of Message Sequence Charts. - Jesper G. Henriksen; Madhavan Mukund; K. Narayan Kumar; P. S. Thiagarajan (MFCS, 2000)

Verification of Parameterized Systems Using Logic Program Transformations. - Abhik Roychoudhury; K. Narayan Kumar; C. R. Ramakrishnan 001; I. V. Ramakrishnan; Scott A. Smolka (TACAS, 2000)

Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models. - K. Narayan Kumar; C. R. Ramakrishnan 001; Scott A. Smolka (ICLP, 2001)

Resource-Constrained Model Checking of Recursive Programs. - Samik Basu 001; K. Narayan Kumar; L. Robert Pokorny; C. R. Ramakrishnan 001 (TACAS, 2002)

Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. - Abhik Roychoudhury; K. Narayan Kumar; C. R. Ramakrishnan 001; I. V. Ramakrishnan (Int. J. Found. Comput. Sci., 2002)

Netcharts: Bridging the gap between HMSCs and executable specifications. - Madhavan Mukund; K. Narayan Kumar; P. S. Thiagarajan (CONCUR, 2003)

Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. - Paul Gastin; Madhavan Mukund; K. Narayan Kumar (MFCS, 2003)

Bounded time-stamping in message-passing systems. - Madhavan Mukund; K. Narayan Kumar; Milind A. Sohoni (Theor. Comput. Sci., 2003)

An unfold/fold transformation framework for definite logic programs. - Abhik Roychoudhury; K. Narayan Kumar; C. R. Ramakrishnan 001; I. V. Ramakrishnan (ACM Trans. Program. Lang. Syst., 2004)

Causal Closure for MSC Languages. - Bharat Adsul; Madhavan Mukund; K. Narayan Kumar; Vasumathi Narayanan (FSTTCS, 2005)

A theory of regular MSC languages. - Jesper G. Henriksen; Madhavan Mukund; K. Narayan Kumar; Milind A. Sohoni; P. S. Thiagarajan (Inf. Comput., 2005)

Anchored Concatenation of MSCs. - Madhavan Mukund; K. Narayan Kumar; P. S. Thiagarajan; Shaofa Yang (Formal Models, Languages and Applications, 2007)

Checking Coverage for Infinite Collections of Timed Scenarios. - S. Akshay 001; Madhavan Mukund; K. Narayan Kumar (CONCUR, 2007)

Local Testing of Message Sequence Charts Is Difficult. - Puneet Bhateja; Paul Gastin; Madhavan Mukund; K. Narayan Kumar (FCT, 2007)

Preface – IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009). - Ravi Kannan; K. Narayan Kumar (FSTTCS, 2009)

Model checking time-constrained scenario-based specifications. - S. Akshay 001; Paul Gastin; Madhavan Mukund; K. Narayan Kumar (FSTTCS, 2010)

Analysing Message Sequence Graph Specifications. - Joy Chakraborty; Deepak D'Souza; K. Narayan Kumar (ISoLA (1), 2010)

The Theory of Message Sequence Charts. - K. Narayan Kumar (Modern Applications of Automata Theory, 2012)

Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding. - Mohamed Faouzi Atig; Ahmed Bouajjani; K. Narayan Kumar; Prakash Saivasan (ATVA, 2012)

MSO Decidability of Multi-Pushdown Systems via Split-Width. - Aiswarya Cyriac; Paul Gastin; K. Narayan Kumar (CONCUR, 2012)

Model Checking Languages of Data Words. - Benedikt Bollig; Aiswarya Cyriac; Paul Gastin; K. Narayan Kumar (FoSSaCS, 2012)

Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard - Mohamed Faouzi Atig; Ahmed Bouajjani; K. Narayan Kumar; Prakash Saivasan (CoRR, 2012)

Verifying Communicating Multi-pushdown Systems via Split-Width. - C. Aiswarya; Paul Gastin; K. Narayan Kumar (ATVA, 2014)

Controllers for the Verification of Communicating Multi-pushdown Systems. - C. Aiswarya; Paul Gastin; K. Narayan Kumar (CONCUR, 2014)

Infinite-state energy games. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Piotr Hofman; Richard Mayr; K. Narayan Kumar; Patrick Totzke (CSL-LICS, 2014)

On Bounded Reachability Analysis of Shared Memory Systems. - Mohamed Faouzi Atig; Ahmed Bouajjani; K. Narayan Kumar; Prakash Saivasan (FSTTCS, 2014)

Distributed Timed Automata with Independently Evolving Clocks. - S. Akshay 001; Benedikt Bollig; Paul Gastin; Madhavan Mukund; K. Narayan Kumar (Fundam. Informaticae, 2014)

Adjacent Ordered Multi-Pushdown Systems. - Mohamed Faouzi Atig; K. Narayan Kumar; Prakash Saivasan (Int. J. Found. Comput. Sci., 2014)

Checking conformance for time-constrained scenario-based specifications. - S. Akshay 001; Paul Gastin; Madhavan Mukund; K. Narayan Kumar (Theor. Comput. Sci., 2015)

The complexity of regular abstractions of one-counter languages. - Mohamed Faouzi Atig; Dmitry Chistikov 001; Piotr Hofman; K. Narayan Kumar; Prakash Saivasan; Georg Zetzsche (LICS, 2016)

Acceleration in Multi-PushDown Systems. - Mohamed Faouzi Atig; K. Narayan Kumar; Prakash Saivasan (TACAS, 2016)

Verification of Asynchronous Programs with Nested Locks. - Mohamed Faouzi Atig; Ahmed Bouajjani; K. Narayan Kumar; Prakash Saivasan (FSTTCS, 2017)

Parity Games on Bounded Phase Multi-pushdown Systems. - Mohamed Faouzi Atig; Ahmed Bouajjani; K. Narayan Kumar; Prakash Saivasan (NETYS, 2017)

Verifying Quantitative Temporal Properties of Procedural Programs. - Mohamed Faouzi Atig; Ahmed Bouajjani; K. Narayan Kumar; Prakash Saivasan (CONCUR, 2018)

Regular Separability of Well-Structured Transition Systems. - Wojciech Czerwinski; Slawomir Lasota 001; Roland Meyer 001; Sebastian Muskalla; K. Narayan Kumar; Prakash Saivasan (CONCUR, 2018)

The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering. - Jean Goubault-Larrecq; Simon Halfon; Prateek Karandikar; K. Narayan Kumar; Philippe Schnoebelen (CoRR, 2019)

Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains. - Snigdha Athaiya; Raghavan Komondoor; K. Narayan Kumar (ESOP, 2021)

Deciding reachability under persistent x86-TSO. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Ahmed Bouajjani; K. Narayan Kumar; Prakash Saivasan (Proc. ACM Program. Lang., 2021)

Consistency and Persistency in Program Verification: Challenges and Opportunities. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Ahmed Bouajjani; Bengt Jonsson 001; K. Narayan Kumar; Prakash Saivasan (Principles of Systems Design, 2022)

Verifying Reachability for TSO Programs with Dynamic Thread Creation. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Ahmed Bouajjani; K. Narayan Kumar; Prakash Saivasan (NETYS, 2022)

Verification under Intel-x86 with Persistency. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Ahmed Bouajjani; K. Narayan Kumar; Prakash Saivasan (Proc. ACM Program. Lang., 2024)