David Van Horn 136 Volen / (781) 736-2728 dvanhorn@cs.brandeis.edu Brandeis University Volen Center for Complex Numbers Michtom School of Computer Science

Structures don't march in the streets.

PhD student under the supervision of Harry Mairson.

Research interests

Programming languages, analysis of functional programming languages, type theory, and language based approaches to security.

My research weblog: dvanhorn @ λ-calcul.us.

Courses

At Brandeis:

• CS21b: Structure and Interpretation of Computer Programs.
• CS190: Programming Language Theory.
• USEM77: Where the Idea of the Computer Came From.

At Northeastern University:

• CS U211: Introduction to Programming and Computing I.
• CS U213: Introduction to Programming and Computing II.

Office hours (Brandeis): Tuesday, Fridays 10:30am-12:30pm, or by appointment.

Calendar: HTML, XML, iCAL.

Papers

• Deciding kCFA is complete for EXPTIME. With Harry G. Mairson.
  Preprint, 2008.
  [ PDF | Abstract ]

• Flow analysis, linearity, and PTIME. With Harry G. Mairson.
  To appear, The 15th International Static Analysis Symposium SAS 2008, Valencia, Spain, July 2008.
  [ PDF | Abstract ]

• Types and Trace Effects of Higher Order Programs. With Christian Skalka and Scott Smith.
  Journal of Functional Programming, 18(2), March 2008.
  [ PDF | Abstract ]

• Relating Complexity and Precision in Control Flow Analysis. With Harry G. Mairson.
  Proceedings of the Twelth ACM SIGPLAN International Conference on Functional Programming (ICFP'07), Freiburg, Germany, October, 2007.
  [ PDF | Abstract ]

• Algorithmic Trace Effect Analysis.
  MS thesis, University of Vermont, 2006.
  [ PDF | Abstract ]

• A Type and Effect System for Flexible Abstract Interpretation of Java. With Christian Skalka and Scott Smith.
  In Proceedings of the ACM Workshop on Abstract Interpretations of Object-Oriented Programs, Electronic Notes in Theoretical Computer Science, Volume 131. January 2005.
  [ PDF | Abstract ]

Posters

• Algorithmic Trace Effect Analysis, August 2005.
  [ PDF | Abstract ]

Events

• The 15th International Static Analysis Symposium (SAS 2008), Valencia, Spain, 16-18 July 2008.
• The 12th ACM SIGPLAN International Conference on Functional Programming (ICFP 2007), Freiburg, Germany, 1-3 October 2007.
• NU Programming Languages Seminar, Northeastern University, Boston, Massachusetts, 22 May 2007.
• IBM Programming Languages Day, Hawthorne, New York, 7 May 2007.
• Geometry of Computation 2006, Winter School And Workshops on various aspects of Theoretical Computer Science, Marseille - Luminy, France
• Dagstuhl seminar on Latently-Typed Languages, International Conference and Research Center for Computer Science in Schloss Dagstuhl, 01 May - 06 May, 2006.

Current activities

• Revised⁶ Report on the Algorithmic Language Scheme
• New England Programming Languages and Systems Symposium Series (NEPLS)
• PL Seminar, Jr.
• Riverbot
• Scheme 48
• Scheme Requests for Implementation

Past activities

• Member of the University of Vermont Computer Security Lab.
• CSSA Speaker Series
• Program Analysis and Transformation Summer School 2005, DIKU, University of Copenhagen, Copenhagen, Denmark.
• Foundations of Security Summer School 2003, University of Oregon, Eugene, Oregon, USA.
• Member of the University of Vermont Knowledge and Data Engineering Group.

Recent talks

• Linear Logic and the Complexity of Control Flow Analysis, CMU Principles of Programming Seminar, January 2008 (presented by Harry Mairson).
• Relating Complexity and Precision in Control Flow Analysis, The 12th ACM SIGPLAN International Conference on Functional Programming (ICFP 2007), Freiburg, Germany, October, 2007.
• Relating Complexity and Precision in Control Flow Analysis, Northeastern Programming Languages Seminar, Boston, May, 2007.
• Relating Complexity and Precision in Control Flow Analysis, IBM PL Day, Hawthorne, New York, May, 2007.
• From Syntactic Sugar to the Syntactic Meth Lab: Using Macros to Cook the Language You Want, Brandeis University, CoSci 21b, December, 2006.
• Linearity and Program Analysis, and Relating complexity and precision of approximation in control flow analysis, Northeastern University PL Seminar, Jr., October, 2006.
• Proofnets and Paths in Constructive Classical Logic: Too Old, Too New, (presented by Harry Mairson) Geometry of Interaction Workshops, Marseille, February 2006.
• Algorithmic Trace Effect Analysis, MS thesis defense, University of Vermont, March 2006.
• Abstract Machines for the Multi-return λ-calculus, presented to Northeastern University G711 ("Principles of Programming Languages"), December 2005.
• Algorithmic Trace Effect Analysis, presented to the University of Vermont Computer Science Research Day, August 2005. Research poster.
• Context Based Security in Programming Languages, presented to Vermont EPSCoR annual conference. August 2005.

Miscellany

• Friends on the web:
  • Aaron Hawley
  • Jared Metzner
  • Jereme Mongeon
  • Simon Spartalian
  • Simple Measure (Erin and Megan Williams)
• LaTeX style for UVM Theses

Valid XHTML Valid CSS
Last updated by dvanhorn: Mon Apr 7 19:51:14 EDT 2008