Current students

Joseph Haraldson, PhD candidate
David R. Cheriton School of Computer Science

We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form (SNF). This is a non-convex optimization problem where we find a nearby matrix polynomial with prescribed eigenvalues and associated multiplicity structure in the invariant factors.

Si Chuang Li, Master’s candidate
David R. Cheriton School of Computer Science

Chang Ge, PhD candidate
David R. Cheriton School of Computer Science

Ali Abbassi, Master’s candidate
David R. Cheriton School of Computer Science

We present a variety of translation options for converting Alloy to SMT-LIB via Alloy’s Kodkod interface. Our translations, which are implemented in a library that we call Astra, are based on converting the set and relational operations of Alloy into their equivalent in typed first order logic (TFOL). 

Haotian Zhang, PhD candidate
David R. Cheriton School of Computer Science

Zeynep Korkmaz, PhD seminar
David R. Cheriton School of Computer Science

Analysis on graphs have powerful impact on solving many social and scientific problems, and applications often perform expensive traversals on large scale graphs. Caching approaches on top of persistent storage are among the classical solutions to handle high request throughput. However, graph processing applications have poor access locality, and caching algorithms do not improve disk I/O sufficiently.

Di Wang, Postdoctoral fellow
Georgia Institute of Technology

Jeff Avery, PhD candidate
David R. Cheriton School of Computer Science