| 2013 | ICALP | Proof Systems for Retracts in Simply Typed Lambda Calculus. | Colin Stirling |
| 2010 | FOSSACS | Introduction to Decidability of Higher-Order Matching. | Colin Stirling |
| 2009 | FOSSACS | Dependency Tree Automata. | Colin Stirling |
| 2007 | CADE | Games, Automata and Matching. | Colin Stirling |
| 2007 | LICS | Higher-Order Matching, Games and Automata. | Colin Stirling |
| 2006 | CONCUR | Second-Order Simple Grammars. | Colin Stirling |
| 2006 | ICALP | A Game-Theoretic Approach to Deciding Higher-Order Matching. | Colin Stirling |
| 2005 | CSL | Higher-Order Matching and Games. | Colin Stirling |
| 2003 | FORTE | Modeling and Model Checking Mobile Phone Payment Systems. | Tim Kempster, Colin Stirling |
| 2002 | FOSSACS | Model Checking Fixed Point Logic with Chop. | Martin Lange, Colin Stirling |
| 2002 | ICALP | Deciding DPDA Equivalence Is Primitive Recursive. | Colin Stirling |
| 2001 | FOSSACS | Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. | Colin Stirling |
| 2001 | LICS | Focus Games for Satisfiability and Completeness of Temporal Logic. | Martin Lange, Colin Stirling |
| 2001 | MFCS | Rational Graphs Trace Context-Sensitive Languages. | Christophe Morvan, Colin Stirling |
| 2000 | CSL | Schema Revisited. | Colin Stirling |
| 1998 | MFCS | The Joys of Bisimulation. | Colin Stirling |
| 1998 | TACAS | Practical Model-Checking Using Games. | Perdita Stevens, Colin Stirling |
| 1996 | CONCUR | Decidability of Bisimulation Equivalence for Normed Pushdown Processes. | Colin Stirling |
| 1996 | TACAS | Games and Modal Mu-Calculus. | Colin Stirling |
| 1995 | CONCUR | Lokal Model Checking Games. | Colin Stirling |
| 1994 | LICS | A Compositional Proof System for the Modal mu-Calculus | Henrik Reif Andersen, Colin Stirling, Glynn Winskel |
| 1992 | CONCUR | Bisimulation Equivalence is Decidable for all Context-Free Processes. | Sren Christensen, Hans Httel, Colin Stirling |
| 1991 | LICS | Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes | Hans Httel, Colin Stirling |
| 1990 | CONCUR | Verifying Temporal Properties of Processes. | Julian C. Bradfield, Colin Stirling |
| 1989 | CONCUR | An Introduction to Modal and Temporal Logics for CCS. | Colin Stirling |
| 1986 | ICALP | A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic for a Concurrent While Language. | Colin Stirling |
| 1986 | TARK | A Framework for Intuitionistic Modal Logics. | Gordon D. Plotkin, Colin Stirling |
| 1985 | ICALP | A Complete Compositional Model Proof System for a Subset of CCS. | Colin Stirling |
| 1984 | MFCS | Weak and Strong Fairness in CCS. | Gerardo Costa, Colin Stirling |
| 1984 | MFCS | The Power of the Future Perfect in Program Logics. | Matthew Hennessy, Colin Stirling |
| 1983 | FCT | A Fair Calculus of Communicating Systems. | Gerardo Costa, Colin Stirling |