A theory of regular MSC languages JG Henriksen, M Mukund, KN Kumar, M Sohoni, PS Thiagarajan Information and computation 202 (1), 1-38, 2005 | 124 | 2005 |

On message sequence graphs and finitely generated regular MSC languages JG Henriksen, M Mukund, KN Kumar, PS Thiagarajan International Colloquium on Automata, Languages, and Programming, 675-686, 2000 | 96 | 2000 |

Synthesizing distributed finite-state systems from MSCs M Mukund, KN Kumar, M Sohoni International Conference on Concurrency Theory, 521-535, 2000 | 74 | 2000 |

Regular collections of message sequence charts JG Henriksen, M Mukund, KN Kumar, PS Thiagarajan International Symposium on Mathematical Foundations of Computer Science, 405-414, 2000 | 70 | 2000 |

Verification of parameterized systems using logic program transformations A Roychoudhury, KN Kumar, CR Ramakrishnan, IV Ramakrishnan, ... International Conference on Tools and Algorithms for the Construction and …, 2000 | 64 | 2000 |

Logic programming and model checking B Cui, Y Dong, X Du, KN Kumar, CR Ramakrishnan, IV Ramakrishnan, ... Principles of Declarative Programming, 1-20, 1998 | 60 | 1998 |

MSO decidability of multi-pushdown systems via split-width A Cyriac, P Gastin, KN Kumar International Conference on Concurrency Theory, 547-561, 2012 | 53 | 2012 |

Distributed timed automata with independently evolving clocks S Akshay, B Bollig, P Gastin, M Mukund, K Narayan Kumar International Conference on Concurrency Theory, 82-97, 2008 | 42 | 2008 |

Model checking languages of data words B Bollig, A Cyriac, P Gastin, K Narayan Kumar International Conference on Foundations of Software Science and …, 2012 | 32 | 2012 |

Causal closure for MSC languages B Adsul, M Mukund, KN Kumar, V Narayanan International Conference on Foundations of Software Technology and …, 2005 | 30 | 2005 |

Beyond Tamaki-Sato style unfold/fold transformations for normal logic programs A Roychoudhury, K Narayan Kumar, CR Ramakrishnan, ... International Journal of Foundations of Computer Science 13 (03), 387-403, 2002 | 29 | 2002 |

An unfold/fold transformation framework for definite logic programs A Roychoudhury, KN Kumar, CR Ramakrishnan, IV Ramakrishnan ACM Transactions on Programming Languages and Systems (TOPLAS) 26 (3), 464-509, 2004 | 28 | 2004 |

Netcharts: Bridging the gap between HMSCs and executable specifications M Mukund, KN Kumar, PS Thiagarajan International Conference on Concurrency Theory, 296-310, 2003 | 27 | 2003 |

Linear-time model-checking for multithreaded programs under scope-bounding MF Atig, A Bouajjani, K Narayan Kumar, P Saivasan International Symposium on Automated Technology for Verification and …, 2012 | 25 | 2012 |

Verifying communicating multi-pushdown systems via split-width C Aiswarya, P Gastin, K Narayan Kumar International Symposium on Automated Technology for Verification and …, 2014 | 23 | 2014 |

A parameterized unfold/fold transformation framework for definite logic programs A Roychoudhury, KN Kumar, CR Ramakrishnan, IV Ramakrishnan International Conference on Principles and Practice of Declarative …, 1999 | 21 | 1999 |

The ideal approach to computing closed subsets in well-quasi-orderings J Goubault-Larrecq, S Halfon, P Karandikar, K Narayan Kumar, ... Well-Quasi Orders in Computation, Logic, Language and Reasoning, 55-105, 2020 | 20 | 2020 |

Infinite-state energy games PA Abdulla, MF Atig, P Hofman, R Mayr, KN Kumar, P Totzke Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 20 | 2014 |

Infinite probabilistic and nonprobabilistic testing KN Kumar, R Cleaveland, SA Smolka International Conference on Foundations of Software Technology and …, 1998 | 20 | 1998 |

Analysing message sequence graph specifications J Chakraborty, D D’Souza, K Narayan Kumar International Symposium On Leveraging Applications of Formal Methods …, 2010 | 19 | 2010 |