Felienne is assistant professor at Delft University of Technology. In 2013, she defended her PhD thesis ‘Analyzing and Visualizing Spreadsheets’, after which she remained in Delft to continue working on the application of software engineering methods to spreadsheets, assisted by an STW Open Competition grant.
During her PhD she founded a company called Infotron, which brings her spreadsheet quality analysis tools to the market, currently serving customers including KLM Air France and Robeco.
One of Felienne’s biggest passions in life is to share enthusiasm for programming with others. She teaches a bunch of kids LEGO Mindstorms programming every Saturday in a local community center and is one of the founders of the Joy of Coding conference, a one day developer conference in Rotterdam, celebrating the love for programming.
So this one day, I am playing the board game Quarto with my friend and I wonder, can this game end in a tie, or is there always a winner? Normal people might have squabbled or shrugged, but not us nerds! We obviously abandoned the game, took our laptops to the local pub and started hacking. In this talk I will explain how I used F# to transform this problem to satisfiability, ran it through a sat solver to discover if it can indeed end in a tie. I will also show how to apply the same technique to more useful problems such as scheduling and hardware testing.