Academic Career and Research Areas
The Chair held by Prof. Esparza (b. 1964) develops methods, algorithms and tools to locate and eliminate errors in software systems or verify their correctness. The mathematical techniques used in this work include logic, automata theory and complexity theory.
Prof. Esparza studied physics in Zaragoza (Spain), where he also completed his doctorate in computer science in 1990. After qualifying as a lecturer in computer science (Hildesheim, 1994), he was appointed associate professor at TUM (1994-2001). He was a professor at Edinburgh University between 2001 and 2003 and held a Chair at the University of Stuttgart between 2003 and 2007. He has been a full professor at TUM since 2007.
Esparza J, Kiefer S, Luttenberger M: "Newtonian Program Analysis". Journal of the ACM. 2010; 57(6): 1-33.
Esparza J, Heljanko K: Unfoldings - A Partial-Order Approach to Model Checking. EATCS Monographs in Theoretical Computer Science. Berlin, Heidelberg: Springer Verlag, 2008.
Esparza J, Kucera A, Mayr R: “Model Checking Probabilistic Pushdown Automata”. Logical Methods in Computer Science. 2006; 2(1): 1-31.
Bouajjani A, Esparza J, Maler O: “Reachability Analysis of Pushdown Automata:Application to Model-Checking”. In: CONCUR '97: Concurrency Theory. Lecture Notes in Computer Science 1243. Editors: Mazurkiewicz A, Winkowski J. 1997; 1243; 135-150.
Desel J, Esparza J: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science 40. Cambridge: Cambridge University Press, 1995.