Colin Stirling

69 papers A* 7A 4B 17C 1Journal 20Unranked 13

Year	Rank	Type	Title / Venue / Authors
2014	—	`ch.`	A Tableau Proof System with Names for Modal Mu-calculus. HOWARD-60 Colin Stirling
2013	—	`conf`	A Proof System with Names for Modal Mu-calculus. Festschrift for Dave Schmidt Colin Stirling
2013	—	`conf`	Proof Systems for Retracts in Simply Typed Lambda Calculus. ICALP (2) Colin Stirling
2012	—	`ch.`	Bisimulation and logic. Advanced Topics in Bisimulation and Coinduction Colin Stirling
2010	B	`conf`	Introduction to Decidability of Higher-Order Matching. FoSSaCS Colin Stirling
2010	J	`jnl`	Obituary: Robin Milner (1934-2010). Bull. EATCS Gordon D. Plotkin, Colin Stirling, Mads Tofte
2009	J	`jnl`	Decidability of higher-order matching Log. Methods Comput. Sci. Colin Stirling
2009	B	`conf`	Dependency Tree Automata. FoSSaCS Colin Stirling
2007	A	`conf`	Games, Automata and Matching. CADE Colin Stirling
2007	A*	`conf`	Higher-Order Matching, Games and Automata. LICS Colin Stirling
2007	—	`ch.`	Modal mu-calculi. Handbook of Modal Logic Julian C. Bradfield, Colin Stirling
2007	—	`conf`	Model-Checking Games for Typed lambda-Calculi. Computation, Meaning, and Logic Colin Stirling
2006	—	`conf`	A Game-Theoretic Approach to Deciding Higher-Order Matching. ICALP (2) Colin Stirling
2006	B	`conf`	Second-Order Simple Grammars. CONCUR Colin Stirling
2005	B	`conf`	Higher-Order Matching and Games. CSL Colin Stirling
2003	—	`ch.`	Bisimulation and Language Equivalence. Logic for Concurrency and Synchronisation Colin Stirling
2003	C	`conf`	Modeling and Model Checking Mobile Phone Payment Systems. FORTE Tim Kempster, Colin Stirling
2002	A*	`conf`	Deciding DPDA Equivalence Is Primitive Recursive. ICALP Colin Stirling
2002	B	`conf`	Model Checking Fixed Point Logic with Chop. FoSSaCS Martin Lange, Colin Stirling
2002	J	`jnl`	Model Checking Games for Branching Time Logics. J. Log. Comput. Martin Lange, Colin Stirling
2001	—	`conf`	An Introduction to Decidability of DPDA Equivalence. FSTTCS Colin Stirling
2001	J	`jnl`	Decidability of DPDA equivalence. Theor. Comput. Sci. Colin Stirling
2001	B	`conf`	Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. FoSSaCS Colin Stirling
2001	A*	`conf`	Focus Games for Satisfiability and Completeness of Temporal Logic. LICS Martin Lange, Colin Stirling
2001	—	`ch.`	Modal Logics and mu-Calculi: An Introduction. Handbook of Process Algebra Julian C. Bradfield, Colin Stirling
2001	—	`book`	Modal and Temporal Properties of Processes. Colin Stirling
2001	B	`conf`	Rational Graphs Trace Context-Sensitive Languages. MFCS Christophe Morvan, Colin Stirling
2000	—	`conf`	A brief scientific biography of Robin Milner. Proof, Language, and Interaction Gordon D. Plotkin, Colin Stirling, Mads Tofte
2000	—	`conf`	Games-Based Model Checking of Protocols: counting doesn't count. ICDCS Workshop on Distributed System Validation and Verification Tim Kempster, Colin Stirling, Peter Thanisch
2000	—	`ed.`	Proof, Language, and Interaction, Essays in Honour of Robin Milner Proof, Language, and Interaction Gordon D. Plotkin, Colin Stirling, Mads Tofte
2000	B	`conf`	Schema Revisited. CSL Colin Stirling
1999	J	`jnl`	Bisimulation, Modal Logic and Model Checking Games. Log. J. IGPL Colin Stirling
1999	J	`jnl`	Decidability of bisimulation equivalence for normed pushdown processes. SIGACT News Colin Stirling
1999	J	`jnl`	Diluting ACID. SIGMOD Rec. Tim Kempster, Colin Stirling, Peter Thanisch
1998	A	`conf`	A More Committed Quorum-Based Three Phase Commit Protocol. DISC Tim Kempster, Colin Stirling, Peter Thanisch
1998	J	`jnl`	Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes. J. Log. Comput. Hans Hüttel, Colin Stirling
1998	J	`jnl`	Decidability of Bisimulation Equivalence for Normed Pushdown Processes. Theor. Comput. Sci. Colin Stirling
1998	J	`jnl`	Playing games and proving properties of concurrent systems. J. Comput. Sci. Technol. Colin Stirling
1998	A	`conf`	Practical Model-Checking Using Games. TACAS Perdita Stevens, Colin Stirling
1998	B	`conf`	The Joys of Bisimulation. MFCS Colin Stirling
1996	B	`conf`	Decidability of Bisimulation Equivalence for Normed Pushdown Processes. CONCUR Colin Stirling
1996	A	`conf`	Games and Modal Mu-Calculus. TACAS Colin Stirling
1995	J	`jnl`	Bisimulation Equivalence is Decidable for All Context-Free Processes Inf. Comput. Søren Christensen, Hans Hüttel, Colin Stirling
1995	B	`conf`	Lokal Model Checking Games. CONCUR Colin Stirling
1995	—	`conf`	Modal and Temporal Logics for Processes. Banff Higher Order Workshop Colin Stirling
1994	A*	`conf`	A Compositional Proof System for the Modal mu-Calculus LICS Henrik Reif Andersen, Colin Stirling, Glynn Winskel
1992	B	`conf`	Bisimulation Equivalence is Decidable for all Context-Free Processes. CONCUR Søren Christensen, Hans Hüttel, Colin Stirling
1992	J	`jnl`	Local Model Checking for Infinite State Spaces. Theor. Comput. Sci. Julian C. Bradfield, Colin Stirling
1991	A*	`conf`	Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes LICS Hans Hüttel, Colin Stirling
1991	J	`jnl`	Local Model Checking in the Modal mu-Calculus. Theor. Comput. Sci. Colin Stirling, David Walker
1990	B	`conf`	Verifying Temporal Properties of Processes. CONCUR Julian C. Bradfield, Colin Stirling
1989	—	`conf`	An Introduction to Modal and Temporal Logics for CCS. Concurrency: Theory, Language, And Architecture Colin Stirling
1989	—	`conf`	CCS, Liveness, and Local Model Checking in the Linear Time Mu-Calculus. Automatic Verification Methods for Finite State Systems Colin Stirling, David Walker
1989	—	`conf`	Local Model Checking in the Modal Mu-Calculus. TAPSOFT, Vol.1 Colin Stirling, David Walker
1988	J	`jnl`	A Generalization of Owicki-Gries's Hoare Logic for a Concurrent while Language. Theor. Comput. Sci. Colin Stirling
1988	—	`conf`	Temporal logics for CCS. REX Workshop Colin Stirling
1987	—	`conf`	Comparing Linear and Branching Time Temporal Logics. Temporal Logic in Specification Colin Stirling
1987	J	`jnl`	Modal Logics for Communicating Systems. Theor. Comput. Sci. Colin Stirling
1987	J	`jnl`	Weak and Strong Fairness in CCS Inf. Comput. Gerardo Costa, Colin Stirling
1986	A*	`conf`	A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic for a Concurrent While Language. ICALP Colin Stirling
1986	B	`conf`	A Framework for Intuitionistic Modal Logics. TARK Gordon D. Plotkin, Colin Stirling
1985	A*	`conf`	A Complete Compositional Model Proof System for a Subset of CCS. ICALP Colin Stirling
1985	J	`jnl`	A Proof-Theoretic Characterization of Observational Equivalence. Theor. Comput. Sci. Colin Stirling
1985	J	`jnl`	Follow Set Error Recovery. Softw. Pract. Exp. Colin Stirling
1985	J	`jnl`	The Power of the Future Perfect in Program Logics Inf. Control. Matthew Hennessy, Colin Stirling
1984	J	`jnl`	A Fair Calculus of Communicating Systems. Acta Informatica Gerardo Costa, Colin Stirling
1984	B	`conf`	The Power of the Future Perfect in Program Logics. MFCS Matthew Hennessy, Colin Stirling
1984	B	`conf`	Weak and Strong Fairness in CCS. MFCS Gerardo Costa, Colin Stirling
1983	B	`conf`	A Fair Calculus of Communicating Systems. FCT Gerardo Costa, Colin Stirling