Michael Hicks

E-mail: (GPG key)
Twitter: @michael_w_hicks
Phone/Fax: +1-301-405-2710 / +1-301-405-6707
Office:

3417 A.V. Williams Building (in 3400 suite)

(Quadrant E3, Building 115 in the linked map)

Address:

Dept. of Computer Science

University of Maryland

A.V. Williams Building

College Park, MD 20742



Publications PL Enthusiast (Blog)
CMSC 433 MOOC on Software Security

I am a professor in the Computer Science Department and UMIACS at the University of Maryland, College Park. With Jeff Foster and David Van Horn I direct PLUM, the lab for Programming Languages research at the University of Maryland. I am also affiliated with the Maryland Cybersecurity Center (MC2), and was formerly its Director (see our video!). You may find it interesting to read about how we manage PLUM.

Here is my current vita and a list of my publications, organized by year and by category.

I received my Ph.D. in Computer and Information Science from the University of Pennsylvania in August 2001, and I spent one year as a post-doctoral associate affiliated with the Information Assurance Institute of the Computer Science Department at Cornell University. During academic 2008 - 2009, I was on sabbatical in Cambridge, England. From September to November I was at Microsoft Research and from December to August 2009 I was at the University of Cambridge Computer Laboratory. I was the director of MC2 from October 2011 to 2013. 

How fast can you type? (My best so far is 100 wpm.)

Research

My primary research interest is to develop and evaluate techniques to improve software availability, reliability, and security. I am currently working on a number of projects.
Dynamic Software Updating - means to safely, efficiently, and flexibly update running code. We have developed general-purpose methods for updating C and Java programs, and are currently considering means to update controllers in software-defined networks. Our system for dynamically updating C code is called Kitsune and our system for Java is called Rubah; the code and benchmarks for both are freely available. Earlier work and papers are described here.
Secure Programming - How do we build software that is secure? We have been developing a contest, called build-it, break-it, fix-it whose aim to test how well students can build software securely. Our hope is to offer this contest several times, at scale, and then draw larger lessons from the data we gather from the process and outcomes.
Blending Programming Languages and Cryptography - means of implementing privacy-preserving or integrity-assuring computation through the combination of programming languages and cryptographic techniques. I have looked at languages and analyses for secure multiparty computation, most notably a new programming language called Wysteria, and developed novel mechanisms for cloud-based computations involving general-purpose authenticated data structures and compiler-optimized oblivious RAM.
Quantifying Information Flow - means to enforce security policies through programming languages and analyses that carefully consider (and quantify) information flows. We have implemented approaches using probabilistic abstract interpretation for protecting static secrets, and we have recently started looking at protecting information that varies with time.
Demand-driven incremental computation - general-purpose techniques for updating the output of a computation as a result of small changes to its input. Our approach, called Adapton, considers the demand for output when deciding to propagate changes, resulting in potentially very large performance improvements.
Scriptable debugging - a new library Expositor for writing dynamic analyses to assist in debugging. Expositor's noteworthy feature is that it builds on top of record/replay execution and employs lazyness to keep scripts efficient.

Previously, I was involved in Diamondback Ruby, static and hybrid static/dynamic type system for the Ruby scripting language. I was involved with the development of Otter, a symbolic executor for C programs. I also worked on LockSmith, a static analysis tool for proving the absence of race conditions in C programs, and a novel user interface technique applied to it called Path Projection, which is a browser-based UI toolkit for presenting, navigating, and querying paths emitted as static analysis results. I was a core developer of Cyclone, a safe dialect of C. I have also looked at means for customized, language-enforced security policies, implemented in a web programming language, SELinks, and automatically inserted by a compiler called Coco. I have an interest in systems and networking as well, and for a while I worked on measurement-aware data transport and kernel-based rootkit detection. Links to all past projects may be found on the PLUM home page.

Research Group

Current students/postdocs:
Matthew Hammer (postdoc)
Luis Pina (visiting from IST Lisbon)
Aseem Rastogi
Karla Saur*
Piotr Mardziel
Chang Liu (co-advised with Elaine Shi)
Andrew Miller (co-advised with Jon Katz and Elaine Shi)
Andrew Ruef
James Parker

Previous students/postdocs:
Khoo Yit Phang* User-centered Program Analysis Tools
Software Engineer, MathWorks since August 2013
Chris Hayden* Clear, Correct, and Efficient Dynamic Software Updates
Software Engineer at Trove (previously WaPo Labs), since June 2012
Justin McCann Automating Performance Diagnosis in Networked Systems
Martin Ma* Improving Program Testing and Understanding via Symbolic Execution
Software Engineer, Amazon, since January 2012
Saurabh Srivastava*Satisfiability-based Program Reasoning and Program Synthesis
Assistant Research Engineer (previously a post-doc), Berkeley, since July 2010
Pavlos Papageorgiou The Measurement Manager: Modular and Efficient End-to-end Measurement Services
Software Engineer, Google, since December 2008
Iulian Neamtiu Practical Dynamic Software Updating
Assoc. Prof, UC Riverside, since Fall 2008
Polyvios Pratikakis* Sound, precise, and efficient static race detection for multithreaded programs
Researcher, Institute of Computer Science, FORTH (Crete, Greece), since Spring 2010 (previously a post-doc at CNRS/VERIMAG)
Nikhil SwamyLanguage-based Enforcement of User-defined Security Policies as Applied to Multi-tier Web Applications
Researcher, Microsoft Research, Redmond, since Fall 2008
Nick Petroni** Property-based Integrity Monitoring of Operating System Kernels
Research scientist, IDA/CCS since Spring 2008
Nataliya Guts (postdoc)
Stephen Magill (postdoc) Research scientist, IDA/CCS since August 2011
Manuel Oriol (postdoc) Principal Scientist at ABB Switzerland Ltd. since Fall 2011
Senior Lecturer, University of York (UK), since Fall 2008
Ted Smith (undergrad)* A grad student at UMass Amherst in the PLASMA group since August 2013

* co-advised with Jeff Foster ** co-advised with Bill Arbaugh

I have also worked with Avik Chaudhuri, Mike Furr, David An, and Elnatan Reisner (advised by Jeff Foster), Adam Bender (advised by Bobby Bhattacharjee), Jaime Spacco (advised by Bill Pugh), and Suriya Subramanian (advised by Kathryn McKinley at UT Austin). I have previously advised Jonathan Turpie (now at Amazon), Brian Corcoran (now at Palantir), Eric Hardisty, and James Rose. I've also worked with post-grad Patrick Jenkins, undergrad Jeff Meister, and high school students, Ted Smith (Walt Whitman High), and Matt McCutchen and Cody Burton (both at Montgomery Blair). Both Ted and Matt later became undergraduate students in our Department.

Teaching

Professional Activities

I have served (or am serving) on the program committees for

2015IEEE S&P, CSF (PC co-chair)
2014 OBT, CSF, OOPSLA/SPLASH
2013 POPL (ERC), PLDI
2012 POPL (program chair), HotSWUp
2011 TLDI, HotSWUp (co-organizer), OOPSLA
2010 ESOP, PLDI (ERC and tutorials chair), ICFP (PC and local arrangements), PASTE
2009 POPL, IEEE S&P, PLDI SRC
2008 CCS, CATARS, COORDINATION, ISMM (ERC)
2007 PLAS (general and program chair), OOPSLA, COORDINATION, PLDI
2006 FTfJP, PLAS, SPACE, OOPS (part of SAC 2006)
2005 SCOOL, VEE
2004 IWAN, ICPP, FUSE
2003 IWAN, USE
2002 IWAN, USE
2001 IWAN
ATYlogo Support Wikipedia