default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. Narayan Kumar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Parosh Aziz Abdulla
, Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Verification under Intel-x86 with Persistency. Proc. ACM Program. Lang. 8(PLDI): 1189-1212 (2024)- 2022
- [c44]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Bengt Jonsson, K. Narayan Kumar, Prakash Saivasan:
Consistency and Persistency in Program Verification: Challenges and Opportunities. Principles of Systems Design 2022: 494-510 - [c43]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Verifying Reachability for TSO Programs with Dynamic Thread Creation. NETYS 2022: 283-300 - 2021
- [j9]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Deciding reachability under persistent x86-TSO. Proc. ACM Program. Lang. 5(POPL): 1-32 (2021) - [c42]Snigdha Athaiya, Raghavan Komondoor, K. Narayan Kumar:
Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains. ESOP 2021: 30-58 - [i5]Snigdha Athaiya, Raghavan Komondoor, K. Narayan Kumar:
Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains. CoRR abs/2101.10233 (2021)
2010 – 2019
- 2019
- [i4]Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar, K. Narayan Kumar, Philippe Schnoebelen:
The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering. CoRR abs/1904.10703 (2019) - 2018
- [c41]Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Verifying Quantitative Temporal Properties of Procedural Programs. CONCUR 2018: 15:1-15:17 - [c40]Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan:
Regular Separability of Well-Structured Transition Systems. CONCUR 2018: 35:1-35:18 - 2017
- [c39]Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Verification of Asynchronous Programs with Nested Locks. FSTTCS 2017: 11:1-11:14 - [c38]Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Parity Games on Bounded Phase Multi-pushdown Systems. NETYS 2017: 272-287 - [e2]Deepak D'Souza, K. Narayan Kumar:
Automated Technology for Verification and Analysis - 15th International Symposium, ATVA 2017, Pune, India, October 3-6, 2017, Proceedings. Lecture Notes in Computer Science 10482, Springer 2017, ISBN 978-3-319-68166-5 [contents] - 2016
- [c37]Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche:
The complexity of regular abstractions of one-counter languages. LICS 2016: 207-216 - [c36]Mohamed Faouzi Atig, K. Narayan Kumar, Prakash Saivasan:
Acceleration in Multi-PushDown Systems. TACAS 2016: 698-714 - [i3]Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche:
Complexity of regular abstractions of one-counter languages. CoRR abs/1602.03419 (2016) - 2015
- [j8]S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Checking conformance for time-constrained scenario-based specifications. Theor. Comput. Sci. 594: 24-43 (2015) - 2014
- [j7]S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks. Fundam. Informaticae 130(4): 377-407 (2014) - [j6]Mohamed Faouzi Atig, K. Narayan Kumar, Prakash Saivasan:
Adjacent Ordered Multi-Pushdown Systems. Int. J. Found. Comput. Sci. 25(8): 1083-1096 (2014) - [c35]C. Aiswarya, Paul Gastin, K. Narayan Kumar:
Verifying Communicating Multi-pushdown Systems via Split-Width. ATVA 2014: 1-17 - [c34]C. Aiswarya, Paul Gastin, K. Narayan Kumar:
Controllers for the Verification of Communicating Multi-pushdown Systems. CONCUR 2014: 297-311 - [c33]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke:
Infinite-state energy games. CSL-LICS 2014: 7:1-7:10 - [c32]Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
On Bounded Reachability Analysis of Shared Memory Systems. FSTTCS 2014: 611-623 - [i2]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke:
Infinite-State Energy Games. CoRR abs/1405.0628 (2014) - 2013
- [c31]Mohamed Faouzi Atig, K. Narayan Kumar, Prakash Saivasan:
Adjacent Ordered Multi-Pushdown Systems. Developments in Language Theory 2013: 58-69 - 2012
- [c30]Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding. ATVA 2012: 152-166 - [c29]Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar:
MSO Decidability of Multi-Pushdown Systems via Split-Width. CONCUR 2012: 547-561 - [c28]Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar:
Model Checking Languages of Data Words. FoSSaCS 2012: 391-405 - [p1]K. Narayan Kumar:
The Theory of Message Sequence Charts. Modern Applications of Automata Theory 2012: 289-324 - [i1]Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard. CoRR abs/1205.6928 (2012) - 2010
- [c27]S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Model checking time-constrained scenario-based specifications. FSTTCS 2010: 204-215 - [c26]Joy Chakraborty, Deepak D'Souza, K. Narayan Kumar:
Analysing Message Sequence Graph Specifications. ISoLA (1) 2010: 549-563
2000 – 2009
- 2009
- [c25]Ravi Kannan, K. Narayan Kumar:
Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009). FSTTCS 2009 - [e1]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. LIPIcs 4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2009, ISBN 978-3-939897-13-2 [contents] - 2008
- [c24]S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks. CONCUR 2008: 82-97 - 2007
- [c23]Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan, Shaofa Yang:
Anchored Concatenation of MSCs. Formal Models, Languages and Applications 2007: 274-288 - [c22]S. Akshay, Madhavan Mukund, K. Narayan Kumar:
Checking Coverage for Infinite Collections of Timed Scenarios. CONCUR 2007: 181-196 - [c21]Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Local Testing of Message Sequence Charts Is Difficult. FCT 2007: 76-87 - 2005
- [j5]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) - [c20]Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, Vasumathi Narayanan:
Causal Closure for MSC Languages. FSTTCS 2005: 335-347 - 2004
- [j4]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
- [j3]Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni:
Bounded time-stamping in message-passing systems. Theor. Comput. Sci. 290(1): 221-239 (2003) - [c19]Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan:
Netcharts: Bridging the gap between HMSCs and executable specifications. CONCUR 2003: 293-307 - [c18]Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. MFCS 2003: 429-438 - 2002
- [j2]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) - [c17]Samik Basu, K. Narayan Kumar, L. Robert Pokorny, C. R. Ramakrishnan:
Resource-Constrained Model Checking of Recursive Programs. TACAS 2002: 236-250 - 2001
- [c16]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
- [c15]Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni:
Synthesizing Distributed Finite-State Systems from MSCs. CONCUR 2000: 521-535 - [c14]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 - [c13]Jesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan:
Regular Collections of Message Sequence Charts. MFCS 2000: 405-414 - [c12]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
1990 – 1999
- 1999
- [c11]Madhavan Mukund, K. Narayan Kumar, Scott A. Smolka:
Faster Model Checking for Open Systems. ASIAN 1999: 227-238 - [c10]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 - [c9]Abhik Roychoudhury, K. Narayan Kumar, I. V. Ramakrishnan:
Generalized Unfold/fold Transformation Systems for Normal Logic Programs. ICLP 1999: 616 - [c8]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
- [c7]Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni:
Towards a Characterisation of Finite-State Message-Passing Systems. ASIAN 1998: 282-299 - [c6]K. Narayan Kumar, Rance Cleaveland, Scott A. Smolka:
Infinite Probabilistic and Nonprobabilistic Testing. FSTTCS 1998: 209-220 - [c5]Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni:
Robust Asynchronous Protocols Are Finite-State. ICALP 1998: 188-199 - [c4]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 - 1995
- [c3]Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni:
Keeping Track of the Latest Gossip in Message-Passing Systems. STRICT 1995: 249-263 - 1994
- [c2]K. Narayan Kumar, Paritosh K. Pandya:
On the Computational Power of Operators in ICSP with Fairness. FSTTCS 1994: 231-242 - 1993
- [j1]K. Narayan Kumar, Paritosh K. Pandya:
Infinitary Parallelism without Unbounded Nondeterminism in CSP. Acta Informatica 30(5): 467-487 (1993) - [c1]K. Narayan Kumar, Paritosh K. Pandya:
ICSP and Its Relationship with ACSP and CSP. FSTTCS 1993: 358-372
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
