Ciao! My name is Federico Sossai and I like bread, dogs, and algorithms.

My research focuses on abstractions and intermediate representations for parallelizing compilers. I am especially interested in what compilers need to expose parallelism beyond highly regular array code, where static analyses fall short.

Effective parallelization often requires memory layout transformations.

For example, insertions into a bag can run in parallel if the bag is expanded into independent per-task buffers, so that insertions do not race. Unfortunately, such expansion depends on the semantics of the bag as well as its memory representation, which compilers cannot infer.

To tackle this challenge, I developed the concept of terminable dependence, i.e., a memory dependence carrying a set of developer-encoded transformations to break it.

I've always had a strong passion for programming. I'm fascinated by how much structure can emerge when spoken ideas become written algorithms, and how these structures come back again and again.

At the University of Padua, I realized how the love for learning did not only belong to computer science but extended to all the disciplines ruled by the rigor of math. For better or worse, calculus, electromagnetism, probability theory, and NP-completeness forever changed how I look at the world, and there's no way back.

{
  "firstname": "Federico",
  "lastname": "Sossai",
  "email": "${firstname}.${lastname}@gmail.com",
  "citizenships": ["Italy"],
  "address": {
    "building": "Mudd Library",
    "room": 3304,
    "street": "2233 Tech Drive",
    "zip": 60208,
    "city": "Evanston",
    "state": "IL",
    "country": "USA"
  }
}