Yuri Gurevich

Yuri Gurevich
Name	Yuri Gurevich
Birth date	1947
Birth place	Kharkiv
Nationality	Soviet Union; Israel; United States
Fields	Computer Science; Mathematical Logic; Theory of Computation
Alma mater	Kharkiv State University; Weizmann Institute of Science; University of Pennsylvania
Known for	Abstract State Machines; Model Theory; Logic in Computer Science

Yuri Gurevich

Yuri Gurevich is a computer scientist and logician known for work in model theory, the theory of computation, and the development of the Abstract State Machines framework. He has held positions at institutions including the Weizmann Institute of Science, the University of Pennsylvania, and Microsoft Research, and has collaborated with researchers associated with the Association for Computing Machinery, the Institute of Electrical and Electronics Engineers, and the American Mathematical Society. His work interfaces with topics that appear in the contexts of Alonzo Church, Alan Turing, Kurt Gödel, Leonid Levin, Stephen Cook, Donald Knuth, Leslie Lamport, Edsger Dijkstra, Michael Rabin, and Dana Scott.

Early life and education

Born in Kharkiv in 1947, he studied at Kharkiv State University and was influenced by scholars linked to Soviet Academy of Sciences, Andrey Kolmogorov, Israel Gelfand, and the tradition of Moscow State University. He emigrated to Israel and continued graduate work at the Weizmann Institute of Science, interacting with researchers connected to Eliyahu Rips and Amnon Neeman, and later moved to the United States to work with faculty at the University of Pennsylvania and collaborators associated with Princeton University and Harvard University.

Academic career

Gurevich held academic and research positions at the Weizmann Institute of Science, the University of Pennsylvania, and international research centers such as Microsoft Research, where he collaborated with practitioners tied to ACM SIGPLAN, IEEE Computer Society, and the Association for Computing Machinery. He has supervised students who went on to appointments at institutions including Massachusetts Institute of Technology, Stanford University, University of California, Berkeley, Cornell University, and Tel Aviv University. His teaching and visiting appointments connected him with departments of Rutgers University, Carnegie Mellon University, and Technion – Israel Institute of Technology.

Research contributions

Gurevich’s research spans model theory, finite model theory, descriptive complexity, and formal methods; his contributions relate to foundational figures and results such as Tarski, Gödel, Church, Turing, Cook–Levin theorem, P versus NP problem, and the Curry–Howard correspondence. He is best known for developing the Abstract State Machines (ASM) thesis, a formalism that provides operational semantics comparable to work by Tony Hoare, Robin Milner, C.A.R. Hoare, Dana Scott, and J. Barkley Rosser. The ASM framework has been applied to formalize programming languages, protocols, and architectures studied by teams at Sun Microsystems, Intel Corporation, IBM, Oracle Corporation, and Google. His papers engage with concepts and results from model theory pioneers like Saharon Shelah, Wilfrid Hodges, Per Lindström, and Joan Bagaria, and intersect with complexity theory research by Richard Karp, Madhu Sudan, Sanjeev Arora, and Shafi Goldwasser. Gurevich contributed to formal verification efforts related to logics used in Z notation and B-Method work influenced by Jean-Raymond Abrial and to semantics connected with ALGOL, Pascal, C++, and Java. He also worked on algorithmic decidability questions associated with Presburger arithmetic, Skolem–Mahler–Lech theorem, and decision problems studied by Alfred Tarski and Emil Post.

Awards and honors

Gurevich’s recognitions include fellowships, invited lectures, and awards from organizations such as the Association for Computing Machinery, the American Mathematical Society, the European Association for Theoretical Computer Science, and the National Academy of Sciences in contexts of symposia honoring figures like Andrei Kolmogorov and Paul Erdős. He has given plenary talks at conferences including STOC, FOCS, LICS, CADE, and ICFP, and has been an editor for journals associated with Springer, Elsevier, and the ACM Transactions on Computational Logic.

Selected publications

Key publications include foundational papers on Abstract State Machines, articles in proceedings of Proceedings of the ACM, and chapters in volumes from Springer Lecture Notes in Computer Science and Cambridge University Press. He has contributed to collections honoring scholars such as Alonzo Church, Kurt Gödel, Alan Turing, and John von Neumann, and coauthored papers with researchers affiliated with Harvard University, Stanford University, Princeton University, University of Oxford, and École Normale Supérieure.

Personal life and legacy

Gurevich’s legacy is reflected in the adoption of ASMs in industrial specification projects at companies like Microsoft, IBM, and Oracle and in academic curricula at MIT, Stanford, UC Berkeley, Tel Aviv University, and Weizmann Institute of Science. His influence is cited alongside that of Donald Knuth, Edsger Dijkstra, Tony Hoare, and Robin Milner in texts on semantics and formal methods used in coursework at Carnegie Mellon University and Princeton University. He has been involved in editorial boards and program committees of conferences affiliated with ACM, IEEE, and the European Association for Theoretical Computer Science, contributing to the dissemination of research linked to figures such as Leslie Lamport, Michael Sipser, Neil Immerman, and Moshe Vardi.

Category:Computer scientists Category:Mathematical logicians Category:1947 births Category:Living people