Control flow graphs (CFGs) show the set of possible flows a computer program can have at run-time, in particular, how a certain target can be reached inside (binary) code. CFG are incredibly useful in almost any program analysis technique. For example, when reverse engineering, the control flow graph is the main component to build on … full description “Control Flow Graph Reconstruction using Control-Flow Integrity”

# Category: Algorithms

## [Taken] Entry into the PACE Parameterized Algorithms and Computational Experiments Challenge (completed)

Parameterized Complexity is a research field that, by its own self-description, strives to provide practical, yet theoretically well-founded ways to deal with computationally hard problems (e.g., so-called NP-hard problems). However, the vast majority of the work in the field is purely theoretical — there is a great toolbox of interesting and powerful algorithmic methods, which have been proven to have … full description “[Taken] Entry into the PACE Parameterized Algorithms and Computational Experiments Challenge”

## Stable Marriage of Students (completed)

Constraint Satisfaction and the final year projects system Prof Cohen is a world leading researcher in the theory and practice of constraints and has written some tools for the department that need to be improved. At Royal Holloway, we allocate students to projects and staff as supervisors of those projects using a semi-automated process, using … full description “Stable Marriage of Students”