Proceedings of the Formal Techniques for Networked and Distributed Systems - FORTE 2003, 23rd IFIP WG 6.1 International Conference, Berlin, Germany, September 29, 2003

Bisimulation and Language Equivalence.

[BibT_eX]

[DOI]

Colin Stirling

Proceedings of the Logic for Concurrency and Synchronisation, 2003

2002

Model Checking Games for Branching Time Logics.

[BibT_eX]

[DOI]

Martin Lange

Colin Stirling

J. Log. Comput., 2002

Deciding DPDA Equivalence Is Primitive Recursive.

[BibT_eX]

[DOI]

Colin Stirling

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Model Checking Fixed Point Logic with Chop.

[BibT_eX]

[DOI]

Martin Lange

Colin Stirling

Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001

Modal and Temporal Properties of Processes.

[BibT_eX]

[DOI]

Colin Stirling

Texts in Computer Science, Springer, ISBN: 978-1-4757-3550-5, 2001

Decidability of DPDA equivalence.

[BibT_eX]

[DOI]

Colin Stirling

Theor. Comput. Sci., 2001

Rational Graphs Trace Context-Sensitive Languages.

[BibT_eX]

[DOI]

Christophe Morvan

Colin Stirling

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Focus Games for Satisfiability and Completeness of Temporal Logic.

[BibT_eX]

[DOI]

Martin Lange

Colin Stirling

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

An Introduction to Decidability of DPDA Equivalence.

[BibT_eX]

[DOI]

Colin Stirling

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes.

[BibT_eX]

[DOI]

Colin Stirling

Proceedings of the Foundations of Software Science and Computation Structures, 2001

Modal Logics and mu-Calculi: An Introduction.

[BibT_eX]

[DOI]

Julian C. Bradfield

Colin Stirling

Proceedings of the Handbook of Process Algebra, 2001

2000

Games-Based Model Checking of Protocols: counting doesn't count.

[BibT_eX]

Tim Kempster

Colin Stirling

Peter Thanisch

Proceedings of the 2000 ICDCS Workshops, April 10, 2000, Taipei, Taiwan, ROC, 2000

Schema Revisited.

[BibT_eX]

[DOI]

Colin Stirling

Proceedings of the Computer Science Logic, 2000

A brief scientific biography of Robin Milner.

[BibT_eX]

Gordon D. Plotkin

Colin Stirling

Mads Tofte

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999

Diluting ACID.

[BibT_eX]

[DOI]

Tim Kempster

Colin Stirling

Peter Thanisch

SIGMOD Rec., 1999

Decidability of bisimulation equivalence for normed pushdown processes.

[BibT_eX]

[DOI]

Colin Stirling

SIGACT News, 1999

Bisimulation, Modal Logic and Model Checking Games.

[BibT_eX]

[DOI]

Colin Stirling

Log. J. IGPL, 1999

1998

Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes.

[BibT_eX]

[DOI]

Hans Hüttel

Colin Stirling

J. Log. Comput., 1998

Playing games and proving properties of concurrent systems.

[BibT_eX]

[DOI]

Colin Stirling

J. Comput. Sci. Technol., 1998

A More Committed Quorum-Based Three Phase Commit Protocol.

[BibT_eX]

[DOI]

Tim Kempster

Colin Stirling

Peter Thanisch

Proceedings of the Distributed Computing, 12th International Symposium, 1998

Practical Model-Checking Using Games.

[BibT_eX]

[DOI]

Perdita Stevens

Colin Stirling

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

The Joys of Bisimulation.

[BibT_eX]

[DOI]

Colin Stirling

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1996

Games and Modal Mu-Calculus.

[BibT_eX]

[DOI]

Colin Stirling

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

1995

Bisimulation Equivalence is Decidable for All Context-Free Processes

[BibT_eX]

[DOI]

Søren Christensen

Hans Hüttel

Colin Stirling

Inf. Comput., September, 1995

Lokal Model Checking Games.

[BibT_eX]

[DOI]

Colin Stirling

Proceedings of the CONCUR '95: Concurrency Theory, 1995

Modal and Temporal Logics for Processes.

[BibT_eX]

[DOI]

Colin Stirling

Proceedings of the Logics for Concurrency, 1995

1994

A Compositional Proof System for the Modal mu-Calculus

[BibT_eX]

[DOI]

Henrik Reif Andersen

Colin Stirling

Glynn Winskel

Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1992

Local Model Checking for Infinite State Spaces.

[BibT_eX]

[DOI]

Julian C. Bradfield

Colin Stirling

Theor. Comput. Sci., 1992

1991

Local Model Checking in the Modal mu-Calculus.

[BibT_eX]

[DOI]

Colin Stirling

David Walker

Theor. Comput. Sci., 1991

1990

Verifying Temporal Properties of Processes.

[BibT_eX]

[DOI]

Julian C. Bradfield

Colin Stirling

Proceedings of the CONCUR '90, 1990

1989

An Introduction to Modal and Temporal Logics for CCS.

[BibT_eX]

[DOI]

Colin Stirling

Proceedings of the Concurrency: Theory, 1989

CCS, Liveness, and Local Model Checking in the Linear Time Mu-Calculus.

[BibT_eX]

[DOI]

Colin Stirling

David Walker

Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

1988

A Generalization of Owicki-Gries's Hoare Logic for a Concurrent while Language.

[BibT_eX]

[DOI]

Colin Stirling

Theor. Comput. Sci., 1988

Temporal logics for CCS.

[BibT_eX]

[DOI]

Colin Stirling

Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

1987

Weak and Strong Fairness in CCS

[BibT_eX]

[DOI]

Gerardo Costa

Colin Stirling

Inf. Comput., June, 1987

Modal Logics for Communicating Systems.

[BibT_eX]

[DOI]

Colin Stirling

Theor. Comput. Sci., 1987