A Fair Calculus of Communicating Systems. - Gerardo Costa; Colin Stirling (Acta Informatica, 1984)

A Complete Compositional Model Proof System for a Subset of CCS. - Colin Stirling (ICALP, 1985)

The Power of the Future Perfect in Program Logics - Matthew Hennessy; Colin Stirling (Inf. Control., 1985)

Follow Set Error Recovery. - Colin Stirling (Softw. Pract. Exp., 1985)

A Proof-Theoretic Characterization of Observational Equivalence. - Colin Stirling (Theor. Comput. Sci., 1985)

A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic for a Concurrent While Language. - Colin Stirling (ICALP, 1986)

A Framework for Intuitionistic Modal Logics. - Gordon D. Plotkin; Colin Stirling (TARK, 1986)

Comparing Linear and Branching Time Temporal Logics. - Colin Stirling (Temporal Logic in Specification, 1987)

Modal Logics for Communicating Systems. - Colin Stirling (Theor. Comput. Sci., 1987)

Weak and Strong Fairness in CCS - Gerardo Costa; Colin Stirling (Inf. Comput., 1987)

Temporal logics for CCS. - Colin Stirling (REX Workshop, 1988)

A Generalization of Owicki-Gries's Hoare Logic for a Concurrent while Language. - Colin Stirling (Theor. Comput. Sci., 1988)

CCS, Liveness, and Local Model Checking in the Linear Time Mu-Calculus. - Colin Stirling; David Walker 002 (Automatic Verification Methods for Finite State Systems, 1989)

An Introduction to Modal and Temporal Logics for CCS. - Colin Stirling (Concurrency: Theory, Language, And Architecture, 1989)

Verifying Temporal Properties of Processes. - Julian C. Bradfield; Colin Stirling (CONCUR, 1990)

Local Model Checking in the Modal mu-Calculus. - Colin Stirling; David Walker 002 (Theor. Comput. Sci., 1991)

Local Model Checking for Infinite State Spaces. - Julian C. Bradfield; Colin Stirling (Theor. Comput. Sci., 1992)

A Compositional Proof System for the Modal mu-Calculus - Henrik Reif Andersen; Colin Stirling; Glynn Winskel (LICS, 1994)

Modal and Temporal Logics for Processes. - Colin Stirling (Banff Higher Order Workshop, 1995)

Lokal Model Checking Games. - Colin Stirling (CONCUR, 1995)

Bisimulation Equivalence is Decidable for All Context-Free Processes - Søren Christensen; Hans Hüttel; Colin Stirling (Inf. Comput., 1995)

Games and Modal Mu-Calculus. - Colin Stirling (TACAS, 1996)

The Joys of Bisimulation. - Colin Stirling (MFCS, 1998)

Practical Model-Checking Using Games. - Perdita Stevens; Colin Stirling (TACAS, 1998)

A More Committed Quorum-Based Three Phase Commit Protocol. - Tim Kempster; Colin Stirling; Peter Thanisch (DISC, 1998)

Playing games and proving properties of concurrent systems. - Colin Stirling (J. Comput. Sci. Technol., 1998)

Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes. - Hans Hüttel; Colin Stirling (J. Log. Comput., 1998)

Bisimulation, Modal Logic and Model Checking Games. - Colin Stirling (Log. J. IGPL, 1999)

Decidability of bisimulation equivalence for normed pushdown processes. - Colin Stirling (SIGACT News, 1999)

Diluting ACID. - Tim Kempster; Colin Stirling; Peter Thanisch (SIGMOD Rec., 1999)

A brief scientific biography of Robin Milner. - Gordon D. Plotkin; Colin Stirling; Mads Tofte (Proof, Language, and Interaction, 2000)

Schema Revisited. - Colin Stirling (CSL, 2000)

Games-Based Model Checking of Protocols: counting doesn't count. - Tim Kempster; Colin Stirling; Peter Thanisch (ICDCS Workshop on Distributed System Validation and Verification, 2000)

Modal Logics and mu-Calculi: An Introduction. - Julian C. Bradfield; Colin Stirling (Handbook of Process Algebra, 2001)

Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. - Colin Stirling (FoSSaCS, 2001)

An Introduction to Decidability of DPDA Equivalence. - Colin Stirling (FSTTCS, 2001)

Focus Games for Satisfiability and Completeness of Temporal Logic. - Martin Lange; Colin Stirling (LICS, 2001)

Rational Graphs Trace Context-Sensitive Languages. - Christophe Morvan; Colin Stirling (MFCS, 2001)

Decidability of DPDA equivalence. - Colin Stirling (Theor. Comput. Sci., 2001)

Modal and Temporal Properties of Processes. - Colin Stirling (Springer, 2001)

Model Checking Fixed Point Logic with Chop. - Martin Lange; Colin Stirling (FoSSaCS, 2002)

Deciding DPDA Equivalence Is Primitive Recursive. - Colin Stirling (ICALP, 2002)

Model Checking Games for Branching Time Logics. - Martin Lange; Colin Stirling (J. Log. Comput., 2002)

Bisimulation and Language Equivalence. - Colin Stirling (Logic for Concurrency and Synchronisation, 2003)

Modeling and Model Checking Mobile Phone Payment Systems. - Tim Kempster; Colin Stirling (FORTE, 2003)

Higher-Order Matching and Games. - Colin Stirling (CSL, 2005)

Second-Order Simple Grammars. - Colin Stirling (CONCUR, 2006)

A Game-Theoretic Approach to Deciding Higher-Order Matching. - Colin Stirling (ICALP (2), 2006)

Modal mu-calculi. - Julian C. Bradfield; Colin Stirling (Handbook of Modal Logic, 2007)

Games, Automata and Matching. - Colin Stirling (CADE, 2007)

Higher-Order Matching, Games and Automata. - Colin Stirling (LICS, 2007)

Model-Checking Games for Typed lambda-Calculi. - Colin Stirling (Computation, Meaning, and Logic, 2007)

Dependency Tree Automata. - Colin Stirling (FoSSaCS, 2009)

Decidability of higher-order matching - Colin Stirling (Log. Methods Comput. Sci., 2009)

Introduction to Decidability of Higher-Order Matching. - Colin Stirling (FoSSaCS, 2010)

Obituary: Robin Milner (1934-2010). - Gordon D. Plotkin; Colin Stirling; Mads Tofte (Bull. EATCS, 2010)

Bisimulation and logic. - Colin Stirling (Advanced Topics in Bisimulation and Coinduction, 2012)

Proof Systems for Retracts in Simply Typed Lambda Calculus. - Colin Stirling (ICALP (2), 2013)

A Proof System with Names for Modal Mu-calculus. - Colin Stirling (Festschrift for Dave Schmidt, 2013)

A Tableau Proof System with Names for Modal Mu-calculus. - Colin Stirling (HOWARD-60, 2014)