| A theory of regular MSC languages JG Henriksen, M Mukund, KN Kumar, M Sohoni, PS Thiagarajan Information and computation 202 (1), 1-38, 2005 | 126 | 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 International Conference on Concurrency Theory, 521-535, 2000 | 77 | 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 | 68 | 2000 |
| 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 | 63 | 1998 |
| MSO decidability of multi-pushdown systems via split-width A Cyriac, P Gastin, KN Kumar International Conference on Concurrency Theory, 547-561, 2012 | 56 | 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 | 46 | 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 | 33 | 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 |
| Verifying communicating multi-pushdown systems via split-width C Aiswarya, P Gastin, K Narayan Kumar Automated Technology for Verification and Analysis: 12th International …, 2014 | 29 | 2014 |
| 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 | 29 | 2004 |
| 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 |
| 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 | 28 | 2020 |
| 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 | 27 | 2012 |
| Regular separability of well structured transition systems W Czerwiñski, S Lasota, R Meyer, S Muskalla, KN Kumar, P Saivasan arXiv preprint arXiv:1702.05334, 2017 | 24 | 2017 |
| 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 | 24 | 1999 |
| 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 | 23 | 2014 |
| Deciding reachability under persistent x86-TSO PA Abdulla, MF Atig, A Bouajjani, KN Kumar, P Saivasan Proceedings of the ACM on Programming Languages 5 (POPL), 1-32, 2021 | 22 | 2021 |
