Peter Hawkins Ph.D student, Department of Computer Science, Stanford University Office: Gates 416 Email address: last name followed by first letter of first name at cs dot stanford dot edu

bio: I'm a second year Ph.D student in the Department of Computer Science at Stanford University. I'm originally from Australia. My research interests are in the fields of static program analysis, software verification, logic programming, and (semi-)automated proof methods. My advisor is Alex Aiken. things for which you might be looking: I work on the Saturn program analysis framework. various things that I enjoy, and think that you should, too: I sing in the Stanford Chamber Chorale. Cycling in the SF Bay Area is amazing. Time not spent hiking in the Sierras is time wasted. Here are some photos of recent trips to Rae Lakes and Mt. Whitney. papers: The following are all from my undergraduate research, where I was interested in the use of Binary Decision Diagrams and SAT as techniques for solving set constraint satisfaction problems over finite integer domains. Peter Hawkins and Peter J. Stuckey, 'A Hybrid BDD and SAT Finite Domain Constraint Solver', in Proceedings of Practical Applications of Declarative Languages (PADL '06), LNCS 3819, pages 103-117, 2006. Peter Hawkins, Vitaly Lagoon and Peter J. Stuckey, 'Solving Set Constraint Satisfaction Problems using ROBDDs', in Journal of Artificial Intelligence Research, 24 (2005), pages 109-156. Peter Hawkins, Vitaly Lagoon and Peter J. Stuckey, 'Set Bounds and (Split) Set Domain Propagation Using ROBDDs', in Proceedings of the 17th Australian Joint Conference in Artificial Intelligence (AI '04), LNAI 3339, pages 706-717, 2004. Copyright © 2004 Springer-Verlag. Solving Set Constraint Satisfaction Problems using ROBDDs, Bachelor of Science Honours thesis, 2004.