K. Narayan Kumar

According to our database1, K. Narayan Kumar
  • authored at least 49 papers between 1993 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Parity Games on Bounded Phase Multi-pushdown Systems.
Proceedings of the Networked Systems - 5th International Conference, 2017

2016
Complexity of regular abstractions of one-counter languages.
CoRR, 2016

Acceleration in Multi-PushDown Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

The complexity of regular abstractions of one-counter languages.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015
Checking conformance for time-constrained scenario-based specifications.
Theor. Comput. Sci., 2015

2014
Adjacent Ordered Multi-Pushdown Systems.
Int. J. Found. Comput. Sci., 2014

Distributed Timed Automata with Independently Evolving Clocks.
Fundam. Inform., 2014

Infinite-State Energy Games.
CoRR, 2014

On Bounded Reachability Analysis of Shared Memory Systems.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Infinite-state energy games.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Controllers for the Verification of Communicating Multi-pushdown Systems.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Verifying Communicating Multi-pushdown Systems via Split-Width.
Proceedings of the Automated Technology for Verification and Analysis, 2014

2013
Adjacent Ordered Multi-Pushdown Systems.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard
CoRR, 2012

Model Checking Languages of Data Words.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

MSO Decidability of Multi-Pushdown Systems via Split-Width.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding.
Proceedings of the Automated Technology for Verification and Analysis, 2012

The Theory of Message Sequence Charts.
Modern Applications of Automata Theory, 2012

2010
Analysing Message Sequence Graph Specifications.
Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

Model checking time-constrained scenario-based specifications.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009).
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008
Distributed Timed Automata with Independently Evolving Clocks.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007
Local Testing of Message Sequence Charts Is Difficult.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Checking Coverage for Infinite Collections of Timed Scenarios.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

Anchored Concatenation of MSCs.
Proceedings of the Formal Models, 2007

2005
A theory of regular MSC languages.
Inf. Comput., 2005

Causal Closure for MSC Languages.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004
An unfold/fold transformation framework for definite logic programs.
ACM Trans. Program. Lang. Syst., 2004

2003
Bounded time-stamping in message-passing systems.
Theor. Comput. Sci., 2003

Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Netcharts: Bridging the gap between HMSCs and executable specifications.
Proceedings of the CONCUR 2003, 2003

2002
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs.
Int. J. Found. Comput. Sci., 2002

Resource-Constrained Model Checking of Recursive Programs.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002

2001
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models.
Proceedings of the Logic Programming, 17th International Conference, 2001

2000
Verification of Parameterized Systems Using Logic Program Transformations.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000

Regular Collections of Message Sequence Charts.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

On Message Sequence Graphs and Finitely Generated Regular MSC Languages.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Synthesizing Distributed Finite-State Systems from MSCs.
Proceedings of the CONCUR 2000, 2000

1999
A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs.
Proceedings of the Principles and Practice of Declarative Programming, International Conference PPDP'99, Paris, France, September 29, 1999

Generalized Unfold/fold Transformation Systems for Normal Logic Programs.
Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs.
Proceedings of the Advances in Computing Science, 1999

Faster Model Checking for Open Systems.
Proceedings of the Advances in Computing Science, 1999

1998
Logic Programming and Model Checking.
Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998

Robust Asynchronous Protocols Are Finite-State.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Infinite Probabilistic and Nonprobabilistic Testing.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

Towards a Characterisation of Finite-State Message-Passing Systems.
Proceedings of the Advances in Computing Science, 1998

1994
On the Computational Power of Operators in ICSP with Fairness.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993
Infinitary Parallelism without Unbounded Nondeterminism in CSP.
Acta Inf., 1993

ICSP and Its Relationship with ACSP and CSP.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993


  Loading...