Concurrency, Verification & Security Seminars

View all seminar series

forthcoming seminars | previous seminars

Wednesday 2nd December (week 8, Michaelmas Term 2009). 11:30, Room 441, Oxford University Computing Laboratory Abstraction-guided Synthesis of Synchronization Greta Yorsh (IBM T.J. Watson Research Center)

Wednesday 11th November (week 5, Michaelmas Term 2009). 11:30, Room 478, Oxford University Computing Laboratory Boom: Model Checking for Asynchronous Boolean Programs Gerard Basler

Wednesday 4th November (week 4, Michaelmas Term 2009). 11:30, Room 441, Oxford University Computing Laboratory Faster FDR Counterexample Generation Using SAT-Solving Hristina Palikareva (Oxford University Computing Laboratory)

Wednesday 28th October (week 3, Michaelmas Term 2009). 11:30, Room 441, Oxford University Computing Laboratory Breaking and fixing Simpson's 4 slot algorithm Bill Roscoe (Oxford University Computing Laboratory)

Wednesday 21st October (week 2, Michaelmas Term 2009). 11:30, Room 441, Oxford University Computing Laboratory Reachability in Games over Probabilistic Pushdown Automata Václav Brožek (LFCS, School of Informatics, University of Edinburgh)

Wednesday 14th October (week 1, Michaelmas Term 2009). 11:30, Room 441, Oxford University Computing Laboratory Testing Probabilistic Equivalence through Reinforcement Learning François Laviolette (Département d'informatique, Université Laval (http://www.ift.ulaval.ca/))

Friday 10th July (week , Trinity Term 2009). 11:30, Fox Room, Oxford University Computing Laboratory Usability and Security of Out-Of-Band Channels in Secure Device Pairing Protocols Ronald Kainda (Oxford University Computing Laboratory)

Friday 3rd July (week -, Trinity Term 2009). 11:30, Room 478, Oxford University Computing Laboratory Ground Interpolation for the Theory of Equality Cesare Tinelli (University of Iowa)

Wednesday 17th June (week 8, Trinity Term 2009). 11:30, Room 478, Oxford University Computing Laboratory On the Reachability Analysis of Acyclic Networks of Pushdown Systems Tayssir Touili (Laboratoire d'Informatique Algorithmique, Universite Paris Diderot)

Wednesday 10th June (week 7, Trinity Term 2009). 11:30, Room 478, Oxford University Computing Laboratory Compositional Abstraction of Stochastic Process Algebra Models Michael Smith (Edinburgh University)

Wednesday 3rd June (week 6, Trinity Term 2009). 12:00, Rom 478, Oxford University Computing Laboratory Time-Bounded Verification Joel Ouaknine (Oxford University Computing Laboratory)

Wednesday 13th May (week 3, Trinity Term 2009). 11:30, Room 478, Oxford University Computing Laboratory Unifying Theories of Programming and Testing Bernhard Aichernig (TU Graz)

known 29th April (week 1, Trinity Term 2009). 11:30, Room 478, Oxford University Computing Laboratory Space-Efficient Scheduling of Stochastically Generated Tasks Stefan Kiefer (Technische Universität München)

Friday 20th March (week 9, Hilary Term 2009). 15:00, Room 441 Causality and Formal Verification Hana Chockler (IBM Research)

Wednesday 11th March (week 8, Hilary Term 2009). 11:30, Lecture Theatre A, Oxford University Computing Laboratory Extending and compressing SVA Bill Roscoe (Oxford University Computing Laboratory)

Wednesday 4th March (week 7, Hilary Term 2009). 11:30, Room 441, Oxford University Computing Laboratory On reachability in succinct and parameterised one-counter automata Christoph Haase (Oxford University Computing Laboratory)

Wednesday 25th February (week 6, Hilary Term 2009). 11:30, Room 441, Oxford University Computing Laboratory Symmetry reduction with inter-component references Alastair F. Donaldson (Codeplay Software Ltd.)

Wednesday 18th February (week 5, Hilary Term 2009). 12:00, Room 441, Oxford University Computing Laboratory Decidability of Parameterised Model-Checking Mat Hague (Oxford University Computing Laboratory)

Wednesday 11th February (week 4, Hilary Term 2009). 11:30, Room 441, Oxford University Computing Laboratory Ensuring Consent and Revocation: Towards a Taxonomy of Consent Nick Papanikolaou (University of Warwick)

Wednesday 3rd December (week 8, Michaelmas Term 2008). 11:30, Room 441 Oxford University Computing Laboratory SAT-Solving and Software Bounded Model Checking: Trends and Applications Carsten Sinz (University of Karlsruhe)

Wednesday 26th November (week 7, Michaelmas Term 2008). 11:30, Room 441, Oxford University Computing Laboratory The Continuous π-Calculus: A Process Algebra for Biochemical Modelling Ian Stark (University of Edinburgh)

Wednesday 12th November (week 5, Michaelmas Term 2008). 11:30, Room 441, Oxford University Computing Laboratory Formal Specification and Analysis of Real-Time Systems in Real-Time Maude Peter Olveczky (University of Oslo)

Wednesday 5th November (week 4, Michaelmas Term 2008). 11:30, Room 441, Oxford University Computing Laboratory Proving that non-blocking algorithms don't block Alexey Gotsman (University of Cambridge)

Tuesday 4th November (week 4, Michaelmas Term 2008). 13:05, Room 478, Oxford University Computing Laboratory Well structured transtition systems everywhere and everytime! Prof Alain Finkel (ENS Cachan)

Wednesday 29th October (week 3, Michaelmas Term 2008). 11:30, Room 441, Oxford University Computing Laboratory Decidable Continuous Time Temporal Logic Alex Rabinovich (Tel Aviv University, School of Computer Science)

Wednesday 22nd October (week 2, Michaelmas Term 2008). 11:30, Room 441, Oxford University Computing Laboratory Hintikka Games for PCTL on Labeled Markov Chains Michael Huth (Imperial College, London)

Wednesday 15th October (week 1, Michaelmas Term 2008). 11:30, Room 441 Oxford University Computing Laboratory A CSP Model for Mobile Channels Peter Welch (University of Kent)

Wednesday 24th September (week -2, Michaelmas Term 2008). 11:30, Room 051, Oxford University Computing Laboratory On Refinement-Closed Security Properties and Nondeterministic Compositions Toby Murray (Oxford University Computing Laboratory)

Wednesday 10th September (week , Michaelmas Term 2008). 11:30, Fox Room From CSP to the pi calculus and back Bill Roscoe (Oxford University Computing Laboratory)

Wednesday 18th June (week , Trinity Term 2008). 11:30, Fox Room, Oxford University Computing Laboratory Discussion of an international initiative in Verified Software Tony Hoare (Microsoft Research, Cambridge)

Thursday 12th June (week 8, Trinity Term 2008). 14:00, Room 051, Oxford University Computing Laboratory Proofs and refutations for probabilistic refinement Annabelle McIver (Macquarie University, Australia)

Wednesday 4th June (week 7, Trinity Term 2008). 11:30, Room 051, Oxford University Computing Laboratory CSP with tests for availability of events (work in progress) Gavin Lowe (Oxford University)

Wednesday 28th May (week 6, Trinity Term 2008). 11:30, Room 051, Oxford University Computing Laboratory TBA James Worrell (Oxford University Computing Laboratory)

Wednesday 21st May (week 5, Trinity Term 2008). 11:30, Room 051, Oxford University Computing Laboratory Implementations of some empirical security protocols Bill Roscoe (Oxford University)

Wednesday 14th May (week 4, Trinity Term 2008). 11:30, Room 051, Oxford University Computing Laboratory Multi-channel Security Protocols Ford Long Wong (Cambridge University Computer Laboratory)

Wednesday 7th May (week 3, Trinity Term 2008). 11:30, Room 051, Oxford University Computing Laboratory Analysing Object-Capability Security Toby Murray (Oxford University)

Wednesday 30th April (week 2, Trinity Term 2008). 11:30, Room 051, Oxford University Computing Laboratory A Process Algebra for Hybrid Systems Vashti Galpin (School of Informatics, University of Edinburgh)

Wednesday 5th March (week 8, Hilary Term 2008). 11:30, Oxford University Computing Laboratory, Room 051 Secure Channels and Proxies Chris Dilloway (OUCL)

Wednesday 27th February (week 7, Hilary Term 2008). 11:30, Oxford University Computing Laboratory, Room 347 TBA Rhys Newman

Monday 20th February (week 6, Hilary Term 2008). 11:30, Oxford University Computing Laboratory, Room 347 A quantum fair contract signing protocol Paulo Mateus

Wednesday 13th February (week 5, Hilary Term 2008). 11:30, Oxford University Computing Laboratory, Room 347 Completing CSP Bill Roscoe (OUCL)

Wednesday 6th February (week 4, Hilary Term 2008). 11:30, Oxford University Computing Laboratory, Room 347 Secure Data Flow in a Calculus for Context Awareness Doina Bukur

Wednesday 30th January (week 3, Hilary Term 2008). 11:30, Oxford University Computing Laboratory, Room 347 Near Field Communication and Security in Pervasive and Social Networks Dusko Pavlovic (Kestrel Institute / OUCL Visiting Academic)

Wednesday 24th October (week 3, Michaelmas Term 2007). 11:30, Oxford University Computing Laboratory, Room 347 Probabilistic Model Checking and Abstraction

Wednesday 17th October (week 2, Michaelmas Term 2007). 11:30, Oxford University Computing Laboratory, Room 347 Acceleration in Data-Flow Analysis Jérôme Leroux

Wednesday 10th October (week 1, Michaelmas Term 2007). 11:30, Oxford University Computing Laboratory, Room 347 APEX Joel Ouaknine (OUCL)

known  (week , Hilary Term 2009). 11:30, TBA TBA Nick Moffat (QinetiQ)

Wednesday  (week , Trinity Term 2008). 11:30, Room 051, Oxford University Computing Laboratory New search strategies for CSP refinement in FDR Philip Armstrong (Oxford University)