Yuri Gurevich
contemporaryMathematical Logic, Philosophy of Computingb. 1940
Yuri Gurevich is a mathematician and theoretical computer scientist best known for developing Abstract State Machines (ASMs), a rigorous formal model for specifying and verifying computational systems. He has made foundational contributions to mathematical logic, complexity theory, and the philosophy of computation, including a behavioral characterization of sequential algorithms known as the Sequential ASM Thesis. He is a Principal Researcher Emeritus at Microsoft Research and was previously a professor at the University of Michigan.
Notable Achievements
1
Developed Abstract State Machines (ASMs), a universal formal model of computation used in software verification and specification
2
Proved the Sequential ASM Thesis, providing the first rigorous behavioral characterization of sequential algorithms
3
Contributed to descriptive and finite model theory, including work on the expressive limits of logical systems over finite structures
4
Co-developed results in monadic second-order logic and its decidability boundaries
5
Pioneered the study of evolving algebras as a foundation for formal semantics of programming languages