Personal tools
You are here: Home Events Abstract Archives 2006-2007

2006-2007

Page Algorithmic Meta-theorems
Martin Grohe Humboldt-Universität zu Berlin 4pm Tuesday 28th August 2007 Room 2511, JCMB, King's Buildings
Page Towards a formal language for writing electronic contracts
Gerardo Schneider Department of Informatics, University of Oslo 4pm Tuesday 17th July 2007 Room 2511, JCMB, King's Buildings
Page From Nand to Tetris in 12 Steps
Shimon Schocken IDC Herzliya 4pm Tuesday 3rd July 2007 Room 2511, JCMB, King's Buildings
Page Semantical proofs of totality for sequential, real number computation
Thomas Anberrée University of Birmingham 4pm Tuesday 26th June 2007 Room 2511, JCMB, King's Buildings
Page Concurrent Processes for Software Analysis and Design
Gian Luca Cattani 4pm Monday 25th June 2007 Room 2511, JCMB, King's Buildings Note nonstandard day
Page Resourceful Lenses for Ordered Data
Benjamin Pierce University of Pennsylvania 2pm Friday 15th June 2007 Room 2511, JCMB, King's Buildings Note nonstandard day and time
Page Realizability vs. Forcing
Thomas Streicher TU Darmstadt 4pm Tuesday 5th June 2007 Room 2511, JCMB, King's Building
Page Inductions in the Nominal Datatype Package (or, How Not to be Intimidated by the Variable Convention)
Christian Urban TU Munich 4pm Tuesday 29th May 2007 Room 2511, JCMB, King's Buildings
Page Bishop's Constructive Mathematics today
Douglas Bridges University of Canterbury, Christchurch, New Zealand 4pm Wednesday 23rd May 2007 Room 2509, JCMB, King's Buildings Note nonstandard day and room
Page On the complexity of approximating exact Fixed Points: Nash Equilibria, Stochastic Games, and Recursive Markov Chains
Kousha Etassami LFCS 4pm Tuesday 1st May 2007 Room 2511, JCMB, King's Buildings
Page Managing Policy Updates in Security-typed Languages
Nikhil Swamy University of Maryland, MD, USA 11am Thursday 19th April 2007 Room 2509, JCMB, King's Buildings N.B. nonstandard day, time and room
Page Silent Steps in Markov Chains
Nikola Trcka Eindhoven University of Technology 4pm Monday 19th May 2007 Room 2511, JCMB, King's Buildings
Page Immune system computation and antigen-chip technology
Irun R. Cohen Department of Immunology Weizmann Institute 4pm Tuesday 20th Feb 2007 Room 2511, JCMB, King's Buildings
Page Policy-Informed Program Analyses
Kathi Fisler and Shriram Krishnamurthi WPI and Brown University 4pm Tuesday 14th November 2006 Room 2511, JCMB, King's Buildings
Page The Cost of Punctuality
Joel Ouaknine Oxford University 4pm Tuesday 24th October 2006 Room 2511, JCMB, King's Buildings
Page Sequent Calculus Proof Systems for Inductive Definitions (Ph.D. completion seminar)
James Brotherston University of Edinburgh 4pm Tuesday 17th October 2006 Room 2511, JCMB, King's Buildings
Page Satan's Computer, Revisited
Ross Anderson Cambridge University 4pm Tuesday 26th September 2006 Room 2511, JCMB, King's Buildings
Page Fast exhaustive search over infinite search spaces.
Martin Escardo University of Birmingham 4pm Tuesday 5th September 2006 Room 2511, JCMB, King's Buildings
Page Oblivious Network Design
Anupam Gupta Carnegie Mellon University 4pm Tuesday 11th July 2006 Room 2511, JCMB, King's Buildings
Page Runtime Reflection: An approach for the model-based runtime analysis of distributed reactive systems
Andreas Bauer Technische Universitat-Munich 4pm Monday 5th June 2006 Room 2511, JCMB, King's Buildings
Page Average time games
Marcin Jurdzinski University of Warwick 4pm Tuesday 2nd May 2006 Room 2511, JCMB, King's Buildings
Page Approximating the Tutte polynomial: a status report
Mark Jerrum University of Edinburgh 4pm Tuesday 25th April 2006 Room 2511, JCMB, King's Buildings
Page Safraless Compositional Synthesis
Moshe Y. Vardi Rice University 4pm Tuesday 18th April 2006 Room 2511, JCMB, King's Buildings
Page The Weird World of Bi-Directional Programming
Benjamin C. Pierce Microsoft Research (on leave from University of Pennsylvania) 4pm Monday, 17th April 2006 Room 2511, JCMB, King's Buildings
Page Automatically proving the termination of C programs
Byron Cook Microsoft Research, Cambridge 4pm Tuesday, March 21st 2006 Room 2511, JCMB, King's Buildings
Page Complexity of computations with definable sets.
Nicolai Vorobjov University of Bath 4pm Tuesday 14th March 2006 Room 2511, JCMB, King's Buildings
Page Models for Incomplete and Probabilistic Information
Val Tannen University of Pennsylvania 4pm Wednesday, 8th March 2006 Room 202, Appleton Tower, King's Buildings
Page Disjoint NP-Pairs
Alan Selman State University of New York--Buffalo 4pm Tuesday 7th March 2006 Room 2511, JCMB, King's Buildings
Page The finite model theory of random 3-CNF formulas
Albert Atserias Universitat Politecnica de Catalunya 4pm Tuesday 14th February 2006 Room 2511, JCMB, King's Buildings
Page Exploration games for UML software design
Jennifer Tenzer LFCS, School of Informatics, U. of Edinburgh 4pm Tuesday 31st January 2006 Room 2511, JCMB, King's Buildings
Document Actions