Annals of Pure and Applied Logic
- A. Blass, Y. Gurevich, S. Shelah
- Computer Science
- 1991
A new process logic is defined, called computation paths logic (CPL), which treats lbnn~~la~ and programs essentially alike and is decidable in elementary tlmc, and also ofrcr extensions for modeling asynchronouaisynchronous concurrency and infinite computanons.
Evolving algebras 1993: Lipari guide
- Y. Gurevich
- MathematicsSpecification and validation methods
- 14 September 1995
Details of Static Algebras, Conservative Determinism vs. Local Nondeterminism, and Locations and Updates can be found here.
The Classical Decision Problem
- E. Börger, E. Grädel, Y. Gurevich
- MathematicsPerspectives in Mathematical Logic
- 15 January 1997
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.
Sequential abstract-state machines capture sequential algorithms
- Y. Gurevich
- Computer Science, MathematicsTOCL
- 1 July 2000
Analysis of the postulates leads to the notion of sequential abstract-state machine and to the theorem in the title.
On Finite Model Theory
- Y. Gurevich
- Mathematics
- 1990
The subject of this paper is the part of finite model theory intimately related to the classical model theory. In the very beginning of our career in computer science, we attended a few lectures on…
Logic in Computer Science
- Y. Gurevich
- EducationCurrent Trends in Theoretical Computer Science
- 1993
The logic in computer science is one of the literary work in this world in suitable to be reading material and this book gives reference, but also it will show the amazing benefits of reading a book.
Abstract state machines capture parallel algorithms
- A. Blass, Y. Gurevich
- Computer ScienceTOCL
- 1 October 2003
It is shown that every parallel, synchronous algorithm can be simulated, step for step, by an abstract state machine with a background that provides for multisets.
Trees, automata, and games
- Y. Gurevich, L. Harrington
- MathematicsSymposium on the Theory of Computing
- 5 May 1982
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;.
DKAL: Distributed-Knowledge Authorization Language
- Y. Gurevich, I. Neeman
- Computer ScienceIEEE Computer Security Foundations Symposium
- 23 June 2008
This work introduces a semantic safety condition that guarantees the termination of the query algorithm of DKAL, a new declarative authorization language for distributed systems based on existential fixed-point logic that is considerably more expressive than existing authorization languages in the literature.
Fixed-point extensions of first-order logic
- Y. Gurevich, S. Shelah
- Mathematics26th Annual Symposium on Foundations of Computer…
- 21 October 1985
We prove that the three extensions of first-order logic by means of positive inductions, monotone inductions, and so-called non-monotone (in our terminology, inflationary) inductions respectively,…
...
...