2003

Functional In-place Update with Layered Datatype Sharing

Michal Konecný LFCS 4pm Tuesday 21st January 2003 Room 2511, JCMB, King's Buildings

Unit Checking: Symbolic Model Checking for a Unit of Code

Doron Peled Department of Computer Science University of Warwick 4pm Thursday 23 January 2003 Room 2509, JCMB, King's Buildings

Query Evaluation on Compressed Trees

Christoph Koch LFCS 4pm Tuesday 28th January 2003 Room 2511, JCMB, King's Buildings

Circuits on Cylinders

Peter Bro Miltersen Department of Computer Science University of Aarhus 4pm Tuesday 4 February 2003 Room 2511, JCMB, King's Buildings

On Generalized Authorization Problems

Stefan Schwoon Department of Computer Science University of Stuttgart 4pm Tuesday 11 February 2003 Room 2511, JCMB, King's Buildings

Deriving bisimulation congruences: A 2 categorical approach

Vladimiro Sassone School of Cognitive and Computing Sciences University of Sussex 4pm Tuesday 18 February 2003 Room 2511, JCMB, King's Buildings

Markov chain methods for studying water and some partial rapid mixing result

Ravi Montenegro Department of Mathematics Georgia Institute of Technology 4pm Tuesday 4 March 2003 Room 2511, JCMB, King's Buildings

Principles of typed XML processing

Haruo Hosoya Research Institute for Mathematical Sciences Kyoto University 4pm Tuesday 11 March 2003 Room 2511, JCMB, King's Buildings

Proving Pointer Programs in Higher-Order Logic

Tobias Nipkow Department of Computer Science Technical University of Munich 4pm Thursday 13 March 2003 Room 2511, JCMB, King's Buildings

Fast Mu-calculus Model Checking when Tree-width is Bounded

Jan Obdrzalek LFCS 4pm Tuesday 25 January 2003 Room 2511, JCMB, King's Buildings

PAL+: a lambda-free logical framework

Zhaohui Luo Department of Computer Science University of Durham 4pm Tuesday 8 April 2003 Room 2511, JCMB, King's Buildings

X# Overview: Unifying the Object-Oriented, Relational and Hierarchical Data Models

Erik Meijer Microsoft Research 2pm Friday 11 April 2003 Room 2511, JCMB, King's Buildings

The complexity of constraint satisfaction: an algebraic approach

Andrei Bulatov Computing Laboratory Oxford University 4pm Tuesday 15 April 2003 Room 2511, JCMB, King's Buildings

A Type-Safe Dialect of C

Greg Morrisett Department of Computer Science Cornell University 4pm Tuesday 29 April 2003 Room 2511, JCMB, King's Buildings

Approximate Counting by Dynamic Programming

Martin Dyer School of Computing University of Leeds 4pm Tuesday 27 May 2003 Room 2511, JCMB, King's Buildings

Higher order beta matching

Ralph Loader 4pm Thursday 5 June 2003 Room 2511, JCMB, King's Buildings

Game Semantics and its applications to Program Verification

Luke Ong Computing Laboratory Oxford University 2.30pm Tuesday 10 June 2003 Room 2511, JCMB, King's Buildings

XML Queries and Constraints, Containment and Reformulation

Val Tannen Department of Computer and Information Science University of Pennsylvania 4pm Tuesday 8 Juli 2003 Room 3218, JCMB, King's Buildings

Equational Proofs in CafeOBJ

Kokichi Futatsugi Japan Advanced Institute of Science and Technology 3pm Monday 4 August 2003 Room 2511, JCMB, King's Buildings

Harmony: A synchronization framework for tree-structured data

Benjamin Pierce Department of Computer and Information Science University of Pennsylvania 2pm Friday 22 August 2003 Room 2511, JCMB, King's Buildings

Constructing Parametric Models of Polymorphism on Domains

Giuseppe Rosolini Department of Computer and Information Science Università di Genova 4pm 2 September 2003 Room 2511, JCMB, King's Buildings

The Secrecy of Database Queries

Dan Suciu Department of Computer Science & Engineering University of Washington 11am 3 September 2003 Room 2511, JCMB, King's Buildings

Admissible Representations in Type-2 Theory of Effectivity

Matthias Schroeder Department of Computer Science University of Hagen (FernUniversität in Hagen) 4pm 16 September 2003 Room 2511, JCMB, King's Buildings

Configuration Theories: Concurrency in Sequent Form

Pietro Cenciarelli Department of Computer Science University of Rome "La Sapienza" 2pm 19 September 2003 Room 2511, JCMB, King's Buildings

Topology of data types and computability concepts

Martin Escardo School of Computer Science University of Birmingham 4pm 14 October 2003 Room 2511, JCMB, King's Buildings

Databases with interpreted data: numbers, strings, documents (or: back and forth between finite and infinite models)

Leonid Libkin Department of Computer Science University of Toronto 4pm 21 October 2003 Room 2511, JCMB, King's Buildings

Measuring Uncertainty with Stochastic Probes

Jeremy Bradley Department of Computing Imperial College London 4pm 28 October 2003 Room 2511, JCMB, King's Buildings

Algorithms for Student-Project Allocation

David Manlove Department of Computing Science University of Glasgow 4pm 4 November 2003 Room 2511, JCMB, King's Buildings

Kripke semantics for the lambda calculus

Steve Awodey Department of Philosophy Carnegie-Mellon University 4pm 11 November 2003 Room 2511, JCMB, King's Buildings

On Relativisation and Complexity gap for Resolution-based proof systems

Stefan Dantchev Department of Mathematics & Computer Science University of Leicester 4pm 25 November 2003 Room 2511, JCMB, King's Buildings

A typed calculus of traits

John Reppy Department of Computer Science University of Chicago 2pm 28 November 2003 Room 2511, JCMB, King's Buildings

Web Graphs and Web Algorithms

Colin Cooper Department of Computer Science King's College, London 4pm 2 December 2003 Room 2511, JCMB, King's Buildings