# Colin Stirling

According to our database

^{1}, Colin Stirling## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2014

A Tableau Proof System with Names for Modal Mu-calculus.

Proceedings of the HOWARD-60: A Festschrift on the Occasion of Howard Barringer's 60th Birthday, 2014

2013

A Proof System with Names for Modal Mu-calculus.

Proceedings of the Semantics, 2013

Proof Systems for Retracts in Simply Typed Lambda Calculus.

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2010

Obituary: Robin Milner (1934-2010).

Bulletin of the EATCS, 2010

Introduction to Decidability of Higher-Order Matching.

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

2009

Decidability of higher-order matching

Logical Methods in Computer Science, 2009

Dependency Tree Automata.

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

2007

Model-Checking Games for Typed lambda-Calculi.

Electr. Notes Theor. Comput. Sci., 2007

Higher-Order Matching, Games and Automata.

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Games, Automata and Matching.

Proceedings of the Automated Deduction, 2007

2006

A Game-Theoretic Approach to Deciding Higher-Order Matching.

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Second-Order Simple Grammars.

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005

Higher-Order Matching and Games.

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2003

Modeling and Model Checking Mobile Phone Payment Systems.

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

2002

Model Checking Games for Branching Time Logics.

J. Log. Comput., 2002

Deciding DPDA Equivalence Is Primitive Recursive.

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

Model Checking Fixed Point Logic with Chop.

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

2001

Modal and Temporal Properties of Processes.

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

Decidability of DPDA equivalence.

Theor. Comput. Sci., 2001

Rational Graphs Trace Context-Sensitive Languages.

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Focus Games for Satisfiability and Completeness of Temporal Logic.

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

An Introduction to Decidability of DPDA Equivalence.

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.

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

2000

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

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

Schema Revisited.

Proceedings of the Computer Science Logic, 2000

A brief scientific biography of Robin Milner.

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

1999

Diluting ACID.

SIGMOD Record, 1999

Decidability of bisimulation equivalence for normed pushdown processes.

SIGACT News, 1999

Bisimulation, Modal Logic and Model Checking Games.

Logic Journal of the IGPL, 1999

1998

Decidability of Bisimulation Equivalence for Normed Pushdown Processes.

Theor. Comput. Sci., 1998

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

J. Log. Comput., 1998

Playing games and proving properties of concurrent systems.

J. Comput. Sci. Technol., 1998

A More Committed Quorum-Based Three Phase Commit Protocol.

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

Practical Model-Checking Using Games.

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

The Joys of Bisimulation.

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1996

Games and Modal Mu-Calculus.

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

Decidability of Bisimulation Equivalence for Normed Pushdown Processes.

Proceedings of the CONCUR '96, 1996

1995

Bisimulation Equivalence is Decidable for All Context-Free Processes

Inf. Comput., September, 1995

Lokal Model Checking Games.

Proceedings of the CONCUR '95: Concurrency Theory, 1995

Modal and Temporal Logics for Processes.

Proceedings of the Logics for Concurrency - Structure versus Automata (8th Banff Higher Order Workshop, August 27, 1995

1994

A Compositional Proof System for the Modal mu-Calculus

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

1992

Local Model Checking for Infinite State Spaces.

Theor. Comput. Sci., 1992

Bisimulation Equivalence is Decidable for all Context-Free Processes.

Proceedings of the CONCUR '92, 1992

1991

Local Model Checking in the Modal mu-Calculus.

Theor. Comput. Sci., 1991

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

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

1990

Verifying Temporal Properties of Processes.

Proceedings of the CONCUR '90, 1990

1989

Local Model Checking in the Modal Mu-Calculus.

Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

An Introduction to Modal and Temporal Logics for CCS.

Proceedings of the Concurrency: Theory, 1989

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

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.

Theor. Comput. Sci., 1988

Temporal logics for CCS.

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

Inf. Comput., June, 1987

Modal Logics for Communicating Systems.

Theor. Comput. Sci., 1987

Comparing Linear and Branching Time Temporal Logics.

Proceedings of the Temporal Logic in Specification, 1987

1986

A Framework for Intuitionistic Modal Logics.

Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge, 1986

A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic for a Concurrent While Language.

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985

A Proof-Theoretic Characterization of Observational Equivalence.

Theor. Comput. Sci., 1985

Follow Set Error Recovery.

Softw., Pract. Exper., 1985

The Power of the Future Perfect in Program Logics

Information and Control, 1985

A Complete Compositional Model Proof System for a Subset of CCS.

Proceedings of the Automata, 1985

1984

A Fair Calculus of Communicating Systems.

Acta Inf., 1984

The Power of the Future Perfect in Program Logics.

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

Weak and Strong Fairness in CCS.

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983

A Fair Calculus of Communicating Systems.

Proceedings of the Fundamentals of Computation Theory, 1983