p(nametag). ben lickly eecs graduate student uc berkeley !(face)images/lickly_headshot.jpg(me)! h1(#about). About Me I've now moved on to "Google":https://google.com! h2. Education During my tenure at UC Berkeley, I was a "Berkeley EECS":http://eecs.berkeley.edu PhD student, working in the "Center for Hybrid and Embedded Software Systems":http://chess.eecs.berkeley.edu with "Professor Edward Lee":http://ptolemy.eecs.berkeley.edu/~eal. I graduated from "UC Berkeley":http://berkeley.edu in 2012 with a Ph.D. in Electrical Engineering and Computer Science, and from "Harvey Mudd College":http://hmc.edu in the spring of 2007, where I received my B.S. in Math and Computer Science. h2. Research I am interested in many different of models of computation and programming languages. I like to contrast how these models deal with concurrency, as well as how expressive and analyzable they are. I familiar with embedded systems, but I like to find interesting problems anywhere. I am also a Korean speaker, and curious about second language learning in general. h1(#contact). Contact As of March 2013, you can still contact me through my Berkeley email address: h1(#research). Research Areas * "Ptolemy II":http://ptolemy.berkeley.edu/ptolemyII is our group's laboratory for experimentation with models of computation, and model based design. * "Ptolemy Hierarchical Orthogonal Multi-Attribute Solver (PtHOMAS)":http://chess.eecs.berkeley.edu/pthomas is a solver built on top of Ptolemy II that allows model builders to construct their own static analysis on top of models. This allows modelers to make checks that models are consistent with respect to some domain-level property, as well as infer useful global-level model information. * "Relational Interface Theory":http://chess.eecs.berkeley.edu/pubs/650.html is a mathematical formalism for representing abstractions of components. This allows properties to be proved over these abstractions. * "Precision Timed (PRET) Machines":http://chess.eecs.berkeley.edu/pret is a project aimed at developing new computer architectures that provide tighter timing guarantees. I have developed C-level timing constructs that can target these architectures, and provide a natural target language for code generators concerned with program timing. h1(#pubs). Publications h1(#projects). Class Projects * "Augmented Reality Gaming on the Android Platform":https://github.com/blickly/ghostrun * "New Width Inference Algorithm for Ptolemy II":http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-13.html * "A Timing Requirements-Aware Scratchpad Memory Allocation Scheme for a Precision Timed Architecture":http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-115.html h1(#resume). Resume An occasionally up-to date copy of my resume is available "here":lickly_cv.pdf