Y
Yuri Gurevich
Researcher at Microsoft
Publications - 374
Citations - 12380
Yuri Gurevich is an academic researcher from Microsoft. The author has contributed to research in topics: Abstract state machines & Decidability. The author has an hindex of 54, co-authored 366 publications receiving 12043 citations. Previous affiliations of Yuri Gurevich include Bowling Green State University & Ben-Gurion University of the Negev.
Papers
More filters
BookDOI
The classical decision problem
TL;DR: The Undecidable Standard Classes for Pure Predicate Logic, a Treatise on the Transformation of the Classical Decision Problem, and some Results and Open Problems are presented.
Book
Evolving algebras 1993: Lipari guide
TL;DR: Details of Static Algebras, Conservative Determinism vs. Local Nondeterminism, and Locations and Updates can be found here.
Journal ArticleDOI
Sequential abstract-state machines capture sequential algorithms
TL;DR: Analysis of the postulates leads to the notion of sequential abstract-state machine and to the theorem in the title.
On Finite Model Theory
TL;DR: Buss et al. as mentioned in this paper gave some old and new counter-examples to classical model-theoretic theorems in the finite case and showed that the compactness theorem does not survive the transition from the classical model theory to finite model theory.
Proceedings ArticleDOI
Trees, automata, and games
Yuri Gurevich,Leo Harrington +1 more
TL;DR: This work gives here an alternative and transparent proof of Rabin's result on tree automata, which is based on ideas of his predecessors and especially those of B- and-uuml;chi-&-mdash;.