BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Cyprus
1 × Greece
1 × Latvia
1 × Poland
1 × Portugal
1 × Spain
1 × The Netherlands
1 × USA
2 × Italy
2 × United Kingdom
3 × France
3 × Germany
Collaborated with:
∅ M.Lange P.Stevens H.Hüttel D.Walker H.R.Andersen G.Winskel
Talks about:
game (7) match (5) calculus (4) higher (4) order (4) model (4) decid (4) composit (3) automata (3) system (3)

Person: Colin Stirling

DBLP DBLP: Stirling:Colin

Contributed to:

ICALP (2) 20132013
FOSSACS 20102010
FOSSACS 20092009
CADE 20072007
LICS 20072007
ICALP (2) 20062006
CSL 20052005
FoSSaCS 20022002
ICALP 20022002
FoSSaCS 20012001
LICS 20012001
CSL 20002000
TACAS 19981998
TACAS 19961996
LICS 19941994
LICS 19911991
ICALP 19861986
ICALP 19851985
TAPSOFT, Vol.1: CAAP 19891989

Wrote 19 papers:

ICALP-v2-2013-Stirling #proving #λ-calculus
Proof Systems for Retracts in Simply Typed λ Calculus (CS), pp. 398–409.
FoSSaCS-2010-Stirling #decidability #higher-order
Introduction to Decidability of Higher-Order Matching (CS), p. 1.
FoSSaCS-2009-Stirling #automaton #dependence
Dependency Tree Automata (CS), pp. 92–106.
CADE-2007-Stirling #automaton #game studies
Games, Automata and Matching (CS), pp. 1–2.
LICS-2007-Stirling #automaton #game studies #higher-order
Higher-Order Matching, Games and Automata (CS), pp. 326–335.
ICALP-v2-2006-Stirling #approach #game studies #higher-order
A Game-Theoretic Approach to Deciding Higher-Order Matching (CS), pp. 348–359.
CSL-2005-Stirling #game studies #higher-order
Higher-Order Matching and Games (CS), pp. 119–134.
FoSSaCS-2002-LangeS #fixpoint #logic #model checking
Model Checking Fixed Point Logic with Chop (ML, CS), pp. 250–263.
ICALP-2002-Stirling #equivalence #recursion
Deciding DPDA Equivalence Is Primitive Recursive (CS), pp. 821–832.
FoSSaCS-2001-Stirling #decidability #parallel #process #set #similarity
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes (CS), pp. 379–393.
LICS-2001-LangeS #game studies #logic #satisfiability
Focus Games for Satisfiability and Completeness of Temporal Logic (ML, CS), pp. 357–365.
CSL-2000-Stirling #revisited
Schema Revisited (CS), pp. 126–138.
TACAS-1998-StevensS #game studies #model checking #using
Practical Model-Checking Using Games (PS, CS), pp. 85–101.
TACAS-1996-Stirling #calculus #game studies #μ-calculus
Games and Modal μ-Calculus (CS), pp. 298–312.
LICS-1994-AndersenSW #calculus #composition #proving #μ-calculus
A Compositional Proof System for the Modal μ-Calculus (HRA, CS, GW), pp. 144–153.
LICS-1991-HuttelS #process #proving #similarity #word
Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes (HH, CS), pp. 376–386.
ICALP-1986-Stirling #composition #concurrent #correctness #logic
A Compositional Reformulation of Owicki-Gries’s Partial Correctness Logic for a Concurrent While Language (CS), pp. 407–415.
ICALP-1985-Stirling #composition #proving #set
A Complete Compositional Model Proof System for a Subset of CCS (CS), pp. 475–486.
CAAP-1989-StirlingW #calculus #model checking
Local Model Checking in the Modal Mu-Calculus (CS, DW), pp. 369–383.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.