Colloquia and Seminars

Computing Science - Colloquia and Seminars

Sanitization for sequential data

Location: CLT 7.01 Date/Time: 30th August 2016, 14:00 - 15:00
Speaker(s): Dr Grigorios Loukides.

Brief Description:

Organizations disseminate sequential data to support applications in domains ranging from marketing to healthcare. Such data are typically modeled as a collection of sequences, or a series of time-stamped events, and they are mined by data recipients aiming to discover actionable knowledge. However, the mining of sequential data may expose sensitive patterns that leak confidential knowledge, or lead to intrusive inferences about groups of individuals. In this talk, I will review the problem and present two approaches that prevent it, while retaining the usefulness of data in mining tasks.


Automatically Comparing Memory Consistency Models

Location: CLT 7.01. Date/Time: 31st August 2016, 14:00 - 15:00
Speaker(s): Dr Wickerson.

Brief Description:A memory consistency model (MCM) is the part of a programming language or computer architecture specification that defines which values can legally be read when a thread in a concurrent program reads from a shared memory location. Because MCMs have to take into account various optimisations employed by modern architectures (such as store buffering and instruction reordering) and compilers (such as constant propagation), they often end up being complex and counterintuitive, which makes them challenging to design and to understand.

Automatically Comparing Memory Consistency Models

Location: CLT 7.01 Date/Time: 31st August 2016, 14:00 - 15:00
Speaker(s): Dr. Wickerson.

Brief Description:In this work, we identify four important tasks involved in designing and understanding MCMs: generating conformance tests, distinguishing two MCMs, checking compiler optimisations, and checking compiler mappings. We show that all four tasks can be cast as instances of a general constraint-satisfaction problem to which the solution is either a program or a pair of programs. We further show that although these constraints aren't tractable for automatic solvers when phrased over programs directly, we can solve analogous constraints over program *executions*, and then reconstruct programs that satisfy the original constraints.

Cyber Security online course begins 5 September

Brief Description:

The Secure and Resilient Systems research group in the School of Computing are putting the finishing touches on a new MOOC (Massive Open Online Course) on Cyber Security. The three-week course Cyber Security: Safety at Home, Online, in Life will be running on the FutureLearn platform from 5th September 2016.

rss iconwrite news icon