-
- Verifying implementations of security protocols in C | Mihhail Aizatulin and François Dupressoir, The Open University
- Indoor localisation using broadband ultrasound | Mohammed Al-Loulah, University of Lancaster
- On compositional image alignment | Brian Amberg, Universität Basel
- On the misuses of real world large scale distributed systems | Elias Athanasopoulos, Foundation for Research and Technology – Hellas (FORTH)
- Systems biology of antigen processing: From structures to mechanisms | Alistair Bailey, University of Southampton
- Modelling integrated signalling networks in stomatal guard cells | Mariano Beguerisse Díaz, Imperial College London
- Parallelizing non-parametric Bayesian learning | Sebastien Bratieres, University of Cambridge
- Spatial modelling of tropical rainforest ecology | Calum Brown, University of St Andrews
- Testing current understanding of Amazon phenology using a Monte Carlo Markov chain algorithm | Silvia Caldararu, University of Edinburgh
- Mamba – Exploring many-core architectures | Gregory Chadwick, University of Cambridge
- Bayesian inference for efficient learning in control | Marc Deisenroth, University of Cambridge
- Automatic abstraction for complex partial designs | Rayna Dimitrova, Saarland University
- Language-model-based ranking in RDF corpora | Shady Elbassuoni, Max Planck Institute for Software Systems
- Binary clone detection | Christopher Gautier, University of Cambridge
-
- Improving the performance of atomic sections | Khilan Gudka, Imperial College London
- Highly scalable platform for data streaming | Vincenzo Gulisano, Universidad Politécnica de Madrid
- Integrative analysis of genomic variants in carcinogenesis | Syed Haider, University of Cambridge
- On performance volatility in information retrieval | Mehdi Hosseini, University College London
- Automated extraction of concept features and relations | Colin Kelly, University of Cambridge
- Transportation systems: Modelling in real-time | Usman Khan and Andrew Rice, University of Cambridge
- Privacy-preserving personalized services in networks | Hyounggshick Kim, University of Cambridge
- Verification of state based access control | Masoud Koleini, University of Birmingham
- Predicting long-term forest dynamics at regional scales | Emily Lines, University of Cambridge
- A geometric approach to chip firing games | Madhusudan Manjunath, Max Planck Institute
- Simulator for hardware acceleration of STM | Nikola Markovic, BSC-Microsoft Research Centre
- Transactification of real world system libraries | Nebojša Miletic and Vesna Smiljkovic, BSC-Microsoft Research Centre
- Trends in code | Yana Mileva, Saarland University
- Reverse engineering dinosaurs | Zartasha Mustansar, University of Manchester
- Properties as types for inductively defined mathematical structures | Vilius Naudziunas, University of Cambridge
- Supporting effective user navigation in digital documents | Jennifer Pearson, Swansea University
-
- Compiler support to improve work stealing scalability | Milos Puzovic, University of Cambridge
- Energy-efficient scheduling | Charlie Reams, University of Cambridge
- Optimal design of performance measurement experiments for complex, large-scale networks | Charalampos Rotsos, University of Cambridge
- Analysis of piecewise linear feedback systems | Adrian Salinas Varela, University of Cambridge
- Spatial and temporal analysis of collective and individual human mobility | Salvatore Scellato, University of Cambridge
- Low energy server systems | Simon Schubert, École Polytechnique Fédérale de Lausanne (ÉPFL)
- Burden of proof | Nik Sultana, University of Cambridge
- Temporal distance metrics for social network analysis | John Tang, University of Cambridge
- The large and small of it: Quantifying size structure in ecological networks | Aaron Thierry, University of Sheffield
- High level image editing and uncertainty in images | Eno Töppe, University of Bonn
- Reasoning about concurrency: Interference requires permission | Aaron Turon, Northeastern University
- Fault tolerance using live execution replay in virtual machines | Bharath Venkatakrishnan, University of Cambridge
- The formal verification of concurrent programs | John Wickerson, University of Cambridge
- Leveraging transaction memory hardware design for speculative multithreading | Gulay Yalcin, BSC-Microsoft Research Centre
- Verifying the flash device drive | Yichi Zhang, University of Cambridge
-
Posters should be designed for A1 portrait (594 mm x 841 mm) colour printing (either PowerPoint or PDF) and articulate clearly and concisely either visually or textually:
- What challenge is being addressed or question being answered by the research in such a way that a non-expert can understand the importance of the research.
- What the research is.
- What the intended outcome is.
- What stage it is at.
- Any research results, preliminary conclusions, or any potentially exciting or interesting next steps are.
Posters should be aimed at other students and researchers who do not necessarily have expertise in that specific area of research.
Posters should also clearly display your name and the name of your university.
You can find example of posters on the page of the 2008 Summer School.