Welcome to my academic and personal website!
I am Fabio Mogavero, an Italian research and teaching assistant in theoretical computer science at the
Department of Computer Science of the University of Oxford, currently
collaborating with prof. dr. Michael Benedikt.
From November 2014 to January 2016, I have been a free postdoctoral researcher at the Department of Mathematics and Applications of the Università degli Studi di Napoli Federico II. Previously, from July 2011 to October 2014, I worked as a regular postdoctoral researcher at the Department of Physics. At the end of January 2011, I earned my Ph.D. in Computer Science from the same university, defending a thesis titled "Logics in Computer Science". As a Ph.D. candidate, I have been a member for three years of the formal-system research group of prof. dr. Aniello Murano. During the autumn 2008, I was a visiting graduate student in the Department of Computer Science at the Rice University in Houston, Texas, USA, studying under the supervision of prof. dr. Moshe Y. Vardi. For a period in the winter 2010, I was also a visiting graduate student in the School of Computer Science and Engineering at the Hebrew University in Jerusalem, Israel, working under the supervision of both prof. dr. Orna Kupferman and prof. dr. Moshe Y. Vardi.
I graduated with a Master of Computer Science Engineering in October 2007, developing a thesis on temporal logics, titled "Branching-Time Temporal Logic: Theoretical Issues and a Computer Science Application", written under the direction of prof. dr. Aniello Murano. In September 2005, I also received the Bachelor of Science degree in the same major, discussing a thesis on number factorization methods, titled "Sui Metodi e gli Algoritmi di Fattorizzazione", developed under the supervision of prof. dr. Vincenzo Ferone.
This website is currently under heavy refactoring, hence, some pages might not be accessible. For further information one can refer to my curriculum vitae.
My main research interests intersect the areas of formal specification, verification, and synthesis of systems, database theory, decidability and undecidability of logic languages, temporal and strategic logics, games in theoretical computer science, and automata on finite and infinite objects. At the present time, I am focusing on three specific themes: query reformulation under disjunctive constraints; decidability and undecidability of first-order logic fragments; efficient algorithms for the solution of parity games.
Academic & personal emails:
fabio [dot] mogavero [at] cs [dot] ox [dot] ac [dot] uk
fm [at] fabiomogavero [dot] com