Brian Campbell

I am a researcher currently working on the EU CerCo project. I previously worked on the ReQueST project, before which I was a PhD research student studying static prediction of stack-space requirements for functional programs. I'm in the Laboratory for Foundations of Computer Science, part of the School of Informatics at the University of Edinburgh. You can find some related material to that work on the MRG group's web pages.

Recently I have been writing some executable semantics for the CompCert C language.

I was one of the organisers for the March 2011 Scottish Programming Languages Seminar meeting.

Documents

Deliverables for the CerCo project are available from the project's web pages.

The best document describing my PhD work is my thesis: Type-based amortized stack memory prediction.

A paper covering work in one of the chapters of my thesis was presented at TFP'08.

A paper covering later chapters in my thesis on space bounds with respect to the depth of data structures was presented at ESOP'09.

[1] Brian Campbell. Prediction of linear memory usage for first-order functional programs. In Trends in Functional Programming, volume 9, 2008. To appear. [ bib ]
[2] Brian Campbell. Type-based amortized stack memory prediction. PhD thesis, University of Edinburgh, 2008. [ bib ]
[3] Brian Campbell. Amortised memory analysis using the depth of data structures. In Giuseppe Castagna, editor, Programming Languages and Systems: 18th European Symposium on Programming (ESOP 2009), volume 5502 of Lecture Notes in Computer Science, pages 190-204. Springer-Verlag, 2009. [ bib | DOI ]

Below are some older documents which I have left here in case anyone has looked at them before:

My photographs from the 2005 Marktoberdorf Summer School are online too, plus a small physics demo from our excursion (you will need to rotate your head, because my camera is not smart enough to rotate the video, and I'm too lazy).


Brian.Campbell@ed.ac.uk
Room 5.28, Informatics Forum.

Last modified Thursday, 11-Aug-2011 14:15:23 BST.