Research Papers
Elsewhere you can find my home page, details of
some talks and a complete BibTeX bibliography.
-
Stochastic Modelling of the Kai-based
Circadian Clock. Banks et al. ENTCS, to
appear. (PDF)
-
Certified Complexity. Amadio
et al. Procedia Comp. Sci. 7(2011):175–177
-
On Executable Models of Molecular
Evolution. Kwiatkowski and Stark.
In Proc. WCSB '11, pp.105–108. Tampere Int. Centre
for Signal Processing, 2011 (PDF)
-
The Continuous π-Calculus: A Process
Algebra for Biochemical Modelling. Kwiatkowski and Stark. In
Proc. CMSB '08. LNCS 5307, pp.103–122.
Springer-Verlag, 2008. (PDF)
-
Safety Guarantees from Explicit Resource
Management. Aspinall, Maier and Stark. In
Proc. FMCO '07. LNCS 5382, pp.52–71.
Springer-Verlag, 2008. (PDF)
-
Monitoring External Resources in Java
MIDP. Aspinall, Maier and Stark.
ENTCS 197(1):17–30, 2008.
-
Free-Algebra Models for the
π-Calculus.
Theor. Comp. Sci. 390(2-3):248–270,
2008.
-
MOBIUS: Mobility, Ubiquity,
Security. Barthe et al. In Proc. TGC '06,
LNCS 4661, pp.10–29. Springer-Verlag, 2007.
-
Mobile Resource
Guarantees. Sannella et al. In Trends in
Functional Programming, Vol.6, Chap.14. Intellect, 2007.
-
Automatic Verification of Design Patterns in
Java. Blewitt, Bundy and Stark. In
Proc. ASE '05, pp.224–232. ACM Press, 2005. (PDF)
-
Reducibility and TT-lifting for
Computation Types. Lindley and Stark. In
Proc. TLCA '05, LNCS 3461, pp.262–277.
Springer-Verlag, 2005. (PDF)
-
Free-Algebra Models for the
π-Calculus. In Proc. FOSSACS '05,
LNCS 3441, pp.155–169. Springer-Verlag, 2005. (PDF)
-
A Dependent Type Theory with Names
and Binding. Schöpp and Stark. In
Proc. CSL '04, LNCS 3210, pp.235–249.
Springer-Verlag, 2004. (PDF)
-
Nominal Games and Full Abstraction for
the Nu-Calculus. Abramsky, Ghica, Murawski, Ong and Stark. In
Proc. LICS '04, pp.150–159. IEEE
Comp. Soc. Press, 2004. (PDF)
-
Mobile Resource Guarantees for
Smart Devices. Aspinall, Gilmore, Hofmann, Sannella and
Stark. In Proc. CASSIS '04, LNCS 3362,
pp.1–26. Springer-Verlag, 2005. (PDF)
-
Grail: a Functional Form for Imperative
Mobile Code. Beringer, MacKenzie and Stark. In
Proc. Found. Global Comp. ENTCS 85.1. Elsevier, 2003.
(PDF)
-
Encoding Distributed Areas and Local
Communication into the Pi-Calculus. Chothia and Stark. In
Proc. EXPRESS '01. ENTCS 52.1. Elsevier, 2001. (PDF)
-
Automatic Verification of Java Design
Patterns. Blewitt, Bundy and Stark. In Proc.
ASE '01. IEEE Comp. Soc. Press, 2001. (PDF)
-
A Distributed Pi-Calculus with Local Areas
of Communication. Chothia and Stark. In Proc.
HLCL '00. ENTCS 41.2. Elsevier, 2001. (PDF)
-
Thimble - Threads for MLj. In
Proc. First Scottish Funct. Prog. Workshop, pp.337–346.
Tech. Rep. RM/99/9, Dept. Comp. and EE, Heriot-Watt University,
1999. (PDF)
-
Names, Equations, Relations: Practical
Ways to Reason about new. Fund. Inf.,
33(4):369–396, 1998. (PDF)
-
Operational Reasoning for Functions with
Local State. Pitts and Stark. In Higher Order
Operational Techniques in Semantics, pp.227–273. Pub. Newton
Inst., CUP, 1998. (PDF)
-
Presheaf Models for the
π-Calculus. Cattani, Stark and Winskel. In Proc.
CTCS '97, LNCS 1290, pp.106–126. Springer-Verlag,
1997. (PDF)
-
Names, Equations, Relations: Practical
Ways to Reason about new. In
Proc. TLCA '97, LNCS 1210, pp.336–353.
Springer-Verlag, 1997. (PDF)
-
A Fully Abstract Domain Model for the
π-Calculus. In Proc. LICS '96,
pp.36–42. IEEE Comp. Soc. Press, 1996. (PDF)
-
Domains and Denotational Semantics: History,
Accomplishments and Open Problems. Fiore, Jung, Moggi,
O'Hearn, Riecke, Rosolini and Stark. Bull. EATCS,
59:227–256, 1996. (PDF)
-
Categorical Models for Local
Names. LISP & Symb. Comp., 9(1):77–107,
1996. (PDF)
-
Names and Higher-Order
Functions. PhD thesis, U. Cambridge, 1994. (PDF)
-
Observable Properties of Higher Order
Functions that Dynamically Create Local Names, or: What's
new? Pitts and Stark. In Proc.
MFCS '93, LNCS 711, pp.122–141. Springer-Verlag,
1993. (PDF)
-
On the Observable Properties of Higher
Order Functions that Dynamically Create Local Names (Preliminary
Report). Pitts and Stark. In Proc. ACM SIGPLAN Workshop
on State in Programming Languages, pp.31–45. Report
YALEU/DCS/RR-968, Yale U. Dept. Comp. Sci., 1993. (PDF)
Publishing is like your mum coming over — you
have to
clean it up and make it presentable.
Cory Doctorow
Page last modified:
Monday 21 October 2013