Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting after each statement) enables optimal solutions based on ILP, for both spilling and coalescing. However, while the solutions are easily found for spilling, for coalescing they are more elusive. This difficulty stems from ...

Register allocation is one of the most studied problems in compilation. It is considered as an NP-complete problem since Chaitin et al., in 1981, modeled the problem of assigning temporary variables to k machine registers as the problem of coloring, with k colors, the interference graph associated to the variables. The fact that the interference graph can be arbitrary proves the NP-completeness...

Register allocation is one of the most studied problem in compilation. It is considered as an NP-complete problem since Chaitin, in 1981, showed that assigning temporary variables to k machine registers amounts to color, with k colors, the interference graph associated to variables and that this graph can be arbitrary, thereby proving the NP-completeness of the problem. However, this original p...

Nearly all calculations and measurements of breaking waves assume the wave profiles and flow fields are two-dimensional. Though this assumption may be correct before the waves become turbulent, once transition to turbulent flow begins, the real flow becomes highly three dimensional. The threedimensional structure and motion of the free surface is important for the dynamics of the breaking proce...

Access control misconfigurations are widespread and can result in damaging breaches of confidentiality. This paper presents TightLip, a privacy management system that helps users define what data is sensitive and who is trusted to see it rather than forcing them to understand or predict how the interactions of their software packages

You may have figured out by now that I like cutting graphs into pieces. It is how I discover the structure of a graph. When I encounter a new graph and want to understand what it looks like I first try drawing it. If the drawing looks good, I feel like I understand it. If the drawing looks good, I try chopping the graph into pieces without cutting too many edges. That is, I look for cuts of low...