Programme
Tuesday 6 April
Registration - Atrium | ||
| Chair: Julian Bradfield Kim Larsen Aalborg Universitet, Denmark Verifying LEGO: Validation and Synthesis of Embedded Software | ||
Reception in INSPACE | ||
| Dinner in Pollock Halls |
Wednesday 7 April
| Registration - Atrium | |||
| Announcements - G.07 | |||
| Chair: Mary Cryan Gil Kalai Hebrew University of Jerusalem, Israel Analysis and Probability of Boolean Functions | |||
| Chair: Mary Cryan | Chair: Julian Bradfield | ||
| 10:00 G.07 | Oded Lachish University of Warwick Property Testing |
10:00 G.03 | Wei Chen University of Nottingham From Seven-trees-in-one to Cyclotomics |
Coffee break | |||
| Chair: Iain Stewart | Chair: Stephan Reiff-Marganiec | ||
| 10:50 G.07 | Benjamin Sach University of Bristol Pattern matching algorithms for streaming data |
10:50 G.03 | Vashti Galpin University of Edinburgh Bisimulations for biology |
| 11:15 G.07 | Alexandru Popa University of Bristol Permuted Common Supersequence |
11:15 G.03 | Djihed Afifi University of Manchester Using Automated Reasoning Tools in the Simulation of Evolvable System |
| 11:40 G.07 | Supaporn Chairungsee King's College London Efficient computation of minimal absent words |
11:40 G.03 | Richard Dobson King's College London Low Energy Scheduling with Non-Uniform Multiprocessor Systems |
| 12:05 G.07 | Denham Evelyn Logic Code Generator Ltd An in-place optimal k-way merge-sort with O(N) data moves |
12:05 G.03 | Martin Birks University of Leicester Temperature Aware Online Scheduling with a Low Cooling Factor |
Lunch - Atrium/MF2/Roof Garden | |||
| Chair: Faron Moller Catuscia Palamidessi INRIA-Saclay and École Polytechnique, France Information-Theoretic approaches to Information Flow | |||
| Chair: Faron Moller | Chair: Julian Bradfield | ||
| 14:30 G.07 | Michael Banks University of York Multi-User Systems in the Unifying Theories of Programming |
14:30 G.03 | Andrew Collins University of Liverpool Asynchronous rendezvous with local information |
Coffee break | |||
| Chair: Julian Gutierrez | Chair: Kousha Etessami | ||
| 15:20 G.07 | Phillip James Swansea University Verification of train control systems: Reducing the complexity |
15:20 G.03 | Anna Adamaszek DIMAP, Warwick University Large-girth roots of graphs |
| 15:45 G.07 | Karim Kanso Swansea University Model Checking from a Type Theory Platform |
15:45 G.03 | Daniel Paulusma Durham University The k-in-a-path problem for claw-free graphs |
| 16:10 G.07 | Andy Lawrence Swansea University Verification of Railway Interlockings in SCADE |
16:10 G.03 | Pim van 't Hof Durham University On graph contractions and induced minors |
| 16:35 G.07 | Troels Bjerre Sørensen University of Warwick Approximability and Parametrized Complexity of Min--Max Values |
16:35 G.03 | Thomas Nickson University of Liverpool Geometric Computations on Regular Tilings by a Graph Dynamical System |
| Visit local hostelries | |||
| Dinner in Pollock Halls | |||
Thursday 8 April
| Chair: Achim Jung Uli Sattler University of Manchester Automated Reasoning for Ontology Engineering | |||
| Chair: Achim Jung | Chair: Kousha Etessami | ||
| 10:00 G.07 | DelhiBabu Radhakrishnan Anna University Updating Logical Database |
10:00 G.03 | Konrad Dabrowski University of Warwick Parameterized complexity and the independent set problem. |
Coffee break | |||
| Chair: Páidí Creed | Chair: Bahareh Afshari | ||
| 10:50 G.07 | Mark Jerrum Queen Mary, University of London Approximating the Tutte polynomial: another status report |
10:50 G.03 | Christopher Broadbent Oxford University Some results concerning first-order logic and collapsible pushdown graphs. |
| 11:15 G.07 | Charilaos Efthymiou University of Warwick Deterministic counting of graph colourings using sequences of subgraphs |
11:15 G.03 | Anthony Widjaja To University of Edinburgh Parikh Images of Regular Languages: Complexity and Applications |
| 11:40 G.07 | Prasad Chebolu University of Liverpool The Complexity of Approximately Counting Stable Matchings |
11:40 G.03 | Christopher Poskitt The University of York Towards a Hoare Calculus for Graph Programs |
| 12:05 G.07 | John Faben QMUL H-colourings in modular counting classes |
12:05 G.03 | Lorenzo Clemente LFCS @ Edinburgh University Multipebble Simulation Preorders for Alternating Büchi Automata |
Lunch - Atrium/MF2/Roof Garden | |||
| Chair: Mark Jerrum Erik Demaine Massachusetts Institute of Technology, U.S.A. Algorithms Meet Art, Puzzles, and Magic | |||
| Chair: Mark Jerrum | |||
| 14:30 G.07 | Rick Thomas University of Leicester Word problems of groups and complexity classes |
14:30 G.03 | |
Coffee break | |||
| Chair: Rick Thomas | Chair: Graham Hutton | ||
| 15:20 G.07 | Iain Stewart Durham University A general algorithm for detecting faults under the comparison diagnosis model |
15:20 G.03 | Iain Lane University of Nottingham Presheaf models of local state |
| 15:45 G.07 | Stephan Reiff-Marganiec University of Leicester Selecting the Right Service at the Right Time |
15:45 G.03 | Christian Kissig University of Leicester Trace Semantics of Coalgebras |
| 16:10 G.07 | David Manlove University of Glasgow Optimising paired and pooled kidney exchanges |
16:10 G.03 | Fredrik Nordvall Forsberg Swansea University Inductive-inductive definitions |
| 16:35 G.07 | Oliver Kullmann Computer Science, Swansea University Green-Tao numbers and SAT |
16:35 G.03 | Liam O'Reilly Swansea University Compositional Based Reasoning in CSP-CASL |
| End of talks | |||
AGM of the BCTCS David Hume Tower, Faculty Room North | |||
Colloquium Dinner Howie's, Waterloo Place | |||
Friday 9 April
| Chair: David Manlove Johan Håstad Kungliga Tekniska Högskolan, Sweden Approximation Resistance | |||
| Chair: David Manlove | Chair: Vashti Galpin | ||
| 10:30 G.07 | Rafiq Saleh University of Liverpool On descriptional complexity of knot properties |
10:30 G.03 | Ashley Montanaro University of Bristol Quantum search with advice |
Coffee break | |||
| Chair: Troels Sørensen | Chair: András Salamon | ||
| 11:20 G.07 | Markus Jalsenius University of Bristol Flood-It: The Colourful Game of Board Domination |
11:20 G.03 | Golnaz Badkobeh King's College London An infinite Binary word containting only three distinct squares |
| 11:45 G.07 | Antony McCabe University of Liverpool Examining Frugality in Simple Procurement Auctions |
11:45 G.03 | German Tischler King's College London Linear Time Computation of Longest Previous non-overlapping Factors |
| 12:10 G.07 | Neelam Gohar University of Liverpool, UK Tactical and Manipulative dynamics |
12:10 G.03 | Páidí Creed Royal Holloway, University of London A Galois connection for Valued Constraint Satisfaction |
| 12:35 G.07 | Carmine Ventre University of Liverpool Ranking Games that have Competitiveness-based Strategies |
12:35 G.03 | Raphael Clifford University of Bristol From coding theory to efficient pattern matching |
Lunch - Atrium/MF2/Roof Garden - end of BCTCS | |||