K Narayan Kumar

Publications

• Model Checking Languages of Data Words.
  B. Bollig, A. Cyriac, P. Gastin and K. Narayan Kumar.
  Proc. FoSSaCS'12, Springer LNCS 7213 (2012), To appear.

• Model checking time-constrained scenario-based specifications.
  S Akshay, P Gastin, M Mukund and K Narayan Kumar
  Proc. FSTTCS 2010, LIPIcs Volume 8 (2010), 204-215.

• Analysing Message Sequence Graph Specifications
  Joy Chakraborty, Deepak D'Souza and K Narayan Kumar
  Proc. ISOLA 2010, Springer LNCS 6415 (2010), 549-563.

• Proceedings of the 29th International Conference on Foundations of Software Techonology and Theoretical Computer Science (FSTTCS 2009)
  Ravi Kannan and K Narayan Kumar (Eds)
  LIPIcs Volume 4, 2009.

• The Theory of MSC Languages
  K Narayan Kumar
  to Appear in Modern Applications of Automata Theory, IISc Research Monographs Series, Vol 2, World Scientific, Singapore.

• Reachability and Boundedness in Time-Constrained MSC Graphs
  P Gastin, M Mukund and K Narayan Kumar
  Perspectives in Concurrency Theory, Universities Press (2008).

• Distributed Timed Automata with Independently Evolving Clocks
  S Akshay, B Bollig, P Gastin, M Mukund and K Narayan Kumar
  Proc. CONCUR 2008, Springer LNCS 5201 (2008), 82-97.

• Checking Coverage for Infinite Collections of Timed Scenarios
  S Akshay, M Mukund and K Narayan Kumar
  Proc. CONCUR 2007, Springer LNCS 4703 (2007), 181-196.

• Local testing of message sequence charts is difficult
  P Bhateja, P Gastin, M Mukund and K Narayan Kumar
  Proc. FCT 2007, Springer LNCS 4639 (2007), 76-87.

• Anchored Concatenation of MSCs
  M Mukund, K Narayan Kumar, Y Shaofa and P S Thiagarajan
  Formal Models, Languages and Applications, Volume 66, Series in Machine Perception and Artificial Intelligence, World Scientific (2006).
• A Theory of Regular MSC Languages
  J G Henriksen, M Mukund, K Narayan Kumar, M Sohoni and P S Thiagarjan
  Information and Computation, 202(1), (2005), 1--38.

• Causal closure for MSC languages
  B Adsul, M Mukund, K Narayan Kumar and Vasumathi Narayanan
  Proc. FSTTCS 2005, Springer LNCS 3821 (2005) 335-347.

• A Unfold/Fold transformation framework for Definite Logic Programs
  Abhik Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan and I.V. Ramakrishnan
  ACM Transactions on Programming Language Systems 26(3): 464-509 (2004).
• Bounded time-stamping in message-passing systems
  M Mukund, K Narayan Kumar and M Sohoni
  Theoretical Computer Science, 290(1), (2003), 221-239.

• Local LTL with past constants is expressively complete for Mazurkiewicz traces
  P Gastin, M Mukund and K Narayan Kumar
  Proc. MFCS '03, Springer LNCS 2747 (2003) 429-438.

• Netcharts: Bridging the gap between HMSCs and executable specifications
  M Mukund, K Narayan Kumar and P S Thiagarajan
  Proc. CONCUR '03, Springer LNCS 2761 (2003) 296-310.

• Beyond Tamaki-Sato Style Unfold-Fold Systems for Normal Logic Programs
  Abhik Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan and I.V. Ramakrishnan
  International Journal of Foundations of Computer Science 13(3) (2002) 387-403.
• Resource-Constrained Model Checking of Recursive Programs
  Samik Basu, K. Narayan Kumar, L. Robert Pokorny, C. R. Ramakrishnan
  Proc. of TACAS'02, Springer LNCS 2280 (2002) 236-250.

• Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Model s
  K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smolka
  Proc. of ICLP '01, Springer LNCS 2237 (2001) 227-241.

• Verification of Parameterized Systems using Logic Program Transformations
  Abhik Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan, I.V. Ramakrishnan and Scott Smolka
  Proc. of TACAS '01 Springer LNCS 1785 (2000) 172-187.

• Regular Collections of Message Sequence Charts
  J G Henriksen, M Mukund, K Narayan Kumar and P S Thiagarajan
  Proc. MFCS '00, Springer LNCS 1893 (2000) 405-414.

• Synthesizing Distributed Finite-State Systems from MSCs
  M Mukund, K Narayan Kumar and M Sohoni
  Proc. CONCUR '00, Springer LNCS 1877 (2000) 521-535.

• On Message Sequence Graphs and Finitely Generated Regular MSC Languages
  J G Henriksen, M Mukund, K Narayan Kumar and P S Thiagarajan
  Proc. ICALP '00, Springer LNCS 1853 (2000) 675-686.

• A parameterized unfold/fold transformation framework for definite logic programs
  Abhik Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan and I.V. Ramakrishnan
  Proc. of PPDP '99 Springer LNCS 1702 (1999) 396-413.
• Beyond Tamaki-Sato style Unfold/fold Transformations for Normal Logic Programs
  Abhik Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan and I.V. Ramakrishnan Proc. ASIAN '99, Springer LNCS 1742 (1999) 227-238.
• Faster Model Checking for Open Systems
  M Mukund, K Narayan Kumar and S A Smolka
  Proc. ASIAN '99, Springer LNCS 1742, (1999) 227-238.

• Towards a characterisation of finite-state message-passing systems
  M Mukund, K Narayan Kumar, J Radhakrishnan and M Sohoni
  Proc. ASIAN '98, Springer LNCS 1538 (1998) 282-299.

• Robust Asynchronous Protocols Are Finite-State
  M Mukund, K Narayan Kumar, J Radhakrishnan and M Sohoni
  Proc. ICALP '98, Springer LNCS 1443 (1998) 188-199.

• Infinite Probabilistic and Non-Probabilistic Testing
  K. Narayan Kumar, Rance Cleaveland and Scott A. Smolka
  Proc. of FSTTCS '98 Springer LNCS 1530 (1998) 209-220.
• Logic Programming and Model Checking
  Baoqiu Cui, Yifei Dong, Xiaoqun Du, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan, Abhik Roychoudhury, Scott A. Smolka, David Scott Warren
  Proc. of the PLILP/ALP '98 Springer LNCS 1490 (1998) 1-20.
• Keeping Track of the Latest Gossip in Message-Passing Systems
  M Mukund, K Narayan Kumar and M Sohoni
  Proc. STRICT '95, Workshops in Computing, Springer-Verlag (1995) 249-263.

• On the Computational Power of ICSP with Fairness
  K Narayan Kumar and P Pandya
  Proc. of FSTTCS '94, Springer LNCS 880 (1994) 231-242.
• ICSP and its Relationship to CSP and ACSP
  K Narayan Kumar and P Pandya
  Proc. of FSTTCS '93, Springer LNCS 761 (1993) 358-372.
• Infinitary Parallelism Without Unbounded Nondeterminism in CSP
  K Narayan Kumar and P Pandya
  Acta Informatica 30(5) (1993) 467-487.