A
Alexander Rabinovich
Researcher at Tel Aviv University
Publications - 139
Citations - 2260
Alexander Rabinovich is an academic researcher from Tel Aviv University. The author has contributed to research in topics: Monadic predicate calculus & Decidability. The author has an hindex of 26, co-authored 139 publications receiving 2202 citations. Previous affiliations of Alexander Rabinovich include University of Texas at El Paso & University of Oxford.
Papers
More filters
Journal Article
Logics for Real Time: Decidability and Complexity
TL;DR: This work defines a quantitative temporal logic that is based on a simple modality within the framework of monadic predicate Logic that is as expressive as any logic suggested in the literature.
Journal ArticleDOI
The complexity of multi-mean-payoff and multi-energy games
Yaron Velner,Krishnendu Chatterjee,Laurent Doyen,Thomas A. Henzinger,Alexander Rabinovich,Jean-François Raskin +5 more
TL;DR: The first solution of multi-mean-payoff games with infinite-memory strategies is presented, and it is shown that mean-pay off-sup objectives can be decided in NP ?
Book ChapterDOI
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
TL;DR: To reason effectively about programs, it is important to have some version of a transitive-closure operator so that the authors can describe such notions as the set of nodes reachable from a program’s variables.
Book ChapterDOI
A logic of reachable patterns in linked data-structures
TL;DR: A new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates is defined, and it is possible to use the logic to automatically prove partial correctness of programs performing low-level heap mutations.