Ph.D. Student
Department of Computer and Information Science
University of Pennsylvania
bohannon@cis.upenn.edu
Levine/GRW 565
CIS Dept., Levine 302
3330 Walnut St.
Philadelphia, PA 19104
Computer software is notoriously buggy. By designing type systems and domain-specific languages, I aim to make it easier to write reliable software. In conjunction with this, I am interested in techniques for using proof assistants to verify properties of our languages, compilers, and other critical system tools.
I am currently working on the design of a language for writing secure web applications and browser extensions. I have written a report on the security of web mashups. Slides for the report are available in PowerPoint or PDF format, although the graphical overlay sequences only work in the PowerPoint format.
I am involved in the POPLmark project at Penn and am interested in comparing techniques for representing inductive data types with binding in the Coq proof assistant.
I have worked on extending the results from the Harmony project to bi-directional transformations on relational data and string data.
My advisor is Benjamin Pierce.
In 1996 I graduated from high school in Emmett, Idaho. I spent two years at Albertson College of Idaho before transferring to Northwestern University in 1998.