default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColin Stirling
Person information
- affiliation: University of Edinburgh, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[p5]Colin Stirling:
A Tableau Proof System with Names for Modal Mu-calculus. HOWARD-60 2014: 306-318- 2013
- [c42]Colin Stirling:
Proof Systems for Retracts in Simply Typed Lambda Calculus. ICALP (2) 2013: 398-409 - [c41]Colin Stirling:
A Proof System with Names for Modal Mu-calculus. Festschrift for Dave Schmidt 2013: 18-29 - 2012
- [p4]Colin Stirling:
Bisimulation and logic. Advanced Topics in Bisimulation and Coinduction 2012: 173-196 - 2010
- [j20]Gordon D. Plotkin, Colin Stirling, Mads Tofte:
Obituary: Robin Milner (1934-2010). Bull. EATCS 101: 12-16 (2010) - [c40]Colin Stirling:
Introduction to Decidability of Higher-Order Matching. FoSSaCS 2010: 1
2000 – 2009
- 2009
- [j19]Colin Stirling:
Decidability of higher-order matching. Log. Methods Comput. Sci. 5(3) (2009) - [c39]Colin Stirling:
Dependency Tree Automata. FoSSaCS 2009: 92-106 - 2007
- [c38]Colin Stirling:
Games, Automata and Matching. CADE 2007: 1-2 - [c37]Colin Stirling:
Higher-Order Matching, Games and Automata. LICS 2007: 326-335 - [c36]Colin Stirling:
Model-Checking Games for Typed lambda-Calculi. Computation, Meaning, and Logic 2007: 589-609 - [p3]Julian C. Bradfield, Colin Stirling:
Modal mu-calculi. Handbook of Modal Logic 2007: 721-756 - 2006
- [c35]Colin Stirling:
Second-Order Simple Grammars. CONCUR 2006: 509-523 - [c34]Colin Stirling:
A Game-Theoretic Approach to Deciding Higher-Order Matching. ICALP (2) 2006: 348-359 - 2005
- [c33]Colin Stirling:
Higher-Order Matching and Games. CSL 2005: 119-134 - 2003
- [c32]Tim Kempster, Colin Stirling:
Modeling and Model Checking Mobile Phone Payment Systems. FORTE 2003: 95-110 - [p2]Colin Stirling:
Bisimulation and Language Equivalence. Logic for Concurrency and Synchronisation 2003: 269-284 - 2002
- [j18]Martin Lange, Colin Stirling:
Model Checking Games for Branching Time Logics. J. Log. Comput. 12(4): 623-639 (2002) - [c31]Martin Lange, Colin Stirling:
Model Checking Fixed Point Logic with Chop. FoSSaCS 2002: 250-263 - [c30]Colin Stirling:
Deciding DPDA Equivalence Is Primitive Recursive. ICALP 2002: 821-832 - 2001
- [b1]Colin Stirling:
Modal and Temporal Properties of Processes. Texts in Computer Science, Springer 2001, ISBN 978-1-4419-3153-5, pp. i-xii, 1-191 - [j17]Colin Stirling:
Decidability of DPDA equivalence. Theor. Comput. Sci. 255(1-2): 1-31 (2001) - [c29]Colin Stirling:
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. FoSSaCS 2001: 379-393 - [c28]Colin Stirling:
An Introduction to Decidability of DPDA Equivalence. FSTTCS 2001: 42-56 - [c27]Martin Lange, Colin Stirling:
Focus Games for Satisfiability and Completeness of Temporal Logic. LICS 2001: 357-365 - [c26]Christophe Morvan, Colin Stirling:
Rational Graphs Trace Context-Sensitive Languages. MFCS 2001: 548-559 - [p1]Julian C. Bradfield, Colin Stirling:
Modal Logics and mu-Calculi: An Introduction. Handbook of Process Algebra 2001: 293-330 - 2000
- [c25]Gordon D. Plotkin, Colin Stirling, Mads Tofte:
A brief scientific biography of Robin Milner. Proof, Language, and Interaction 2000: 1-18 - [c24]Colin Stirling:
Schema Revisited. CSL 2000: 126-138 - [c23]Tim Kempster, Colin Stirling, Peter Thanisch:
Games-Based Model Checking of Protocols: counting doesn't count. ICDCS Workshop on Distributed System Validation and Verification 2000: E111-E117 - [e1]Gordon D. Plotkin, Colin Stirling, Mads Tofte:
Proof, Language, and Interaction, Essays in Honour of Robin Milner. The MIT Press 2000, ISBN 978-0-262-16188-6 [contents]
1990 – 1999
- 1999
- [j16]Colin Stirling:
Bisimulation, Modal Logic and Model Checking Games. Log. J. IGPL 7(1): 103-124 (1999) - [j15]Colin Stirling:
Decidability of bisimulation equivalence for normed pushdown processes. SIGACT News 30(3): 19-21 (1999) - [j14]Tim Kempster, Colin Stirling, Peter Thanisch:
Diluting ACID. SIGMOD Rec. 28(4): 17-23 (1999) - 1998
- [j13]Colin Stirling:
Playing games and proving properties of concurrent systems. J. Comput. Sci. Technol. 13(6): 482 (1998) - [j12]Hans Hüttel
, Colin Stirling:
Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes. J. Log. Comput. 8(4): 485-509 (1998) - [j11]Colin Stirling:
Decidability of Bisimulation Equivalence for Normed Pushdown Processes. Theor. Comput. Sci. 195(2): 113-131 (1998) - [c22]Colin Stirling:
The Joys of Bisimulation. MFCS 1998: 142-151 - [c21]Perdita Stevens, Colin Stirling:
Practical Model-Checking Using Games. TACAS 1998: 85-101 - [c20]Tim Kempster, Colin Stirling, Peter Thanisch:
A More Committed Quorum-Based Three Phase Commit Protocol. DISC 1998: 246-257 - 1996
- [c19]Colin Stirling:
Decidability of Bisimulation Equivalence for Normed Pushdown Processes. CONCUR 1996: 217-232 - [c18]Colin Stirling:
Games and Modal Mu-Calculus. TACAS 1996: 298-312 - 1995
- [j10]Søren Christensen, Hans Hüttel, Colin Stirling:
Bisimulation Equivalence is Decidable for All Context-Free Processes. Inf. Comput. 121(2): 143-148 (1995) - [c17]Colin Stirling:
Modal and Temporal Logics for Processes. Banff Higher Order Workshop 1995: 149-237 - [c16]Colin Stirling:
Lokal Model Checking Games. CONCUR 1995: 1-11 - 1994
- [c15]Henrik Reif Andersen, Colin Stirling, Glynn Winskel:
A Compositional Proof System for the Modal mu-Calculus. LICS 1994: 144-153 - 1992
- [j9]Julian C. Bradfield, Colin Stirling:
Local Model Checking for Infinite State Spaces. Theor. Comput. Sci. 96(1): 157-174 (1992) - [c14]Søren Christensen, Hans Hüttel, Colin Stirling:
Bisimulation Equivalence is Decidable for all Context-Free Processes. CONCUR 1992: 138-147 - 1991
- [j8]Colin Stirling, David Walker:
Local Model Checking in the Modal mu-Calculus. Theor. Comput. Sci. 89(1): 161-177 (1991) - [c13]Hans Hüttel, Colin Stirling:
Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes. LICS 1991: 376-386 - 1990
- [c12]Julian C. Bradfield, Colin Stirling:
Verifying Temporal Properties of Processes. CONCUR 1990: 115-125
1980 – 1989
- 1989
- [c11]Colin Stirling, David Walker:
CCS, Liveness, and Local Model Checking in the Linear Time Mu-Calculus. Automatic Verification Methods for Finite State Systems 1989: 166-178 - [c10]Colin Stirling:
An Introduction to Modal and Temporal Logics for CCS. Concurrency: Theory, Language, And Architecture 1989: 2-20 - [c9]Colin Stirling, David Walker:
Local Model Checking in the Modal Mu-Calculus. TAPSOFT, Vol.1 1989: 369-383 - 1988
- [j7]Colin Stirling:
A Generalization of Owicki-Gries's Hoare Logic for a Concurrent while Language. Theor. Comput. Sci. 58: 347-359 (1988) - [c8]Colin Stirling:
Temporal logics for CCS. REX Workshop 1988: 660-672 - 1987
- [j6]Gerardo Costa, Colin Stirling:
Weak and Strong Fairness in CCS. Inf. Comput. 73(3): 207-244 (1987) - [j5]Colin Stirling:
Modal Logics for Communicating Systems. Theor. Comput. Sci. 49: 311-347 (1987) - [c7]Colin Stirling:
Comparing Linear and Branching Time Temporal Logics. Temporal Logic in Specification 1987: 1-20 - 1986
- [c6]Colin Stirling:
A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic for a Concurrent While Language. ICALP 1986: 407-415 - [c5]Gordon D. Plotkin, Colin Stirling:
A Framework for Intuitionistic Modal Logics. TARK 1986: 399-406 - 1985
- [j4]Matthew Hennessy, Colin Stirling:
The Power of the Future Perfect in Program Logics. Inf. Control. 67(1-3): 23-52 (1985) - [j3]Colin Stirling:
Follow Set Error Recovery. Softw. Pract. Exp. 15(3): 239-257 (1985) - [j2]Colin Stirling:
A Proof-Theoretic Characterization of Observational Equivalence. Theor. Comput. Sci. 39: 27-45 (1985) - [c4]Colin Stirling:
A Complete Compositional Model Proof System for a Subset of CCS. ICALP 1985: 475-486 - 1984
- [j1]Gerardo Costa, Colin Stirling:
A Fair Calculus of Communicating Systems. Acta Informatica 21: 417-441 (1984) - [c3]Gerardo Costa, Colin Stirling:
Weak and Strong Fairness in CCS. MFCS 1984: 245-254 - [c2]Matthew Hennessy, Colin Stirling:
The Power of the Future Perfect in Program Logics. MFCS 1984: 301-311 - 1983
- [c1]Gerardo Costa, Colin Stirling:
A Fair Calculus of Communicating Systems. FCT 1983: 94-105
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
