Jens Palsberg

About

Jens Palsberg is a Professor of Computer Science at UCLA Samueli School of Engineering. His research interests include compilers, embedded systems, and programming languages. He has been recognized with numerous awards, including the National Science Foundation CAREER Award in 1998, the UCLA Samueli Excellence in Teaching Award in 2023, and several distinguished service awards from ACM. Palsberg has served on the executive committee of the global scientific computing society and has been an ACM Distinguished Speaker. His academic background includes a PhD from the University of Aarhus obtained in 1992. Throughout his career, he has been acknowledged for his outstanding teaching and research contributions in the field of computer science.

Research topics

• Computer Science
• Software engineering
• Quantum mechanics
• Computational science
• Discrete mathematics
• Engineering physics
• Theoretical computer science
• Systems engineering
• Mathematics
• Programming language

Selected publications

• Building a Quantum Engineering Undergraduate Program

  IEEE Transactions on Education · 2022 · 106 citations

  <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Contribution:</i> A roadmap is provided for building a quantum engineering education program to satisfy U.S. national and international workforce needs. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Background:</i> The rapidly growing quantum information science and engineering (QISE) industry will require both quantum-aware and quantum-proficient…

  DOI

• Quantum abstract interpretation

  2021 · 70 citations

  Senior authorCorresponding

  In quantum computing, the basic unit of information is a qubit. Simulation of a general quantum program takes exponential time in the number of qubits, which makes simulation infeasible beyond 50 qubits on current supercomputers. So, for the understanding of larger programs, we turn to static techniques. In this paper, we present an abstract interpretation of quantum programs and we use it to automatically verify assertions in polynomial time. Our key insight is to let an abstract state be a tup…

  PublisherDOI

• Quartz: superoptimization of Quantum circuits

  2022-06-02 · 53 citations

  articleOpen access

  Existing quantum compilers optimize quantum circuits by applying circuit transformations designed by experts. This approach requires significant manual effort to design and implement circuit transformations for different quantum devices, which use different gate sets, and can miss optimizations that are hard to find manually. We propose Quartz, a quantum circuit superoptimizer that automatically generates and verifies circuit transformations for arbitrary quantum gate sets. For a given gate set,…

  PublisherOA PDFDOI

• Sound and efficient concurrency bug prediction

  2021-08-18 · 27 citations

  articleSenior author

  Concurrency bugs are extremely difficult to detect. Recently, several dynamic techniques achieve sound analysis. M2 is even complete for two threads. It is designed to decide whether two events can occur consecutively. However, real-world concurrency bugs can involve more events and threads. Some can occur when the order of two or more events can be exchanged even if they occur not consecutively. We propose a new technique SeqCheck to soundly decide whether a sequence of events can occur in a sp…

  PublisherDOI

• Logical bytecode reduction

  2021-06-18 · 16 citations

  articleOpen accessSenior author

  Reducing a failure-inducing input to a smaller one is challenging for input with internal dependencies because most sub-inputs are invalid. Kalhauge and Palsberg made progress on this problem by mapping the task to a reduction problem for dependency graphs that avoids invalid inputs entirely. Their tool J-Reduce efficiently reduces Java bytecode to 24 percent of its original size, which made it the most effective tool until now. However, the output from their tool is often too large to be helpfu…

  PublisherOA PDFDOI

Recent grants

• CRI: CI-New: Collaborative Research: NJR: A Normalized Java Resource

  NSF · $600k · 2018–2024

• Collaborative Research: CI-P: NJR: A National Java Resource

  NSF · $58k · 2017–2018

• SHF: Small: Typed Self-Application

  NSF · $494k · 2012–2018

Frequent coauthors

• Michael I. Schwartzbach

  40 shared

• Christopher Fox

  University of Chicago

  25 shared

• Maurice Naftalin

  25 shared

• Robin Sharp

  Technical University of Denmark

  25 shared

• Hans Lcvengreen

  Cornell University

  25 shared

• Ronald Huijsman

  Cornell University

  25 shared

• J. van Katwijk

  Delft University of Technology

  25 shared

• Nico Plat

  25 shared

Education

• Ph.D., Computer Science

  University of California, Los Angeles

  1995

• M.S., Computer Science

  University of California, Los Angeles

  1991

• B.S., Computer Science

  University of California, Los Angeles

  1989

Awards & honors

• National Science Foundation CAREER Award (1998)
• Purdue University Faculty Scholar (1999-2004)
• One of the Ten Best Teachers of Undergraduates in the School…
• Okawa Foundation Research Award (2003)
• IBM Faculty Award (2005)

Similar researchers at University of California, Los Angeles

• Demetri Terzopoulosh-93
• Wei Wangh-91
• Eleazar Eskinh-83