Fogarty is an assistant professor in the Department of Computer Science at Trinity University.
Ph.D. in Computer Science, Rice University
M.S. in Computer Science, Rice University
B.S. in Computer Science, University of Illinois, Urbana Champaign
Corey Fisher, Seth Fogarty, Moshe Vardi. "Random Models for Evaluating Efficient Büchi Universality Checking." In Proc. 7th Indian Conference on Logic and Its Applications (ICLA), 2017
Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke. "Profile Trees for Büchi Word Automata, with Application to Determinization" (full version). In Information and Computation (I&C), 2015
Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke. "Unifying Büchi Complementation Constructions" (full version). In Logical Methods in Computer Science (LMCS), 2013
Seth Fogarty, Moshe Y. Vardi. "Büchi Complementation and Size-Change Termination" (full version). In Logical Methods in Computer Science (LMCS), 2012
Seth Fogarty, Moshe Y. Vardi. "Efficient Büchi Universality Checking." In Proc. 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2010
Fogarty's primary research is in formal verification: how to automatically prove that a program satisfies a specification. While most programs are checked through ad-hoc testing, for certain systems we need a more formal proof of correctness. In general it is impossible to reason about programs in a meaningful way: they are just too complex. In formal verification, we create abstract models of programs, and reason about the models instead. Fogarty focuses on automate-theoretic verification, where both the program and the specification are modeled as finite automata over infinite words.
He does research on creating domain-specific languages: little programming languages dedicated towards a specific area, informed by experts in that area.
Community service & Involvement
Faculty sponsor, student chapter of the Association for Computing Machinery.