Bio as of 12/4/08: Ganesh L. Gopalakrishnan was awarded his PhD degree in
Computer Science from Stony Brook University in 1986. He joined the
faculty at the School of Computing, University of Utah, the same year.
He spent a year each at the University of Calgary (1988), visiting
Stanford University (1995), and at Intel, Santa Clara (2002). His
interests are in applying formal specification and verification
methods - some examples being: scalable formal verification methods
for message passing interface (MPI) programs and shared memory
(thread) programs, formal verification of cache coherence protocols,
shared memory models, partial order reduction methods (static and
dynamic). He advises six PhD students, two MS students, and three
undergraduates, has authored a textbook "Computation Engineering:
Applied Automata Theory and Logic," and about 130 research papers.
His research is supported by NSF, Microsoft, and SRC. For details,
visit http://www.cs.utah.edu/~ganesh.