Jump to content

Javier Esparza

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Kiwipete (talk | contribs) at 05:38, 20 August 2023 (Use birth date template). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

For the politician, see Javier Esparza (politician).
Javier Esparza
Born (1964-04-27) 27 April 1964 (age 60)
Pamplona, Spain
Awards
Scientific career
Fields
Institutions
Websitewww7.in.tum.de/~esparza/

Francisco Javier Esparza Estaun (born 27 April 1964 in Pamplona, Spain[1]) is a Spanish computer scientist. He is a professor at the Technische Universität München.

Education

Javier Esparza Estaun received his Master of Science degree in Theoretical Physics from the University of Zaragoza (1987). He earned his Doctoral degree (PhD) in Computer Science (1990, on free-choice Petri nets) from the same university.[2][3] He habilitated 1994 at the University of Hildesheim on the subject of Petri net unfoldings.[4]

Career

During his habilitation and in the period afterwards, Javier Esparza's focus was on concurrency theory and the theory of Petri nets. He made important contributions to Petri net structure theory and to the unfolding approach, initially proposed by Kenneth L. McMillan,[5] and he is the co-author of two books on these subjects.[6][7]

After his habilitation, he was employed as an associate professor at Technische Universität München (1994–2001). He was then successively Chair of Theoretical Computer Science at the University of Edinburgh (2001–2003) and Chair of Software Reliability and Security at the Universität Stuttgart (2003–2007). Since 2007, he holds the chair for Foundations of Software Reliability and Theoretical Computer Science, again at Technische Universität München.[1]

He has also made contributions to the automata-theoretic approach to software model checking, to program analysis, and to the verification of infinite-state systems. More recently, his work has focused on the verification of parametrised and stochastic systems. He has published over 250 peer-reviewed scientific papers[8] in the aforementioned fields, as well as lecture notes on an algorithmic approach to automata theory.[9] Multiple software verification tools have been developed by his group, such as Moped[10] and jMoped,[11] Rabinizer,[12] Strix,[13] and Peregrine.[14] He received an Advanced Grant from the European Research Council in 2018[15] and has been Principal Investigator of more than 20 research projects, most of them collaborative in an international context.[1] He has frequently been invited as a speaker at Computer Science conferences and has served as a Chair or a member of various professional Program, Steering and Selection Committees.[1]

Awards and honours

Javier Esparza has been awarded an honorary doctorate in Informatics from the Masaryk University of Brno, Czech Republic, in 2009,[16] and he is an elected member of Academia Europaea since 2011.[17] He received the CONCUR Test-of Time Award 2021 for his paper Reachability Analysis of Pushdown Automata: Application to Model-checking (co-authored with Ahmed Bouajjani and Oded Maler);[18] several best paper awards at conferences;[19][20][21] multiple times a Best Teaching prize at the Technische Universität München;[22] and a Dissertation Prize of Universidad de Zaragoza (1990).[23]

References

  1. ^ a b c d "Curriculum vitae" (PDF). Technische Universität München. Retrieved 2021-04-29.
  2. ^ Esparza J., Silva M. (1991) On the analysis and synthesis of free choice systems. Lecture Notes in Computer Science, vol 483. Springer, Berlin, Heidelberg. Lecture Notes in Computer Science. 1991. pp. 243–286. doi:10.1007/3-540-53863-1_28. ISBN 9783540463696. Retrieved 2021-04-29.
  3. ^ "Citations in Google Scholar". Google Scholar. Retrieved 2021-04-29.
  4. ^ Esparza, Javier (December 1994). "Model checking using net unfoldings". Science of Computer Programming. 23 (2): 151–195. doi:10.1016/0167-6423(94)00019-0. S2CID 29311587.
  5. ^ "Kenneth L. McMillan". Wordpress. Retrieved 2021-04-30.
  6. ^ Jörg Desel and Javier Esparza (1995), Free Choice Petri Nets, Cambridge Tracts in Theoretical Computer Science, vol. 40, Cambridge University Press, ISBN 9-780-52101945-3
  7. ^ Javier Esparza and Keijo Heljanko (2008), Unfoldings–A Partial-Order Approach to Model Checking, EATCS Monographs in Theoretical Computer Science, Springer, ISBN 978-3-540-77425-9
  8. ^ "DBLP publication list for Javier Esparza". DBLP computer science bibliography. Retrieved 2021-04-26.
  9. ^ "An Algorithmic Approach to Automata Theory". Technische Universität München. August 2017.
  10. ^ "Moped". Universität Stuttgart. Retrieved 2021-04-30.
  11. ^ "jMoped". doi:10.1007/978-3-540-31980-1_35. {{cite journal}}: Cite journal requires |journal= (help)
  12. ^ Rabinizer. doi:10.1007/978-3-642-33386-6_7. ISBN 9783642333866. Retrieved 2021-04-30.
  13. ^ "Strix". Technische Universität München. Retrieved 2021-04-30.
  14. ^ "Peregrine". Technische Universität München. Retrieved 2021-04-30.
  15. ^ "ERC funded projects". European Research Council. Retrieved 2021-04-26.
  16. ^ "Javier Esparza–Honorary Doctorates conferred by MU". Masaryk University. Retrieved 2021-04-26.
  17. ^ "Javier Esparza". Academia Europaea. Retrieved 2021-04-26.
  18. ^ "Concur Test of Time Awards". Qonfest conference website. Retrieved 2021-04-26.
  19. ^ "Best paper award Petri Nets". PaVeS website. Retrieved 2021-04-26.
  20. ^ "Best paper award Petri Nets". PaVeS website. Retrieved 2023-05-20.
  21. ^ "Best paper award for Paves at SAND'22". PaVeS website. Retrieved 2023-05-20.
  22. ^ "TechInf Award (Informatik)". Fachschaft Mathematik, Physik, Informatik der TUM. Retrieved 2021-04-26.
  23. ^ "Javier Esparza - Curriculum Vitae". Academia Europaea. Retrieved 2021-04-26.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Javier_Esparza&oldid=1171290516"