Orna Kupferman

Orna Kupferman
Name	Orna Kupferman
Nationality	Israel
Fields	Computer Science
Alma mater	Hebrew University of Jerusalem
Doctoral advisor	Moshe Y. Vardi
Known for	Automata theory, algorithmic verification, temporal logic

Orna Kupferman is an Israeli computer scientist known for contributions to automata theory, formal verification, and temporal logic. She has developed fundamental algorithms and theoretical frameworks that bridge logic in computer science and practical verification tools used in software and hardware design, and has held leadership positions at prominent academic and research institutions. Her work connects classical results in theory of computation with contemporary challenges in scalable model checking and synthesis.

Early life and education

Kupferman earned her undergraduate and graduate degrees at the Hebrew University of Jerusalem, where she studied under researchers active in logic and computer science. She completed a Ph.D. supervised by Moshe Y. Vardi, a noted scholar in automata theory and temporal logic, producing a dissertation that advanced connections between alternating automata and specification logics. During her formative years she interacted with researchers affiliated with institutions such as Technion – Israel Institute of Technology and international groups at the International Conference on Computer Aided Verification and ACM SIGLOG venues.

Academic career

Kupferman held faculty positions at the Hebrew University of Jerusalem and spent time collaborating with faculty at the Weizmann Institute of Science and visiting research groups at centers including Microsoft Research, Stanford University, and the Max Planck Institute for Software Systems. She supervised doctoral candidates in topics spanning model checking, synthesis, and reactive systems, and served on program committees for conferences like Computer Aided Verification, Principles of Programming Languages, and Logic in Computer Science. Kupferman has also been involved with editorial boards of journals such as Journal of the ACM, SIAM Journal on Computing, and Information and Computation.

Research contributions and notable results

Kupferman made influential advances in automata-theoretic techniques for verification, including results on alternating automata, translations between logical formalisms and automata models, and complexity bounds for decision problems. Building on work in Büchi automaton theory and the Mu-calculus, she developed constructions that improve the efficiency of translating linear-time specifications into automata suitable for model checking and reactive synthesis. Her research provided tighter worst-case bounds and practical algorithms that affected tools employed in industry research at organizations like Intel, IBM Research, and Google.

She introduced approaches to compositional verification that exploit modularity and assume-guarantee reasoning, connecting to classic results by researchers at Carnegie Mellon University and MIT. Kupferman contributed to the theoretical foundations of synthesis from temporal logic specifications, producing algorithms that reduce synthesis to automata operations and game solving, thereby relating to work on parity games and determinization procedures. Her papers explored the boundaries between decidability and intractability in specification theories, relating to decidability results from Alonzo Church's synthesis problem lineage and to complexity classifications associated with PSPACE and EXPTIME.

In concurrency and distributed systems, she analyzed verification under partial information and asynchronous interaction, linking to models studied at Cornell University and ETH Zurich. Kupferman's collaborations tackled parameterized verification and robustness of specifications, influencing follow-up studies at EPFL and in projects funded by the European Research Council and national agencies.

Awards and honors

Kupferman’s contributions have been recognized by awards and fellowships from institutions including the European Association for Theoretical Computer Science, national science foundations in Israel, and program committees that granted best paper awards at conferences such as Computer Aided Verification and International Conference on Concurrency Theory. She has been invited to keynote at venues like LICS and TACAS, and elected to leadership roles within professional societies including ACM and IEEE communities focused on formal methods and logic.

Selected publications and students

Representative publications include influential papers on automata translations, compositional verification, and synthesis from temporal logic that have appeared in proceedings of LICS, CAV, POPL, and journals such as Logical Methods in Computer Science and Journal of the ACM. Her work is often cited alongside foundational texts by Vardi, Thomas Henzinger, Edmund Clarke, and Moshe Y. Vardi. Kupferman supervised doctoral students who continued in academia and industry, joining faculties at institutions like Tel Aviv University, Bar-Ilan University, University of California, Berkeley, and research labs at Amazon and Microsoft Research.

Selected works (representative): - Papers on alternating and nondeterministic automata translations and complexity. - Articles on assume-guarantee reasoning and compositional model checking. - Contributions to synthesis algorithms for temporal logic specifications.

Category:Israeli computer scientists Category:Theoretical computer scientists Category:Women in computing