Computer Science Proof, Complexity and Verification Seminar Series
The idea for the PCV Seminar Series grew amongst members of our theory group who felt a need for a platform to present our work in the area of Proof Theory, Complexity Theory and Program Verification. It is intended to be a high level research seminar where we can discuss latest ideas and results, as well as address technical issues, and are able to invite speakers from outside.
In the beginning of 2005, this idea turned into the PCV Seminar. Organizers so far have been Markus Michelbrink (see http://www.cs.swan.ac.uk/~csarnold/PCV/index.html for talks organised by him), Will Harwood, Klaus Aehlig, and Monika Seisenberger. From January 2010 on, Fredrik Forsberg and Matthew Gwynne will assist with the organisation of the seminars.
Next Seminar
-
Thursday 16th February 2012, 14:00, Robert Recorde Room
Russell Miller (CUNY)
TBA
Lent and Summer Term 2012
-
Thursday 16th February 2012, 14:00, Robert Recorde Room
Russell Miller (CUNY)
TBA -
Thursday 23rd February 2012, 14:00, Far-134
Uday Reddy (Birmingham)
TBA -
Thursday 1st March 2012, 14:00, Robert Recorde Room
Kathy Gray (Swansea)
TBA -
Thursday 8th March 2012, 14:00, Far-134
Scott Owens (Cambridge)
TBA -
Thursday 22nd March 2012, 14:00, Far-134
TBA (Bath)
Other PCV seminars
-
Lent and Summer Term 2012
-
Michaelmas Term 2011
-
Lent and Summer Term 2011
-
Michaelmas Term 2010
-
Lent and Summer Term 2010
-
Michaelmas Term 2009
-
Lent and Summer Term 2009
-
Michaelmas Term 2008
-
Lent and Summer Term 2008
-
Michaelmas Term 2007
-
Lent and Summer Term 2007
-
Michaelmas Term 2006
-
Lent and Summer Term 2006
