K. Narayan Kumar

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Verifying Communicating Multi-pushdown Systems via Split-Width.

[BibT_eX]

[DOI]

C. Aiswarya

Proceedings of the Automated Technology for Verification and Analysis, 2014

2012

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

[BibT_eX]

[DOI]

CoRR, 2012

Model Checking Languages of Data Words.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

MSO Decidability of Multi-Pushdown Systems via Split-Width.

[BibT_eX]

[DOI]

Aiswarya Cyriac

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2012

The Theory of Message Sequence Charts.

[BibT_eX]

[DOI]

Proceedings of the Modern Applications of Automata Theory., 2012

2010

Analysing Message Sequence Graph Specifications.

[BibT_eX]

[DOI]

Joy Chakraborty

Deepak D'Souza

Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

Model checking time-constrained scenario-based specifications.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Ravi Kannan

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2007

Local Testing of Message Sequence Charts Is Difficult.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Checking Coverage for Infinite Collections of Timed Scenarios.

[BibT_eX]

[DOI]

S. Akshay

Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

Anchored Concatenation of MSCs.

[BibT_eX]

[DOI]

Proceedings of the Formal Models, 2007

2005

A theory of regular MSC languages.

[BibT_eX]

[DOI]

Inf. Comput., 2005

Causal Closure for MSC Languages.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004

An unfold/fold transformation framework for definite logic programs.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2004

2003

Bounded time-stamping in message-passing systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Netcharts: Bridging the gap between HMSCs and executable specifications.

[BibT_eX]

[DOI]

P. S. Thiagarajan

Proceedings of the CONCUR 2003, 2003

2002

Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2002

Resource-Constrained Model Checking of Recursive Programs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

C. R. Ramakrishnan

Scott A. Smolka

Proceedings of the Logic Programming, 17th International Conference, 2001

2000

Verification of Parameterized Systems Using Logic Program Transformations.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000

Regular Collections of Message Sequence Charts.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

On Message Sequence Graphs and Finitely Generated Regular MSC Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Synthesizing Distributed Finite-State Systems from MSCs.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2000, 2000

1999

A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

Abhik Roychoudhury

I. V. Ramakrishnan

Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

Faster Model Checking for Open Systems.

[BibT_eX]

[DOI]

Scott A. Smolka

Proceedings of the Advances in Computing Science, 1999

1998

Logic Programming and Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998

Robust Asynchronous Protocols Are Finite-State.

[BibT_eX]

[DOI]

Jaikumar Radhakrishnan

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Infinite Probabilistic and Nonprobabilistic Testing.

[BibT_eX]

[DOI]

Rance Cleaveland

Scott A. Smolka

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

Towards a Characterisation of Finite-State Message-Passing Systems.

[BibT_eX]

[DOI]

Jaikumar Radhakrishnan

Proceedings of the Advances in Computing Science, 1998

1995

Keeping Track of the Latest Gossip in Message-Passing Systems.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Structures in Concurrency Theory, 1995

1994

On the Computational Power of Operators in ICSP with Fairness.

[BibT_eX]

[DOI]

Paritosh K. Pandya

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993

Infinitary Parallelism without Unbounded Nondeterminism in CSP.

[BibT_eX]

[DOI]

Paritosh K. Pandya

Acta Informatica, 1993

ICSP and Its Relationship with ACSP and CSP.

[BibT_eX]

[DOI]