Abstract

My parents encouraged me to study computers. In this thesis I show is that it is possible to give modular correctness proofs of interesting higher-order imperative programs using higher-order separation logic. vi — DRAFT 1 NOV 2010Acknowledgments I would like to begin by thanking my advisors for giving me perhaps more rope than was advisable. John and Jonathan were both very tolerant of my sudden enthusiasms, my half-baked ideas, and general tendency to wander off in peculiar directions. Lars was an invaluable source of support and advice, and after every trip to Denmark I returned significantly more knowledgeable than before I left. I would like to thank Bob for an act he may not even recall any more: as a new graduate student, he informed me that I would be coming to ConCert group meetings, despite technically not even being part of the ConCert project. As a consequence, I have the need and the pleasure to thank the whiteboard gang for their willingness to talk. Noam Zeilberger and Jason Reed were particularly inspiring examples of people following their mathematical muse, and William Lovas,

Citations