BCTCS2012 British Colloquium for Theoretical Computer Science

Mike Edmunds:
The Antikythera Mechanism and the 
early history of mechanical computing

Reiner Hähnle:
Formal verification of software product families

Phillip James: Domain-specific languages and 
   automatic verification
Richard Barraclough: A unifying theory of 
   control dependence and its application 
   to arbitrary program structures
Patrick Totzke: Weak bisimulation approximants 
   for BP processes

Giles Reger: Quantified event automata: towards 
   expressive and efficient runtime monitors
Andrew Lawrence: Extracting a DPLL Algorithm


David Love: Why Don't Cantor's Sets Compute?

 Nicole Schweikardt
 On the expressive power of logics with 
 invariant uses of arithmetic predicates

Robert Piro: Model-theoretic characterisation of 
   TBoxes and the TBox rewritability Problem

Christopher Thompson-Walsh: Extending a Rule-Based 
   Biological Modelling Language Semantics with 
   Containment

Stanislaw Kikot: The length of query rewriting for 
   OWL 2 QL
Paolo Guagliardo: On the relationship between view 
   updates and logical definability
Chiara Del Vescovo: The modular structure of an ontology: 
   atomic decomposition

Michael Gabbay: A very simple, explicit construction 
   of some models of beta-equality and beta-eta-equality
Tie Hou: Modeling a language of realizers using 
   domain-theoretic semantics
Hugh Steele: Double glueing and MLL full completeness

Daniel Kroening
SAT over an Abstract Domain

Jian Song: 4-coloring H-Free Graphs when H is small

Martin Sticht: A Game-Theoretic Decision Procedure
   for the constructive Description Logic cALC

Jude-Thaddeus Ojiaku: Online makespan scheduling
   of linear deteriorating jobs on parallel machines
Tom Grant:  Maximising lifetime for fault-tolerant
   target coverage in sensor networks
Mihai Burcea: Online multi-dimensional dynamic bin
   packing of unit fraction and power fraction items

Christopher Hampson: Modal Products with the difference 
   operator
Brandon Bennett: An 'almost analytic' sequent calculus
   for first-order S5 with constant domains
Chris Banks: Towards a logic of biochemical processes

 Rod Downey
 Fundamentals of Parametrized Complexity I

Yavor Nenov: Computability of topological logics
   over Euclidean spaces

Evelyn-Denham Coates: Optimum sort algorithms with 
o(N) moves

Martin Adamcik: Collective reasoning under
   uncertainty and inconsistency
Murdoch Gabbay: Game semantics using nominal techniques

Arnoud Pastink: Approximate Nash Equilibria in an 
   uncoupled setup with limited communication

Thomas Gorry: Communication-less agent location discovery

Dirk Sudholt: The analysis of evolutionary algorithms: why 
   evolution is faster with crossover.
Yanti Rusmawati: Dynamic networks as concurrent systems and 
 supervised evolution

 Rod Downey
 Fundamentals of Parametrized Complexity II

Sam Jones: Groups, formal language theory and 
   decidability

Domagoj Vrgoc: Regular expressions for data words
Laurence Day: The silence of the Lambdas
Alistair Stewart: Polynomial time algorithms for 
   multi-type branching processes and stochastic 
   context-free grammars