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.
20122013

Thursday 8th November 2012, 14:00, Far134 (Video Conferencing Room)
Guy McCusker (University of Bath)
Quantitative relational models of lambdacalculi

Thursday 15th November 2012, 14:00, Far134 (Video Conferencing Room)
Helen Treharne (University of Surrey)
The Behavioural Semantics of EventB Refinement

Thursday 22nd November 2012, 14:00, Board Room
Karim Kanso (Swansea University)
Agda as a Platform for the Development of Verified Railway Interlocking Systems

Friday 30th November 2012, 15:00, Robert Recorde Room
John Tucker (Swansea University)
What can we compute? A history of the ChurchTuring Hypothesis

Thursday 6th December 2012, 14:00, Far134 (Video Conferencing Room)
David Wilson (University of Bath)
Real Geometry and Connectedness  A survey of Cylindrical Algebraic Decomposition

Thursday 13th December 2012, 14:00, Board Room
Tom Maibaum (McMaster University)
Intermodeling, queries, and Kleisli categories

Thursday 24th January 2013, 14:0018:00, Robert Recorde Room
Wessex Theory Seminar at Swansea

Thursday 7th February 2013, 14:00, Robert Recorde Room
Norbert Preining (JAIST, Japan)
Gödel Logics, Order Theory, (Continuous) Fraïssé Conjecture

Wednesday 13th February 2013, 15:00, 504 (Realisability Seminar)
Fredrik Nordvall Forsberg (Swansea University)
My Summer in Munich: Realworld Program Extraction into Haskell programs

Thursday 21st February 2013, 14:00, Far134 (video conferencing room)
Anton Setzer (Swansea University)
Coinduction, Corecursion, Copatterns

Tuesday 5th March 2013, 14:00, Robert Recorde Room
Dieter Spreen (Universitaet Siegen)
Information Frames

Thursday 7th March 2013, 14:00, Robert Recorde Room
Gregory Woods (Swansea University)
A Case Study on Imperative Program Extraction

Thursday 14th March 2013, 14:00, Robert Recorde Room
Matthew Gwynne (Swansea University)
Towards a theory of good SAT representations

Thursday 21st March 2013, 14:00, Robert Recorde Room
Casper Poulsen (Swansea University)
Partial Derivation in Modular Structural Operational Semantics

Monday 29th April 2013, 14:00, Far134 (video conferencing room)
Neil Ghani (University of Strathclyde)
Fibrational Parametricity

Thursday 2nd May 2013, 14:00, Robert Recorde Room
Paolo Torrini (Swansea University)
Parametric polymorphism with references

Thursday 20th June 2013, 14:00, Robert Recorde Room
Margarita Korovina (A.P. Ershov Institute of Informatics Systems)
Synthesis and verification of definable dynamics

Thursday 4th July 2013, 14:00, Robert Recorde Room
Stanislav Speranski (Novosibirsk)
Quantified probability logics: expressibility vs. computability

Thursday 11th July 2013, 14:00, Far134 (video conferencing room)
Pasquale Malacaria (Queen Mary, University of London)
The Thermodynamics of Confidentiality

Thursday 18th July 2013, 14:00, Robert Recorde Room
Oleg Kudinov and Vladislav Amstislavskiy (Novosibirsk)
On the structures of continuous and smooth functions, and some ideas on decidability of elementary theories

Wednesday 24th July 2013, 14:00, Robert Recorde Room
Victor Selivanov (A. P. Ershov Institute of Informatics Systems of Siberian Division of Russian Academy of Sciences)
Descriptive Set Theory and Computation Theory