Gurevich, Yuri
Overview
Works:  79 works in 207 publications in 5 languages and 2,198 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Honoree, Editor, Creator, Other 
Classifications:  QA9, 511.3 
Publication Timeline
.
Most widely held works by
Yuri Gurevich
The classical decision problem by
E Börger(
Book
)
25 editions published between 1996 and 2001 in 3 languages and held by 342 WorldCat member libraries worldwide
25 editions published between 1996 and 2001 in 3 languages and held by 342 WorldCat member libraries worldwide
Abstract state machines : theory and applications : international workshop, ASM 2000, Monte Verità, Switzerland, March 2000
: proceedings by
Yuri Gurevich(
Book
)
26 editions published between 2000 and 2002 in English and held by 272 WorldCat member libraries worldwide
This book constitutes the thoroughly refereed postproceedings of the International Workshop on Abstract State Machines, ASM 2000, held in Monte Verita, Switzerland in March 2000. The 12 revised full papers presented were carefully reviewed and selected from 30 submissions. Also included are an introductory overview, two reports on industrial ASM applications, as well as six contributions based on invited talks. All in all, the volume competently presents the state of the art in research and applications of abstract state machines
26 editions published between 2000 and 2002 in English and held by 272 WorldCat member libraries worldwide
This book constitutes the thoroughly refereed postproceedings of the International Workshop on Abstract State Machines, ASM 2000, held in Monte Verita, Switzerland in March 2000. The 12 revised full papers presented were carefully reviewed and selected from 30 submissions. Also included are an introductory overview, two reports on industrial ASM applications, as well as six contributions based on invited talks. All in all, the volume competently presents the state of the art in research and applications of abstract state machines
Computer science logic : 7th workshop, CSL '93, Swansea, United Kingdom, September 1317, 1993 : selected papers by
E Börger(
Book
)
16 editions published in 1994 in English and Italian and held by 225 WorldCat member libraries worldwide
"This volume contains the final versions of a collection of papers presented at the Annual Conference of the European Association for Computer Science Logic, CSL '93, held at Swansea, UK in September 1993. The 21 full papers included were selected from a total of 62 submissions and essentially contribute to the whole area of computer science logic research. They are devoted to such topics as set constraints, lambda calculi, process algebras, program semantics, intuitionistic logics, fixedpoint logics, the equivalence problem, Horn clauses, quantifiers, and proof tranformations."PUBLISHER'S WEBSITE
16 editions published in 1994 in English and Italian and held by 225 WorldCat member libraries worldwide
"This volume contains the final versions of a collection of papers presented at the Annual Conference of the European Association for Computer Science Logic, CSL '93, held at Swansea, UK in September 1993. The 21 full papers included were selected from a total of 62 submissions and essentially contribute to the whole area of computer science logic research. They are devoted to such topics as set constraints, lambda calculi, process algebras, program semantics, intuitionistic logics, fixedpoint logics, the equivalence problem, Horn clauses, quantifiers, and proof tranformations."PUBLISHER'S WEBSITE
Tests and proofs : first international conference, TAP 2007, Zurich, Switzerland, February 1213, 2007 : revised papers by
Yuri Gurevich(
Book
)
16 editions published in 2007 in English and held by 107 WorldCat member libraries worldwide
This book constitutes the thoroughly refereed postproceedings of the First International Conference on Test and Proofs, TAP 2007, held in Zurich, Switzerland in February 2007. The 12 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers are devoted to the convergence of software proofing and testing and feature current research work that combines ideas from both sides to foster software quality. Topics addressed are generation of test cases or oracles by theorem proving, constraint logic programming, model checking, or symbolic execution; program proving with the aid of testing techniques; automatic tools; case studies; formal frameworks; as well as verification techniques combining proofs and tests
16 editions published in 2007 in English and held by 107 WorldCat member libraries worldwide
This book constitutes the thoroughly refereed postproceedings of the First International Conference on Test and Proofs, TAP 2007, held in Zurich, Switzerland in February 2007. The 12 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers are devoted to the convergence of software proofing and testing and feature current research work that combines ideas from both sides to foster software quality. Topics addressed are generation of test cases or oracles by theorem proving, constraint logic programming, model checking, or symbolic execution; program proving with the aid of testing techniques; automatic tools; case studies; formal frameworks; as well as verification techniques combining proofs and tests
Semantics of programming languages and model theory(
Book
)
7 editions published in 1993 in English and held by 94 WorldCat member libraries worldwide
7 editions published in 1993 in English and held by 94 WorldCat member libraries worldwide
Fields of logic and computation : essays dedicated to Yuri Gurevich on the occasion of his 70th birthday by
Andreas Blass(
)
5 editions published in 2010 in English and held by 67 WorldCat member libraries worldwide
This Festschrift volume, published in honor of Yuri Gurevich on the occasion of his 70th birthday, contains contributions, written by his colleagues. The collection of articles herein begins with an academic biography, an annotated list of Yuri's publications and reports, and a personal tribute by Jan Van den Bussche. These are followed by 28 technical contributions. These articles  though they cover a broad range of topics  represent only a fraction of Yuri Gurevich's multiple areas of interest
5 editions published in 2010 in English and held by 67 WorldCat member libraries worldwide
This Festschrift volume, published in honor of Yuri Gurevich on the occasion of his 70th birthday, contains contributions, written by his colleagues. The collection of articles herein begins with an academic biography, an annotated list of Yuri's publications and reports, and a personal tribute by Jan Van den Bussche. These are followed by 28 technical contributions. These articles  though they cover a broad range of topics  represent only a fraction of Yuri Gurevich's multiple areas of interest
Computer Science Logic 7th Workshop, CSL '93 Swansea, United Kingdom September 1317, 1993 Selected Papers by
E Börger(
)
1 edition published in 1994 in English and held by 28 WorldCat member libraries worldwide
1 edition published in 1994 in English and held by 28 WorldCat member libraries worldwide
Existential secondorder logic over strings by
Thomas Eiter(
)
2 editions published between 1997 and 1998 in English and held by 9 WorldCat member libraries worldwide
2 editions published between 1997 and 1998 in English and held by 9 WorldCat member libraries worldwide
Partisan corroboration, and shifted pairing by
Yuri Gurevich(
Book
)
4 editions published in 1998 in English and held by 8 WorldCat member libraries worldwide
Abstract: "The Herbrand theorem plays a fundamental role in automated theorem proving methods based on global variable or rigid variable approaches. The kernel step in procedures based on such methods can be described as the corroboration problem (also called the Herbrand skeleton problem), where, given a positive integer m, called multiplicity, and a quantifier free formula, one seeks for a valid or provable (in classical firstorder logic) disjunction of m instantiations of that formula. In logic with equality this problem was recently shown to be undecidable. The first main contribution of this paper is a logical theorem, that we call the Partisan Corroboration Theorem, that enables us to show that, for a certain interesting subclass of Horn formulas, corroboration with multiplicity one can be reduced to corroboration with any given multiplicity. The second main contribution of this paper is a finite tree automata formalization of a technique called shifted pairing for proving undecidability results via direct encodings of valid Turing machine computations. We call it the Shifted Pairing Theorem. By using the Partisan Corroboration Theorem, the Shifted Pairing Theorem, and term rewriting techniques in equational reasoning, we improve upon a number of recent undecidability results related to the corroboration problem, the simultaneous rigid Eunification problem and the prenex fragment of intuitionistic logic with equality."
4 editions published in 1998 in English and held by 8 WorldCat member libraries worldwide
Abstract: "The Herbrand theorem plays a fundamental role in automated theorem proving methods based on global variable or rigid variable approaches. The kernel step in procedures based on such methods can be described as the corroboration problem (also called the Herbrand skeleton problem), where, given a positive integer m, called multiplicity, and a quantifier free formula, one seeks for a valid or provable (in classical firstorder logic) disjunction of m instantiations of that formula. In logic with equality this problem was recently shown to be undecidable. The first main contribution of this paper is a logical theorem, that we call the Partisan Corroboration Theorem, that enables us to show that, for a certain interesting subclass of Horn formulas, corroboration with multiplicity one can be reduced to corroboration with any given multiplicity. The second main contribution of this paper is a finite tree automata formalization of a technique called shifted pairing for proving undecidability results via direct encodings of valid Turing machine computations. We call it the Shifted Pairing Theorem. By using the Partisan Corroboration Theorem, the Shifted Pairing Theorem, and term rewriting techniques in equational reasoning, we improve upon a number of recent undecidability results related to the corroboration problem, the simultaneous rigid Eunification problem and the prenex fragment of intuitionistic logic with equality."
Fenomenos de contacto y sus aplicaciones en celdas solares by
Yuri Gurevich(
Book
)
3 editions published between 2010 and 2012 in Spanish and held by 5 WorldCat member libraries worldwide
3 editions published between 2010 and 2012 in Spanish and held by 5 WorldCat member libraries worldwide
Toward logic tailored for computational complexity by
Yuri Gurevich(
Book
)
3 editions published in 1984 in English and held by 5 WorldCat member libraries worldwide
3 editions published in 1984 in English and held by 5 WorldCat member libraries worldwide
Fixedpoint extensions of firstorder logic by
Yuri Gurevich(
Book
)
3 editions published in 1985 in English and held by 5 WorldCat member libraries worldwide
3 editions published in 1985 in English and held by 5 WorldCat member libraries worldwide
Reconsidering Turing's thesis : (toward more realistic semantics of programs) by
Yuri Gurevich(
Book
)
2 editions published in 1984 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 1984 in English and held by 5 WorldCat member libraries worldwide
Existential secondorder logic over strings by
Thomas Eiter(
Book
)
3 editions published between 1997 and 1998 in English and held by 5 WorldCat member libraries worldwide
3 editions published between 1997 and 1998 in English and held by 5 WorldCat member libraries worldwide
Algebraic operational semantics and Occam by
Yuri Gurevich(
Book
)
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We generalize algebraic operational semantics from sequential languages to distributed, concurrent languages using Occam as an example. Elsewhere, we will discuss applications to the study of verification and transformation of programs."
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We generalize algebraic operational semantics from sequential languages to distributed, concurrent languages using Occam as an example. Elsewhere, we will discuss applications to the study of verification and transformation of programs."
Evolving Algebras: A Novel Specification and Verification Methodology(
Book
)
4 editions published between 1996 and 1997 in English and held by 2 WorldCat member libraries worldwide
The Evolving Algebra Methodology originated at Michigan and, from the beginning, was supported by ONR. Recently the term "Evolving Algebra" has been replaced with the term "Abstract State Machines" abbreviated to ASM. During the period in question, the ASM theory has been advanced and many ASM applications have been successfully realized. The ASM methodology spread to many countries including many European countries, e.g. France, Germany, Switzerland. Annual ASM workshops have been established. The latest ASM workshop took place in June 1997 in France; see http://www.tik.ee.ethz.ch/ kut ter/ASMworkshop/1997/. Two ASM workshop will take place in 1998: one in France and one in Germany. General information about the current state of affairs in the ASM field can be found at http://www.eecs.umich.edu/gasm/. An ASM interpreter has been improved here at Michigan; additional ASM tools have been; in particular see http://www.icsi.berkeley.edu/ maffy/gem. In the rest of the report, we provide an annotated list of the articles of the principal investigator and his students written, at least partiallv. during the period in question
4 editions published between 1996 and 1997 in English and held by 2 WorldCat member libraries worldwide
The Evolving Algebra Methodology originated at Michigan and, from the beginning, was supported by ONR. Recently the term "Evolving Algebra" has been replaced with the term "Abstract State Machines" abbreviated to ASM. During the period in question, the ASM theory has been advanced and many ASM applications have been successfully realized. The ASM methodology spread to many countries including many European countries, e.g. France, Germany, Switzerland. Annual ASM workshops have been established. The latest ASM workshop took place in June 1997 in France; see http://www.tik.ee.ethz.ch/ kut ter/ASMworkshop/1997/. Two ASM workshop will take place in 1998: one in France and one in Germany. General information about the current state of affairs in the ASM field can be found at http://www.eecs.umich.edu/gasm/. An ASM interpreter has been improved here at Michigan; additional ASM tools have been; in particular see http://www.icsi.berkeley.edu/ maffy/gem. In the rest of the report, we provide an annotated list of the articles of the principal investigator and his students written, at least partiallv. during the period in question
Cambridge Tracts in Theoretical Computer Science, Volume 9 by
Marianne Southall Winslett(
)
1 edition published in 2011 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 2011 in English and held by 0 WorldCat member libraries worldwide
Cambridge Tracts in Theoretical Computer Science, 49 by
Ladislav Novak(
)
1 edition published in 1999 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 1999 in English and held by 0 WorldCat member libraries worldwide
The uncertain reasoner's companion : a mathematical perspective by
J. B Paris(
)
1 edition published in 2009 in English and held by 0 WorldCat member libraries worldwide
Reasoning under uncertainty, that is, making judgements with only partial knowledge, is a major theme in artificial intelligence. Professor Paris provides here an introduction to the mathematical foundations of the subject. It is suited for readers with some knowledge of undergraduate mathematics but is otherwise selfcontained, collecting together the key results on the subject and formalizing within a unified framework the main contemporary approaches and assumptions. The author has concentrated on giving clear mathematical formulations, analyses, justifications and consequences of the main theories about uncertain reasoning, so the book can serve as a textbook for beginners or as a starting point for further basic research into the subject. It will be welcomed by graduate students and research workers in logic, philosophy and computer science as an account of how mathematics and artificial intelligence can complement and enrich each other
1 edition published in 2009 in English and held by 0 WorldCat member libraries worldwide
Reasoning under uncertainty, that is, making judgements with only partial knowledge, is a major theme in artificial intelligence. Professor Paris provides here an introduction to the mathematical foundations of the subject. It is suited for readers with some knowledge of undergraduate mathematics but is otherwise selfcontained, collecting together the key results on the subject and formalizing within a unified framework the main contemporary approaches and assumptions. The author has concentrated on giving clear mathematical formulations, analyses, justifications and consequences of the main theories about uncertain reasoning, so the book can serve as a textbook for beginners or as a starting point for further basic research into the subject. It will be welcomed by graduate students and research workers in logic, philosophy and computer science as an account of how mathematics and artificial intelligence can complement and enrich each other
Fields of logic and computation II : essays dedicated to Yuri Gurevich on the occasion of his 75th birthday by
Wolfram Schulte(
)
1 edition published in 2015 in English and held by 0 WorldCat member libraries worldwide
Fields of Logic and Computation II This Festschrift has been published in honor of Yuri Gurevich, on the occasion of his 75th birthday. Yuri Gurevich has made a number of fundamental contributions℗ℓ to the broad spectrum of logic and computer science, including decision procedures, the monadic theory of order, abstract state machines, formal methods, foundations of computer science, security, and much more. Many of these areas are reflected in the 20 articles in this Festschrift and in the presentations at the ℓ́ℓYurifestℓ́ℓ symposium, which was held in Berlin, Germany, on September 11 and 12, 2015. The Yurifest symposium was colocated with the℗ℓ24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
1 edition published in 2015 in English and held by 0 WorldCat member libraries worldwide
Fields of Logic and Computation II This Festschrift has been published in honor of Yuri Gurevich, on the occasion of his 75th birthday. Yuri Gurevich has made a number of fundamental contributions℗ℓ to the broad spectrum of logic and computer science, including decision procedures, the monadic theory of order, abstract state machines, formal methods, foundations of computer science, security, and much more. Many of these areas are reflected in the 20 articles in this Festschrift and in the presentations at the ℓ́ℓYurifestℓ́ℓ symposium, which was held in Berlin, Germany, on September 11 and 12, 2015. The Yurifest symposium was colocated with the℗ℓ24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Börger, E. (Egon) 1946 Author Editor
 Meyer, Bertrand 1950
 Grädel, Erich 1958 Author
 Meinke, K. (Karl) Editor
 Blass, Andreas 1947 Author Editor
 Dershowitz, Nachum Editor
 Beklemishev, Lev Dmitrievich 1967 Editor
 Finkbeiner, Bernd Editor
 Schulte, Wolfram Editor
 Thiele, Lothar
Useful Links
Associated Subjects
Artificial intelligence Automatic theorem proving Computational linguistics Computer logic Computer programming Computer science Computer scienceMathematics Computer software Computer softwareQuality control Computer softwareReliability Computer softwareTesting Database management Decidability (Mathematical logic) Firstorder logic Formal methods (Computer science) Herbrand's theorem (Number theory) Horn clauses Information theory Logic, Symbolic and mathematical Logic design Machine theory Programming languages (Electronic computers) Programming languages (Electronic computers)Semantics Reasoning Semantics Software engineering Uncertainty Uncertainty (Information theory)
Alternative Names
Gurevich, Yuri
Yuri Gurevich American computer scientist
Yuri Gurevich Amerikaans informaticus
Languages
Covers