Jingyue Wu (吴景岳)

I started working full-time at Google in Jan 2014.

Before that, I did my PhD at Columbia University in Computer Science. I worked with Professor Junfeng Yang on several projects related to software reliability and programming languages. During my years at Columbia, I also interned at Microsoft Research Silicon Valley and Facebook working on DryadLINQ and HHVM respectively.

Before joining Columbia, I earned my bachelor's degree with honors from the first Yao Class at Tsinghua University.

I am an active programming competitor. I won the fifth place in China National Olympiad in Informatics (Chinese equivalent of USACO) back in high school. I attended ACM/ICPC, Topcoder, and Google Code Jam in my college and graduate school years. I also served as the coach for Columbia's programming contest team.

• Effective Dynamic Detection of Alias Analysis Errors (ESEC/FSE '13)
  Jingyue Wu, Gang Hu, Yang Tang, Junfeng Yang
  [ Paper: pdf | Software: GitHub ]
  Describes NeonGoby, a system for effectively detecting errors in alias analysis, one of the most important and widely used program analyses.
• Sound and Precise Analysis of Parallel Programs through Schedule Specialization (PLDI '12)
  Jingyue Wu, Yang Tang, Gang Hu, Heming Cui, Junfeng Yang
  [ Paper: pdf | Citation: bib | Talk: pptx | Poster: pdf ]
  Describes a program analysis framework for analyzing multithreaded programs with high precision. The key idea is to statically analyze a multithreaded program toward only a small set of schedules to improve precision, then enforce these schedules at runtime for soundness.
• Bypassing Races in Live Applications with Execution Filters (OSDI '10)
  Jingyue Wu, Heming Cui, Junfeng Yang
  [ Paper: pdf | Citation: bib | Talk: pptx, pdf ]
  
  Describes LOOM, a live-workaround system for fixing races in live applications. LOOM is safe (live-update will not introduce new errors), fast (negligible overhead for most benchmarks), and flexible (able to fix all bugs evaluated).

• Verifying Systems Rules Using Rule-Directed Symbolic Execution (ASPLOS '13)
  Gang Hu, Heming Cui, Jingyue Wu, Junfeng Yang
  [ Paper: pdf | Citation: bib ]
  Describes Woodpecker, a system that leverages path slicing to speed up symbolic execution. It enables users to check systems rules, and avoids checking program paths irrelevant to the rule, drastically reducing the amount of redundant work.
• Efficient Deterministic Multithreading through Schedule Relaxation (SOSP '11)
  Heming Cui, Jingyue Wu, John Gallagher, Huayang Guo, Junfeng Yang
  [ Paper: pdf | Citation: bib | Talk: pptx ]
  Describes Peregrine, a system for efficiently making threads deterministic, addressing a key open challenge within the field of deterministic execution.
• Optimizing Data Partitioning for Data-Parallel Computing (HotOS '11)
  Qifa Ke, Vijayan Prabhakaran, Yinglian Xie, Yuan Yu, Jingyue Wu, Junfeng Yang
  [ Paper: pdf ]
  Presents a crucial problem in data-parallel computing: how to evenly partition data, and sketches a solution to this problem.
• Stable Deterministic Multithreading through Schedule Memoization (OSDI '10)
  Heming Cui, Jingyue Wu, Chia-che Tsai, Junfeng Yang
  [ Paper: pdf | Citation: bib | Talk: pdf ]
  Describes Tern, a system for making threads more deterministic and stable. The key idea is to memoize past schedules and reuse them when possible, much like the natural tendencies in animals and humans to repeat familiar routes to avoid possible hazards along unknown routes.

• 09/2008 - 10/2014: PhD, Department of Computer Science, Columbia University, New York, USA
• 09/2006 - 08/2008: Andrew Yao's Special Class (only 24 of all undergraduate students at Tsinghua University selected)
• 09/2004 - 08/2008: BE with honors, Department of Computer Science and Technology, Tsinghua University, Beijing, China

• CGO '15 PC
• USENIX Security '14 Shadow PC

• 06/2012 - 09/2012: Facebook Menlo Park, working with Ali-Reza Adl-Tabatabai
• 05/2010 - 08/2010: Microsoft Research Silicon Valley, working with Yinglian Xie and Yuan Yu

• Paul Charles Michelman Memorial Award for Exemplary Service to the Computer Science Department 2012
• CS Service Award 2011 ~ 2012
• 2nd place at the 2011 ACM/ICPC Great New York Regional Contest (as coach)
• 3rd place at the 2010 ACM/ICPC Great New York Regional Contest (as coach)
• 36th place at the 2010 ACM/ICPC World Finals
• 2nd place at the 2009 ACM/ICPC Great New York Regional Contest
• 19th place at the 2006 ACM/ICPC World Finals
• 1st place at the 2005 ACM Asia Programming Contest in Chengdu
• Tsinghua Outstanding Scholarship for Undergraduates 2004 ~ 2007
• 5th place at China National Olympiad in Informatics (NOI) 2003

• My Topcoder Profile
• My Facebook
• Columbia ACM/ICPC Team
• Python Challenge (a Python programming riddle) [Walk-through]
• NOTPRON (another riddle)
• Arcane 1: The Miller Estate (an adventure flash game)
• Arcane 2: The Stone Circle (the second season)