Search the dblp DataBase
Colin Stirling :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Colin Stirling , David Walker Local Model Checking in the Modal mu-Calculus. [Citation Graph (1, 0)][DBLP ] Theor. Comput. Sci., 1991, v:89, n:1, pp:161-177 [Journal ] Colin Stirling , David Walker CCS, Liveness, and Local Model Checking in the Linear Time Mu-Calculus. [Citation Graph (0, 0)][DBLP ] Automatic Verification Methods for Finite State Systems, 1989, pp:166-178 [Conf ] Colin Stirling Modal and Temporal Logics for Processes. [Citation Graph (0, 0)][DBLP ] Banff Higher Order Workshop, 1995, pp:149-237 [Conf ] Julian C. Bradfield , Colin Stirling Verifying Temporal Properties of Processes. [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:115-125 [Conf ] Søren Christensen , Hans Hüttel , Colin Stirling Bisimulation Equivalence is Decidable for all Context-Free Processes. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:138-147 [Conf ] Colin Stirling Second-Order Simple Grammars. [Citation Graph (0, 0)][DBLP ] CONCUR, 2006, pp:509-523 [Conf ] Colin Stirling An Introduction to Modal and Temporal Logics for CCS. [Citation Graph (0, 0)][DBLP ] Concurrency: Theory, Language, And Architecture, 1989, pp:2-20 [Conf ] Colin Stirling Lokal Model Checking Games. [Citation Graph (0, 0)][DBLP ] CONCUR, 1995, pp:1-11 [Conf ] Colin Stirling Decidability of Bisimulation Equivalence for Normed Pushdown Processes. [Citation Graph (0, 0)][DBLP ] CONCUR, 1996, pp:217-232 [Conf ] Colin Stirling Schema Revisited. [Citation Graph (0, 0)][DBLP ] CSL, 2000, pp:126-138 [Conf ] Colin Stirling Higher-Order Matching and Games. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:119-134 [Conf ] Gerardo Costa , Colin Stirling A Fair Calculus of Communicating Systems. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:94-105 [Conf ] Tim Kempster , Colin Stirling Modeling and Model Checking Mobile Phone Payment Systems. [Citation Graph (0, 0)][DBLP ] FORTE, 2003, pp:95-110 [Conf ] Martin Lange , Colin Stirling Model Checking Fixed Point Logic with Chop. [Citation Graph (0, 0)][DBLP ] FoSSaCS, 2002, pp:250-263 [Conf ] Colin Stirling Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. [Citation Graph (0, 0)][DBLP ] FoSSaCS, 2001, pp:379-393 [Conf ] Colin Stirling An Introduction to Decidability of DPDA Equivalence. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2001, pp:42-56 [Conf ] Colin Stirling Deciding DPDA Equivalence Is Primitive Recursive. [Citation Graph (0, 0)][DBLP ] ICALP, 2002, pp:821-832 [Conf ] Colin Stirling A Game-Theoretic Approach to Deciding Higher-Order Matching. [Citation Graph (0, 0)][DBLP ] ICALP (2), 2006, pp:348-359 [Conf ] Colin Stirling A Complete Compositional Model Proof System for a Subset of CCS. [Citation Graph (0, 0)][DBLP ] ICALP, 1985, pp:475-486 [Conf ] Colin Stirling A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic for a Concurrent While Language. [Citation Graph (0, 0)][DBLP ] ICALP, 1986, pp:407-415 [Conf ] Tim Kempster , Colin Stirling , Peter Thanisch Games-Based Model Checking of Protocols: counting doesn't count. [Citation Graph (0, 0)][DBLP ] ICDCS Workshop on Distributed System Validation and Verification, 2000, pp:0-0 [Conf ] Henrik Reif Andersen , Colin Stirling , Glynn Winskel A Compositional Proof System for the Modal mu-Calculus [Citation Graph (0, 0)][DBLP ] LICS, 1994, pp:144-153 [Conf ] Hans Hüttel , Colin Stirling Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes [Citation Graph (0, 0)][DBLP ] LICS, 1991, pp:376-386 [Conf ] Martin Lange , Colin Stirling Focus Games for Satisfiability and Completeness of Temporal Logic. [Citation Graph (0, 0)][DBLP ] LICS, 2001, pp:357-365 [Conf ] Gerardo Costa , Colin Stirling Weak and Strong Fairness in CCS. [Citation Graph (0, 0)][DBLP ] MFCS, 1984, pp:245-254 [Conf ] Matthew Hennessy , Colin Stirling The Power of the Future Perfect in Program Logics. [Citation Graph (0, 0)][DBLP ] MFCS, 1984, pp:301-311 [Conf ] Christophe Morvan , Colin Stirling Rational Graphs Trace Context-Sensitive Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 2001, pp:548-559 [Conf ] Colin Stirling The Joys of Bisimulation. [Citation Graph (0, 0)][DBLP ] MFCS, 1998, pp:142-151 [Conf ] Colin Stirling Temporal logics for CCS. [Citation Graph (0, 0)][DBLP ] REX Workshop, 1988, pp:660-672 [Conf ] Perdita Stevens , Colin Stirling Practical Model-Checking Using Games. [Citation Graph (0, 0)][DBLP ] TACAS, 1998, pp:85-101 [Conf ] Colin Stirling Games and Modal Mu-Calculus. [Citation Graph (0, 0)][DBLP ] TACAS, 1996, pp:298-312 [Conf ] Colin Stirling , David Walker Local Model Checking in the Modal Mu-Calculus. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:369-383 [Conf ] Gordon D. Plotkin , Colin Stirling A Framework for Intuitionistic Modal Logics. [Citation Graph (0, 0)][DBLP ] TARK, 1986, pp:399-406 [Conf ] Colin Stirling Comparing Linear and Branching Time Temporal Logics. [Citation Graph (0, 0)][DBLP ] Temporal Logic in Specification, 1987, pp:1-20 [Conf ] Tim Kempster , Colin Stirling , Peter Thanisch A More Committed Quorum-Based Three Phase Commit Protocol. [Citation Graph (0, 0)][DBLP ] DISC, 1998, pp:246-257 [Conf ] Gerardo Costa , Colin Stirling A Fair Calculus of Communicating Systems. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1984, v:21, n:, pp:417-441 [Journal ] Colin Stirling Model-Checking Games for Typed lambda-Calculi. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2007, v:172, n:, pp:589-609 [Journal ] Gerardo Costa , Colin Stirling Weak and Strong Fairness in CCS [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1987, v:73, n:3, pp:207-244 [Journal ] Søren Christensen , Hans Hüttel , Colin Stirling Bisimulation Equivalence is Decidable for All Context-Free Processes [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1995, v:121, n:2, pp:143-148 [Journal ] Matthew Hennessy , Colin Stirling The Power of the Future Perfect in Program Logics [Citation Graph (0, 0)][DBLP ] Information and Control, 1985, v:67, n:1-3, pp:23-52 [Journal ] Colin Stirling Bisimulation, Modal Logic and Model Checking Games. [Citation Graph (0, 0)][DBLP ] Logic Journal of the IGPL, 1999, v:7, n:1, pp:103-124 [Journal ] Hans Hüttel , Colin Stirling Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes. [Citation Graph (0, 0)][DBLP ] J. Log. Comput., 1998, v:8, n:4, pp:485-509 [Journal ] Martin Lange , Colin Stirling Model Checking Games for Branching Time Logics. [Citation Graph (0, 0)][DBLP ] J. Log. Comput., 2002, v:12, n:4, pp:623-639 [Journal ] Tim Kempster , Colin Stirling , Peter Thanisch Diluting ACID. [Citation Graph (0, 1)][DBLP ] SIGMOD Record, 1999, v:28, n:4, pp:17-23 [Journal ] Colin Stirling Follow Set Error Recovery. [Citation Graph (0, 0)][DBLP ] Softw., Pract. Exper., 1985, v:15, n:3, pp:239-257 [Journal ] Julian C. Bradfield , Colin Stirling Local Model Checking for Infinite State Spaces. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1992, v:96, n:1, pp:157-174 [Journal ] Colin Stirling Decidability of DPDA equivalence. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:255, n:1-2, pp:1-31 [Journal ] Colin Stirling A Proof-Theoretic Characterization of Observational Equivalence. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:27-45 [Journal ] Colin Stirling Modal Logics for Communicating Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1987, v:49, n:, pp:311-347 [Journal ] Colin Stirling A Generalization of Owicki-Gries's Hoare Logic for a Concurrent while Language. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1988, v:58, n:, pp:347-359 [Journal ] Colin Stirling Decidability of Bisimulation Equivalence for Normed Pushdown Processes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:195, n:2, pp:113-131 [Journal ] Colin Stirling Games, Automata and Matching. [Citation Graph (0, 0)][DBLP ] CADE, 2007, pp:1-2 [Conf ] Colin Stirling Higher-Order Matching, Games and Automata. [Citation Graph (0, 0)][DBLP ] LICS, 2007, pp:326-335 [Conf ] A brief scientific biography of Robin Milner. [Citation Graph (, )][DBLP ] Dependency Tree Automata. [Citation Graph (, )][DBLP ] Introduction to Decidability of Higher-Order Matching. [Citation Graph (, )][DBLP ] Decidability of higher-order matching [Citation Graph (, )][DBLP ] Search in 0.070secs, Finished in 0.072secs