Stirling, Colin - School of Informatics, University of Edinburgh

• A Game-Theoretic Approach to Deciding Higher-Order Matching
• Model Checking and Other Games \Lambda Colin Stirling
• Deciding DPDA Equivalence is Primitive Colin Stirling
• HIGHER-ORDER MATCHING AND GAMES Colin Stirling
• Schema Revisited Colin Stirling
• An Introduction to Decidability of DPDA Equivalence
• Local Model Checking Games (Extended Abstract)
• 1 Bisimulation and Logic page 2 1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
• Decidability of DPDA equivalence Colin Stirling
• A Compositional Proof System for the Modal Calculus
• Focus Games for Satisfiability and Completeness of Temporal Logic Martin Lange Colin Stirling
• Deciding DPDA Equivalence is Primitive Colin Stirling
• MODAL MU-CALCULI Julian Brad eld and Colin Stirling
• An Introduction to Decidability of DPDA Equivalence
• Games and Modal MuCalculus Colin Stirling \Lambda
• Decidability of Bisimulation Equivalence for Pushdown Processes
• Language Theory and In nite Graphs Colin Stirling
• Rational graphs trace contextsensitive Christophe Morvan 1 and Colin Stirling 2
• Language Theory and Infinite Graphs Colin Stirling
• Book Editors IOS Press, 2003
• Actions Speak Louder than Words: Proving Bisimilarity for ContextFree
• Modal and Temporal Logics Colin Stirling
• Deciding DPDA Equivalence is Primitive Recursive
• Games and Modal Mu-Calculus Colin Stirling
• Bisimulation Equivalence is Decidable for all Context-Free Processes
• A Compositional Proof System for the Modal Calculus \Lambda
• Model Checking Fixed Point Logic with Chop Martin Lange and Colin Stirling
• Focus Games for Satisfiability and Completeness of Temporal Logic Martin Lange Colin Stirling
• Decidability of DPDA equivalence Colin Stirling
• Higher-Order Matching, Games and Automata Colin Stirling
• The Joys of Bisimulation Colin Stirling
• Model Checking Fixed Point Logic with Chop Martin Lange and Colin Stirling
• Second-Order Simple Grammars Colin Stirling
• Modal and Temporal Logics for Processes Colin Stirling
• Bisimulation and Language Equivalence Colin Stirling
• Decidability of Bisimulation Equivalence for Normed Pushdown Processes
• Under consideration for publication in Math. Struct. in Comp. Science An introduction to decidability of
• An introduction to deciding higher-order Colin Stirling
• Dependency Tree Automata Colin Stirling
• Language Theory and Infinite Graphs Colin Stirling
• Language Theory and Infinite Graphs Colin Stirling
• Modal and Temporal Logics Colin Stirling
• Modal and Temporal Logics Colin Stirling
• Dependency Tree Automata Colin Stirling
• GDP Festschrift ENTCS, to appear Model-Checking Games for Typed -Calculi
• Book Editors IOS Press, 2003
• Bisimulation and Language Equivalence Colin Stirling
• Deciding DPDA Equivalence is Primitive Recursive
• Model Checking Games for Branching Time Logics
• Schema Revisited Colin Stirling
• Decidability of Bisimulation Equivalence for Pushdown Processes
• Bisimulation, Model Checking and Other Colin Stirling
• Modal and Temporal Logics for Processes Colin Stirling
• Local Model Checking Games (Extended Abstract)
• A Compositional Proof System for the Modal -Calculus
• A Compositional Proof System for the Modal -Calculus
• Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes
• Model Checking Games for Branching Time Logics
• Rational graphs trace context-sensitive Christophe Morvan1
• Actions Speak Louder than Words: Proving Bisimilarity for Context-Free
• Modal and Temporal Logics Colin Stirling
• The Joys of Bisimulation Colin Stirling
• Language Theory and Infinite Graphs Colin Stirling
• Logical Methods in Computer Science Volume 00, Number 0, Pages 000000