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 here for talks organised by him), Will Harwood, Klaus Aehlig, and Monika Seisenberger. From January 2010 on, Fredrik Nordvall Forsberg and Matthew Gwynne organise the seminar.
The list of talks is also available as a RSS feed and as a calendar file.
Thursday 16th October 2014, 12:00, Robert Recorde Room
Bashar Igried (Swansea University)
Modelling and Verification of RBC Handover Using CSP
Tuesday 28th October 2014, 15:00, Video Conferencing Room
Ross Duncan (University of Strathclyde)
Quantum Computation in (almost) any Category: an Introduction to the ZX-calculus
Thursday 4th December 2014, 12:00, Board Room
Thomas Powell (University of Innsrbuck)
The complexity of term rewrite systems
Thursday 4th December 2014, 16:00, Board Room
Georg Moser (University of Innsbruck)
Amortised Resource Analysis and Typed Polynomial Interpretations
Thursday 11th December 2014, 16:00, Video Conferencing Room
Ekaterina Komendantskaya (University of Dundee)
Automated theorem proving, structurally.
Thursday 22nd January 2015, 15:00, Board Room
Graham Hutton (University of Nottingham)
Calculating Correct Compilers
Friday 13th March 2015, 15:00, Board Room
Nicola Gambino (University of Leeds)
An introduction to Univalent Foundations of Mathematics
Thursday 26th March 2015, 14:00, Robert Recorde Room
Samuel Buss (University of California)
Complexity of propositional proofs: some theory and examples.