The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

K. Narayan Kumar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan
    Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1999, pp:322-333 [Conf]
  2. Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni
    Towards a Characterisation of Finite-State Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1998, pp:282-299 [Conf]
  3. Madhavan Mukund, K. Narayan Kumar, Scott A. Smolka
    Faster Model Checking for Open Systems. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1999, pp:227-238 [Conf]
  4. Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni
    Synthesizing Distributed Finite-State Systems from MSCs. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2000, pp:521-535 [Conf]
  5. Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan
    Netcharts: Bridging the gap between HMSCs and executable specifications. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:293-307 [Conf]
  6. Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, Vasumathi Narayanan
    Causal Closure for MSC Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:335-347 [Conf]
  7. K. Narayan Kumar, Rance Cleaveland, Scott A. Smolka
    Infinite Probabilistic and Nonprobabilistic Testing. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:209-220 [Conf]
  8. K. Narayan Kumar, Paritosh K. Pandya
    ICSP and Its Relationship with ACSP and CSP. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:358-372 [Conf]
  9. K. Narayan Kumar, Paritosh K. Pandya
    On the Computational Power of Operators in ICSP with Fairness. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:231-242 [Conf]
  10. Jesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan
    On Message Sequence Graphs and Finitely Generated Regular MSC Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:675-686 [Conf]
  11. Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni
    Robust Asynchronous Protocols Are Finite-State. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:188-199 [Conf]
  12. K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smolka
    Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models. [Citation Graph (0, 0)][DBLP]
    ICLP, 2001, pp:227-241 [Conf]
  13. Abhik Roychoudhury, K. Narayan Kumar, I. V. Ramakrishnan
    Generalized Unfold/fold Transformation Systems for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1999, pp:616- [Conf]
  14. Paul Gastin, Madhavan Mukund, K. Narayan Kumar
    Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:429-438 [Conf]
  15. Jesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan
    Regular Collections of Message Sequence Charts. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:405-414 [Conf]
  16. Baoqiu Cui, Yifei Dong, Xiaoqun Du, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan, Abhik Roychoudhury, Scott A. Smolka, David Scott Warren
    Logic Programming and Model Checking. [Citation Graph (0, 0)][DBLP]
    PLILP/ALP, 1998, pp:1-20 [Conf]
  17. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan
    A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs. [Citation Graph (0, 0)][DBLP]
    PPDP, 1999, pp:396-413 [Conf]
  18. Samik Basu, K. Narayan Kumar, L. Robert Pokorny, C. R. Ramakrishnan
    Resource-Constrained Model Checking of Recursive Programs. [Citation Graph (0, 0)][DBLP]
    TACAS, 2002, pp:236-250 [Conf]
  19. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka
    Verification of Parameterized Systems Using Logic Program Transformations. [Citation Graph (0, 0)][DBLP]
    TACAS, 2000, pp:172-187 [Conf]
  20. K. Narayan Kumar, Paritosh K. Pandya
    Infinitary Parallelism without Unbounded Nondeterminism in CSP. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1993, v:30, n:5, pp:467-487 [Journal]
  21. Jesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni, P. S. Thiagarajan
    A theory of regular MSC languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:202, n:1, pp:1-38 [Journal]
  22. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan
    Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:3, pp:387-403 [Journal]
  23. Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni
    Bounded time-stamping in message-passing systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:221-239 [Journal]
  24. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan
    An unfold/fold transformation framework for definite logic programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2004, v:26, n:3, pp:464-509 [Journal]
  25. S. Akshay, Madhavan Mukund, K. Narayan Kumar
    Checking Coverage for Infinite Collections of Timed Scenarios. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2007, pp:181-196 [Conf]
  26. Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
    Local Testing of Message Sequence Charts Is Difficult. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:76-87 [Conf]

  27. Distributed Timed Automata with Independently Evolving Clocks. [Citation Graph (, )][DBLP]


  28. Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009). [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002