dblp.uni-trier.dewww.uni-trier.de

Colin Stirling Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
57EEColin Stirling: Dependency Tree Automata. FOSSACS 2009: 92-106
56EEColin Stirling: Decidability of higher-order matching Logical Methods in Computer Science 5(3): (2009)
2007
55EEColin Stirling: Games, Automata and Matching. CADE 2007: 1-2
54EEColin Stirling: Higher-Order Matching, Games and Automata. LICS 2007: 326-335
53EEColin Stirling: Model-Checking Games for Typed lambda-Calculi. Electr. Notes Theor. Comput. Sci. 172: 589-609 (2007)
2006
52EEColin Stirling: Second-Order Simple Grammars. CONCUR 2006: 509-523
51EEColin Stirling: A Game-Theoretic Approach to Deciding Higher-Order Matching. ICALP (2) 2006: 348-359
2005
50EEColin Stirling: Higher-Order Matching and Games. CSL 2005: 119-134
2003
49EETim Kempster, Colin Stirling: Modeling and Model Checking Mobile Phone Payment Systems. FORTE 2003: 95-110
2002
48EEMartin Lange, Colin Stirling: Model Checking Fixed Point Logic with Chop. FoSSaCS 2002: 250-263
47EEColin Stirling: Deciding DPDA Equivalence Is Primitive Recursive. ICALP 2002: 821-832
46EEMartin Lange, Colin Stirling: Model Checking Games for Branching Time Logics. J. Log. Comput. 12(4): 623-639 (2002)
2001
45EEColin Stirling: An Introduction to Decidability of DPDA Equivalence. FSTTCS 2001: 42-56
44EEColin Stirling: Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. FoSSaCS 2001: 379-393
43 Martin Lange, Colin Stirling: Focus Games for Satisfiability and Completeness of Temporal Logic. LICS 2001: 357-365
42EEChristophe Morvan, Colin Stirling: Rational Graphs Trace Context-Sensitive Languages. MFCS 2001: 548-559
41EEColin Stirling: Decidability of DPDA equivalence. Theor. Comput. Sci. 255(1-2): 1-31 (2001)
2000
40 Gordon D. Plotkin, Colin Stirling, Mads Tofte: Proof, Language, and Interaction, Essays in Honour of Robin Milner The MIT Press 2000
39EEColin Stirling: Schema Revisited. CSL 2000: 126-138
38 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
37 Gordon D. Plotkin, Colin Stirling, Mads Tofte: A brief scientific biography of Robin Milner. Proof, Language, and Interaction 2000: 1-18
1999
36EEColin Stirling: Bisimulation, Modal Logic and Model Checking Games. Logic Journal of the IGPL 7(1): 103-124 (1999)
35EETim Kempster, Colin Stirling, Peter Thanisch: Diluting ACID. SIGMOD Record 28(4): 17-23 (1999)
1998
34EETim Kempster, Colin Stirling, Peter Thanisch: A More Committed Quorum-Based Three Phase Commit Protocol. DISC 1998: 246-257
33EEColin Stirling: The Joys of Bisimulation. MFCS 1998: 142-151
32EEPerdita Stevens, Colin Stirling: Practical Model-Checking Using Games. TACAS 1998: 85-101
31 Hans Hüttel, Colin Stirling: Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes. J. Log. Comput. 8(4): 485-509 (1998)
30EEColin Stirling: Decidability of Bisimulation Equivalence for Normed Pushdown Processes. Theor. Comput. Sci. 195(2): 113-131 (1998)
1996
29EEColin Stirling: Decidability of Bisimulation Equivalence for Normed Pushdown Processes. CONCUR 1996: 217-232
28 Colin Stirling: Games and Modal Mu-Calculus. TACAS 1996: 298-312
1995
27 Colin Stirling: Modal and Temporal Logics for Processes. Banff Higher Order Workshop 1995: 149-237
26EEColin Stirling: Lokal Model Checking Games. CONCUR 1995: 1-11
25 Søren Christensen, Hans Hüttel, Colin Stirling: Bisimulation Equivalence is Decidable for All Context-Free Processes Inf. Comput. 121(2): 143-148 (1995)
1994
24 Henrik Reif Andersen, Colin Stirling, Glynn Winskel: A Compositional Proof System for the Modal mu-Calculus LICS 1994: 144-153
1992
23EESøren Christensen, Hans Hüttel, Colin Stirling: Bisimulation Equivalence is Decidable for all Context-Free Processes. CONCUR 1992: 138-147
22 Julian C. Bradfield, Colin Stirling: Local Model Checking for Infinite State Spaces. Theor. Comput. Sci. 96(1): 157-174 (1992)
1991
21 Hans Hüttel, Colin Stirling: Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes LICS 1991: 376-386
20 Colin Stirling, David Walker: Local Model Checking in the Modal mu-Calculus. Theor. Comput. Sci. 89(1): 161-177 (1991)
1990
19EEJulian C. Bradfield, Colin Stirling: Verifying Temporal Properties of Processes. CONCUR 1990: 115-125
1989
18EEColin 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
17EEColin Stirling: An Introduction to Modal and Temporal Logics for CCS. Concurrency: Theory, Language, And Architecture 1989: 2-20
16EEColin Stirling, David Walker: Local Model Checking in the Modal Mu-Calculus. TAPSOFT, Vol.1 1989: 369-383
1988
15EEColin Stirling: Temporal logics for CCS. REX Workshop 1988: 660-672
14 Colin Stirling: A Generalization of Owicki-Gries's Hoare Logic for a Concurrent while Language. Theor. Comput. Sci. 58: 347-359 (1988)
1987
13 Colin Stirling: Comparing Linear and Branching Time Temporal Logics. Temporal Logic in Specification 1987: 1-20
12 Gerardo Costa, Colin Stirling: Weak and Strong Fairness in CCS Inf. Comput. 73(3): 207-244 (1987)
11 Colin Stirling: Modal Logics for Communicating Systems. Theor. Comput. Sci. 49: 311-347 (1987)
1986
10EEColin Stirling: A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic for a Concurrent While Language. ICALP 1986: 407-415
9 Gordon D. Plotkin, Colin Stirling: A Framework for Intuitionistic Modal Logics. TARK 1986: 399-406
1985
8EEColin Stirling: A Complete Compositional Model Proof System for a Subset of CCS. ICALP 1985: 475-486
7 Matthew Hennessy, Colin Stirling: The Power of the Future Perfect in Program Logics Information and Control 67(1-3): 23-52 (1985)
6 Colin Stirling: Follow Set Error Recovery. Softw., Pract. Exper. 15(3): 239-257 (1985)
5 Colin Stirling: A Proof-Theoretic Characterization of Observational Equivalence. Theor. Comput. Sci. 39: 27-45 (1985)
1984
4EEGerardo Costa, Colin Stirling: Weak and Strong Fairness in CCS. MFCS 1984: 245-254
3EEMatthew Hennessy, Colin Stirling: The Power of the Future Perfect in Program Logics. MFCS 1984: 301-311
2 Gerardo Costa, Colin Stirling: A Fair Calculus of Communicating Systems. Acta Inf. 21: 417-441 (1984)
1983
1 Gerardo Costa, Colin Stirling: A Fair Calculus of Communicating Systems. FCT 1983: 94-105

Coauthor Index

1Henrik Reif Andersen [24]
2Julian C. Bradfield [19] [22]
3Søren Christensen [23] [25]
4Gerardo Costa [1] [2] [4] [12]
5Matthew Hennessy [3] [7]
6Hans Hüttel [21] [23] [25] [31]
7Tim Kempster [34] [35] [38] [49]
8Martin Lange [43] [46] [48]
9Christophe Morvan [42]
10Gordon D. Plotkin [9] [37] [40]
11Perdita Stevens [32]
12Peter Thanisch [34] [35] [38]
13Mads Tofte [37] [40]
14David Walker [16] [18] [20]
15Glynn Winskel [24]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)