Jacob Burnim

I am a software engineer at Sift Science, fighting fraud with machine learning.

I recently finished my Ph.D. in Computer Science at the University of California, Berkeley, where I worked on software testing and program analysis with Koushik Sen.

Contact

jburnim AT gmail.com

(415) 971-8004

Publications

Determinism and Correctness for Parallel Programs

• Lightweight Specifications for Parallel Correctness
  Jacob Burnim
  Ph.D. Thesis, University of California, Berkeley, 2012
  [paper]

• CONCURRIT: A Domain Specific Language for Reproducing Concurrency Bugs
  Tayfun Elmas, Jacob Burnim, George Necula, Koushik Sen
  ACM SIGPLAN Symposium on Programming Language Design and Implementation (PLDI), 2013
  [paper] [src]

• CONCURRIT: Testing Concurrent Programs with Programmable State-Space Exploration
  Jacob Burnim, Tayfun Elmas, George Necula, Koushik Sen
  4th USENIX Workshop on Hot Topics in Parallelism (HotPar), 2012
  [paper] [slides]

• NDetermin: Inferring Nondeterministic Sequential Specifications for Parallelism Correctness (short paper)
  Jacob Burnim, Tayfun Elmas, George Necula, Koushik Sen
  17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), 2012
  [paper] [tech report]

• NDSeq: Runtime Checking for Nondeterministic Sequential Specifications of Parallel Correctness
  Jacob Burnim, Tayfun Elmas, George Necula, Koushik Sen
  ACM SIGPLAN Symposium on Programming Language Design and Implementation (PLDI), 2011
  [paper] [slides]

• Specifying and Checking Semantic Atomicity for Multithreaded Programs
  Jacob Burnim, George Necula, Koushik Sen
  16th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2011
  [paper] [slides]

• Separating Functional and Parallel Correctness using Nondeterministic Sequential Specifications
  Jacob Burnim, George Necula, Koushik Sen
  2nd USENIX Workshop on Hot Topics in Parallelism (HotPar), 2010
  [paper] [slides] [poster]

• DETERMIN: Inferring Likely Deterministic Specifications of Multithreaded Programs
  Jacob Burnim, Koushik Sen
  32nd IEEE/ACM International Conference on Software Engineering (ICSE), 2010
  IFIP TC2 Manfred Paul Award for Excellence in Software: Theory and Practice
  [paper] [slides]

• Asserting and Checking Determinism for Multithreaded Programs
  Jacob Burnim, Koushik Sen
  17th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), 2009
  Appeared in the June 2010 issue of Communications of the ACM (CACM)
  ACM SIGSOFT Distinguished Paper Award
  [paper] [CACM] [slides] [src]

Correctness of Parallel Programs under Relaxed Memory Consistency

• Testing Concurrent Programs on Relaxed Memory Models
  Jacob Burnim, Christos Stergiou, Koushik Sen
  20th International Symposium on Software Testing and Analysis (ISSTA), 2011
  [paper] [tech report]

• Sound and Complete Monitoring of Sequential Consistency for Relaxed Memory Models
  Jacob Burnim, Christos Stergiou, Koushik Sen
  17th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2011
  [paper] [old tech report] [benchmarks]

Symbolic Execution and Automated Test Generation

• Looper: Lightweight Detection of Infinite Loops at Runtime
  Jacob Burnim, Nicholas Jalbert, Christos Stergiou, Koushik Sen
  24th IEEE/ACM International Conference on Automated Software Engineering (ASE), 2009
  [paper]

• WISE: Automated Test Generation for Worst-Case Complexity
  Jacob Burnim, Sudeep Juvekar, Koushik Sen
  31st IEEE/ACM International Conference on Software Engineering (ICSE), 2009
  [paper] [slides] [src]

• Heuristics for Dynamic Test Generation (short paper)
  Jacob Burnim, Koushik Sen
  23rd IEEE/ACM International Conference on Automated Software Engineering (ASE), 2008
  [paper] [poster] [tech report] [src]

Other Work

• Path Slicing per Object for Better Testing, Debugging, and Usage Discovery
  Jacob Burnim, Sudeep Juvekar, Koushik Sen
  Technical Report No. UCB/EECS-2009-132, 2009.
  [tech report]

• Classical scaling of the quantum capacitances for molecular wires
  James C. Ellenbogen, Carl A. Picconatto, Jacob S. Burnim
  Physical Review A, 2007
  [paper]

Service

I was Local Organization Co-Chair for RV 2011.

I have been an external reviewer or sub-reviewer for:

• WoDet 2012, HotPar 2012, FSE 2012
• POPL 2011, ICSE 2011, NFM 2011, SPIN 2011, ISSTA 2011, SAS 2011, OOPSLA 2011
• NFM 2010, SAS 2010, OOPSLA 2010, PSTI 2010
• ICDCN 2009, ICST 2009, FASE 2009, ICDCS 2009, NFM 2009, SPIN 2009
• APLAS 2008, ASE 2008
• IEEE Transactions on Software Engineering (TSE)
• ACM Transactions on Software Engineering and Methodology (TOSEM)
• Journal of Systems and Software (JSS)
• Empirical Software Engineering (EMSE)
• Journal of Zhejian University -- Science C

Software

I wrote CREST, an automatic test generation tool for C. CREST is an extensible C++ platform for building strategies for exploring the path space of a C program using concolic execution.

Previously

Before starting at Berkeley, I worked as a software engineer at Google on the (Web) Search Quality team, building a machine learning system for ranking search results the (Web) Search Quality team. I also interned on the Gmail Ads team.

I studied Computer Science and Mathematics at the California Institute of Technology. I remain a proud Darb.

I spent three summers in the MITRE Nanosystems Group, working with Dr. James Ellenbogen on quantum capacitances and designs for nanoscale memory.