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 Automata, Languages and Programming: 27th International Colloquium, ICALP …, 2000 | 98 | 2000 |

Synthesizing distributed finite-state systems from MSCs M Mukund, KN Kumar, M Sohoni CONCUR 2000—Concurrency Theory: 11th International Conference University …, 2000 | 75 | 2000 |

Regular collections of message sequence charts JG Henriksen, M Mukund, KN Kumar, PS Thiagarajan MFCS 1893, 405-414, 2000 | 70 | 2000 |

Verification of parameterized systems using logic program transformations A Roychoudhury, KN Kumar, CR Ramakrishnan, IV Ramakrishnan, ... Tools and Algorithms for the Construction and Analysis of Systems: 6th …, 2001 | 67 | 2001 |

Logic programming and model checking B Cui, Y Dong, X Du, KN Kumar, CR Ramakrishnan, IV Ramakrishnan, ... Principles of Declarative Programming: 10th International Symposium, PLILP …, 1998 | 62 | 1998 |

MSO decidability of multi-pushdown systems via split-width A Cyriac, P Gastin, KN Kumar CONCUR 2012–Concurrency Theory: 23rd International Conference, CONCUR 2012 …, 2012 | 54 | 2012 |

Distributed timed automata with independently evolving clocks S Akshay, B Bollig, P Gastin, M Mukund, K Narayan Kumar CONCUR 2008-Concurrency Theory: 19th International Conference, CONCUR 2008 …, 2008 | 42 | 2008 |

Model Checking Languages of Data Words. B Bollig, A Cyriac, P Gastin, KN Kumar FoSSaCS 12, 391-405, 2012 | 32 | 2012 |

Causal closure for MSC languages B Adsul, M Mukund, KN Kumar, V Narayanan FSTTCS 2005: Foundations of Software Technology and Theoretical Computer …, 2005 | 31 | 2005 |

Netcharts: Bridging the gap between HMSCs and executable specifications M Mukund, KN Kumar, PS Thiagarajan CONCUR 2003-Concurrency Theory: 14th International Conference, Marseille …, 2003 | 29 | 2003 |

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 |

Linear-time model-checking for multithreaded programs under scope-bounding MF Atig, A Bouajjani, K Narayan Kumar, P Saivasan Automated Technology for Verification and Analysis: 10th International …, 2012 | 26 | 2012 |

Verifying communicating multi-pushdown systems via split-width C Aiswarya, P Gastin, K Narayan Kumar Automated Technology for Verification and Analysis: 12th International …, 2014 | 25 | 2014 |

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 | 22 | 2014 |

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: A Unifying …, 2020 | 21 | 2020 |

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

Infinite Probabilistic and Nonprobabilistic Testing. KN Kumar, R Cleaveland, SA Smolka FSTTCS 98, 209-220, 1998 | 20 | 1998 |

Bounded time-stamping in message-passing systems M Mukund, KN Kumar, M Sohoni Theoretical Computer Science 290 (1), 221-239, 2003 | 19 | 2003 |