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