K. Narayan Kumar

2008
27	EE	S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar: Distributed Timed Automata with Independently Evolving Clocks. CONCUR 2008: 82-97
2007
26	EE	S. Akshay, Madhavan Mukund, K. Narayan Kumar: Checking Coverage for Infinite Collections of Timed Scenarios. CONCUR 2007: 181-196
25	EE	Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar: Local Testing of Message Sequence Charts Is Difficult. FCT 2007: 76-87
2005
24	EE	Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, Vasumathi Narayanan: Causal Closure for MSC Languages. FSTTCS 2005: 335-347
23	EE	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	EE	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	EE	Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan: Netcharts: Bridging the gap between HMSCs and executable specifications. CONCUR 2003: 293-307
20	EE	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	EE	Samik Basu, K. Narayan Kumar, L. Robert Pokorny, C. R. Ramakrishnan: Resource-Constrained Model Checking of Recursive Programs. TACAS 2002: 236-250
17	EE	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	EE	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	EE	Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni: Synthesizing Distributed Finite-State Systems from MSCs. CONCUR 2000: 521-535
14	EE	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	EE	Jesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan: Regular Collections of Message Sequence Charts. MFCS 2000: 405-414
12	EE	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	EE	Madhavan Mukund, K. Narayan Kumar, Scott A. Smolka: Faster Model Checking for Open Systems. ASIAN 1999: 227-238
10	EE	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	EE	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	EE	Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni: Robust Asynchronous Protocols Are Finite-State. ICALP 1998: 188-199
4	EE	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)

Coauthor Index

1	Bharat Adsul	[24]
2	S. Akshay	[26] [27]
3	Samik Basu	[18]
4	Puneet Bhateja	[25]
5	Benedikt Bollig	[27]
6	Rance Cleaveland	[6]
7	Baoqiu Cui	[4]
8	Yifei Dong	[4]
9	Xiaoqun Du	[4]
10	Paul Gastin	[20] [25] [27]
11	Jesper G. Henriksen	[13] [14] [23]
12	Madhavan Mukund	[5] [7] [11] [13] [14] [15] [19] [20] [21] [23] [24] [25] [26] [27]
13	Vasumathi Narayanan	[24]
14	Paritosh K. Pandya	[1] [2] [3]
15	L. Robert Pokorny	[18]
16	Jaikumar Radhakrishnan	[5] [7]
17	C. R. Ramakrishnan	[4] [8] [10] [12] [16] [17] [18] [22]
18	I. V. Ramakrishnan	[4] [8] [9] [10] [12] [17] [22]
19	Abhik Roychoudhury	[4] [8] [9] [10] [12] [17] [22]
20	Scott A. Smolka	[4] [6] [11] [12] [16]
21	Milind A. Sohoni	[5] [7] [15] [19] [23]
22	P. S. Thiagarajan	[13] [14] [21] [23]
23	David Scott Warren	[4]