| 2008 |
|---|
| 84 | | Arnon Avron,
Nachum Dershowitz,
Alexander Rabinovich:
Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday
Springer 2008 |
| 83 | EE | Alexander Rabinovich:
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities.
FORMATS 2008: 93-108 |
| 82 | EE | Arnon Avron,
Nachum Dershowitz,
Alexander Rabinovich:
Boris A. Trakhtenbrot: Academic Genealogy and Publications.
Pillars of Computer Science 2008: 46-57 |
| 81 | EE | Alexander Rabinovich,
Amit Shomrat:
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey.
Pillars of Computer Science 2008: 571-588 |
| 80 | EE | Alexander Rabinovich:
The Church Problem for Countable Ordinals
CoRR abs/0811.2198: (2008) |
| 79 | EE | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
Decidable metric logics.
Inf. Comput. 206(12): 1425-1442 (2008) |
| 78 | EE | Alexander Rabinovich:
Arity hierarchy for temporal logics.
Theor. Comput. Sci. 403(2-3): 373-381 (2008) |
| 2007 |
|---|
| 77 | EE | Alexander Rabinovich,
Wolfgang Thomas:
Logical Refinements of Church's Problem.
CSL 2007: 69-83 |
| 76 | EE | Aharon Abadi,
Alexander Moshe Rabinovich,
Mooly Sagiv:
Decidable Fragments of Many-Sorted Logic.
LPAR 2007: 17-31 |
| 75 | EE | Stéphane Demri,
Alexander Rabinovich:
The Complexity of Temporal Logic with Until and Since over Ordinals.
LPAR 2007: 531-545 |
| 74 | EE | Alexander Rabinovich:
On compositionality and its limitations.
ACM Trans. Comput. Log. 8(1): (2007) |
| 73 | EE | Greta Yorsh,
Alexander Moshe Rabinovich,
Mooly Sagiv,
Antoine Meyer,
Ahmed Bouajjani:
A Logic of Reachable Patterns in Linked Data-Structures
CoRR abs/0705.3610: (2007) |
| 72 | EE | Alexander Rabinovich:
The Church Synthesis Problem with Parameters
CoRR abs/0708.3477: (2007) |
| 71 | EE | Alexander Rabinovich:
Composition Theorem for Generalized Sum.
Fundam. Inform. 79(1-2): 137-167 (2007) |
| 70 | EE | Alexander Rabinovich:
Temporal logics with incommensurable distances are undecidable.
Inf. Comput. 205(5): 707-715 (2007) |
| 69 | EE | Alexander Rabinovich:
On decidability of monadic logic of order over the naturals extended by monadic predicates.
Inf. Comput. 205(6): 870-889 (2007) |
| 68 | EE | Greta Yorsh,
Alexander Moshe Rabinovich,
Mooly Sagiv,
Antoine Meyer,
Ahmed Bouajjani:
A logic of reachable patterns in linked data-structures.
J. Log. Algebr. Program. 73(1-2): 111-142 (2007) |
| 67 | EE | Yoram Hirshfeld,
Alexander Rabinovich:
Expressiveness of Metric modalities for continuous time.
Logical Methods in Computer Science 3(1): (2007) |
| 66 | EE | Alexander Rabinovich:
The Church Synthesis Problem with Parameters.
Logical Methods in Computer Science 3(4): (2007) |
| 2006 |
|---|
| 65 | EE | Alexander Moshe Rabinovich:
Church Synthesis Problem with Parameters.
CSL 2006: 546-561 |
| 64 | EE | Alexander Moshe Rabinovich,
Wolfgang Thomas:
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates.
CSL 2006: 562-574 |
| 63 | EE | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
Expressiveness of Metric Modalities for Continuous Time.
CSR 2006: 211-220 |
| 62 | EE | Alexander Moshe Rabinovich:
Decidability and Expressive Power of Real Time Logics.
FORMATS 2006: 32 |
| 61 | EE | Greta Yorsh,
Alexander Moshe Rabinovich,
Mooly Sagiv,
Antoine Meyer,
Ahmed Bouajjani:
A Logic of Reachable Patterns in Linked Data-Structures.
FoSSaCS 2006: 94-110 |
| 60 | EE | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
An Expressive Temporal Logic for Real Time.
MFCS 2006: 492-504 |
| 59 | EE | Yoram Hirshfeld,
Alexander Rabinovich:
Expressiveness of Metric modalities for continuous time
CoRR abs/cs/0611119: (2006) |
| 58 | EE | Alexander Rabinovich:
Quantitative analysis of probabilistic lossy channel systems.
Inf. Comput. 204(5): 713-740 (2006) |
| 57 | EE | Alexander Rabinovich,
Ph. Schnoebelen:
BTL2 and the expressive power of ECTL+.
Inf. Comput. 204(7): 1023-1044 (2006) |
| 56 | EE | Danièle Beauquier,
Alexander Moshe Rabinovich,
Anatol Slissenko:
A Logic of Probability with Decidable Model Checking.
J. Log. Comput. 16(4): 461-487 (2006) |
| 2005 |
|---|
| 55 | EE | Alexander Moshe Rabinovich:
Composition Theorems for Generalized Sum and Recursively Defined Types.
Electr. Notes Theor. Comput. Sci. 123: 209-211 (2005) |
| 54 | EE | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
Timer formulas and decidable metric temporal logic.
Inf. Comput. 198(2): 148-178 (2005) |
| 53 | EE | Parosh Aziz Abdulla,
Nathalie Bertrand,
Alexander Moshe Rabinovich,
Ph. Schnoebelen:
Verification of probabilistic systems with faulty communication.
Inf. Comput. 202(2): 141-165 (2005) |
| 2004 |
|---|
| 52 | EE | Neil Immerman,
Alexander Moshe Rabinovich,
Thomas W. Reps,
Shmuel Sagiv,
Greta Yorsh:
Verification via Structure Simulation.
CAV 2004: 281-294 |
| 51 | EE | Neil Immerman,
Alexander Moshe Rabinovich,
Thomas W. Reps,
Shmuel Sagiv,
Greta Yorsh:
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics.
CSL 2004: 160-174 |
| 50 | EE | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
Logics for Real Time: Decidability and Complexity.
Fundam. Inform. 62(1): 1-28 (2004) |
| 49 | EE | D. Pardo,
Alexander Moshe Rabinovich,
Boris A. Trakhtenbrot:
Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness.
Fundam. Inform. 62(1): 123-137 (2004) |
| 48 | EE | Alexander Moshe Rabinovich:
Selection and Uniformization in Generalized Product.
Logic Journal of the IGPL 12(2): 125-134 (2004) |
| 2003 |
|---|
| 47 | EE | Parosh Aziz Abdulla,
Alexander Moshe Rabinovich:
Verification of Probabilistic Systems with Faulty Communication.
FoSSaCS 2003: 39-53 |
| 46 | EE | Alexander Moshe Rabinovich:
Quantitative Analysis of Probabilistic Lossy Channel Systems.
ICALP 2003: 1008-1021 |
| 45 | EE | Faron Moller,
Alexander Moshe Rabinovich:
Counting on CTL*: on the expressive power of monadic path logic.
Inf. Comput. 184(1): 147-159 (2003) |
| 44 | EE | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
Future temporal logic needs infinitely many modalities.
Inf. Comput. 187(2): 196-208 (2003) |
| 43 | EE | Alexander Moshe Rabinovich:
Automata over continuous time.
Theor. Comput. Sci. 300(1-3): 331-363 (2003) |
| 2002 |
|---|
| 42 | EE | Alexander Moshe Rabinovich:
Expressive Power of Temporal Logics.
CONCUR 2002: 57-75 |
| 41 | EE | Danièle Beauquier,
Alexander Moshe Rabinovich,
Anatol Slissenko:
A Logic of Probability with Decidable Model-Checking.
CSL 2002: 306-321 |
| 40 | EE | Danièle Beauquier,
Yoram Hirshfeld,
Alexander Moshe Rabinovich,
Anatol Slissenko:
The Probability Nesting Game.
Electr. Notes Theor. Comput. Sci. 68(2): (2002) |
| 39 | EE | Y. Abramson,
Alexander Moshe Rabinovich:
Decidability of Split Equivalence.
Inf. Comput. 173(1): 15-39 (2002) |
| 38 | EE | Yuri Gurevich,
Alexander Moshe Rabinovich:
Definability in Rationals with Real Order in the Background.
J. Log. Comput. 12(1): 1-11 (2002) |
| 37 | EE | Danièle Beauquier,
Alexander Moshe Rabinovich:
Monadic Logic of Order over Naturals has no Finite Base.
J. Log. Comput. 12(2): 243-253 (2002) |
| 36 | | Albert R. Meyer,
Alexander Moshe Rabinovich:
Valid Identity Problem for Shuffle Regular Expressions.
Journal of Automata, Languages and Combinatorics 7(1): 109-125 (2002) |
| 35 | EE | Alexander Moshe Rabinovich:
Finite variability interpretation of monadic logic of order.
Theor. Comput. Sci. 275(1-2): 111-125 (2002) |
| 2001 |
|---|
| 34 | EE | Alexander Moshe Rabinovich,
Shahar Maoz:
An Infinite Hierarchy of Temporal Logics over Branching Time.
Inf. Comput. 171(2): 306-332 (2001) |
| 2000 |
|---|
| 33 | EE | Alexander Moshe Rabinovich,
Shahar Maoz:
Why so Many Temporal Logics Climb up the Trees?
MFCS 2000: 629-639 |
| 32 | | Alexander Moshe Rabinovich:
Succinctness Gap between Monadic Logic and Duration Calculus.
Fundam. Inform. 42(2): 201-210 (2000) |
| 31 | | Alexander Moshe Rabinovich:
Expressive Completeness of Duration Calculus.
Inf. Comput. 156(1-2): 320-344 (2000) |
| 30 | | Yuri Gurevich,
Alexander Moshe Rabinovich:
Definability and Undefinability with Real Order at The Background.
J. Symb. Log. 65(2): 946-958 (2000) |
| 29 | EE | Alexander Moshe Rabinovich:
Star free expressions over the reals.
Theor. Comput. Sci. 233(1-2): 233-245 (2000) |
| 28 | EE | Alexander Moshe Rabinovich:
Symbolic model checking for µ-calculus requires exponential time.
Theor. Comput. Sci. 243(1-2): 467-475 (2000) |
| 1999 |
|---|
| 27 | | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
Quantitative Temporal Logic.
CSL 1999: 172-187 |
| 26 | EE | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
A Framework for Decidable Metrical Logics.
ICALP 1999: 422-432 |
| 25 | EE | Faron Moller,
Alexander Moshe Rabinovich:
On the Expressive Power of CTL.
LICS 1999: 360-369 |
| 1998 |
|---|
| 24 | EE | Alexander Moshe Rabinovich:
Expressive Completeness of Temporal Logic of Action.
MFCS 1998: 229-238 |
| 23 | EE | Alexander Moshe Rabinovich:
Modularity and Expressibility for Nets of Relations.
Acta Inf. 35(4): 293-327 (1998) |
| 22 | EE | Alexander Moshe Rabinovich:
Non-Elementary Lower Bound for Propositional Duration Calculus.
Inf. Process. Lett. 66(1): 7-11 (1998) |
| 21 | | Alexander Moshe Rabinovich:
On the Decidability of Continuous Time Specification Formalisms.
J. Log. Comput. 8(5): 669-678 (1998) |
| 20 | EE | Alexander Moshe Rabinovich:
On Translations of Temporal Logic of Actions Into Monadic Second-Order Logic.
Theor. Comput. Sci. 193(1-2): 197-214 (1998) |
| 1997 |
|---|
| 19 | | Alexander Moshe Rabinovich,
Boris A. Trakhtenbrot:
From Finite Automata toward Hybrid Systems (Extended Abstract).
FCT 1997: 411-422 |
| 18 | EE | Alexander Moshe Rabinovich:
On expressive completeness of duration and mean value calculi.
Electr. Notes Theor. Comput. Sci. 7: (1997) |
| 17 | | Alexander Moshe Rabinovich:
On Schematological Equivalence of Partially Interpreted Dataflow Networks.
Inf. Comput. 138(1): 49-87 (1997) |
| 16 | | Alexander Moshe Rabinovich:
Complexity of Equivalence Problems for Concurrent Systems of Finite Agents.
Inf. Comput. 139(2): 111-129 (1997) |
| 1996 |
|---|
| 15 | | Alexander Moshe Rabinovich:
On Schematological Equivalence of Dataflow Networks.
Inf. Comput. 124(2): 154-167 (1996) |
| 1995 |
|---|
| 14 | | M. R. Best,
Marat V. Burnashev,
Y. Levy,
Alexander Moshe Rabinovich,
Peter C. Fishburn,
A. Robert Calderbank,
Daniel J. Costello Jr.:
On a technique to calculate the exact performance of a convolutional code.
IEEE Transactions on Information Theory 41(2): 441-447 (1995) |
| 13 | | A. Robert Calderbank,
Peter C. Fishburn,
Alexander Moshe Rabinovich:
Covering properties of convolutional codes and associated lattices.
IEEE Transactions on Information Theory 41(3): 732-746 (1995) |
| 1993 |
|---|
| 12 | | A. Robert Calderbank,
Peter C. Fishburn,
Alexander Moshe Rabinovich:
Sequence Based Methods for Data Transmission and Source Compression.
AAECC 1993: 1-12 |
| 11 | | Alexander Moshe Rabinovich:
A Complete Axiomatisation for Trace Congruence of Finite State Behaviors.
MFPS 1993: 530-543 |
| 1992 |
|---|
| 10 | | Alexander Moshe Rabinovich:
Logic of Trace Languages (Extended Abstract).
CONCUR 1992: 504-517 |
| 9 | | Alexander Moshe Rabinovich:
Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract).
ICALP 1992: 696-707 |
| 8 | | Alexander Moshe Rabinovich:
Non Modularity and Expressibility for Nets of Relations.
LFCS 1992: 394-405 |
| 1991 |
|---|
| 7 | | Alexander Moshe Rabinovich,
Boris A. Trakhtenbrot:
On Nets, Algebras and Modularity.
TACS 1991: 176-203 |
| 6 | | Antoni W. Mazurkiewicz,
Alexander Moshe Rabinovich,
Boris A. Trakhtenbrot:
Connectedness and Synchronization.
Theor. Comput. Sci. 90(1): 171-184 (1991) |
| 1990 |
|---|
| 5 | | Alexander Moshe Rabinovich,
Boris A. Trakhtenbrot:
Communication among Relations (Extended Abstract).
ICALP 1990: 294-307 |
| 1989 |
|---|
| 4 | | Alexander Moshe Rabinovich,
Boris A. Trakhtenbrot:
Nets and Data Flow Interpreters
LICS 1989: 164-174 |
| 3 | | Yoram Hirshfeld,
Alexander Moshe Rabinovich,
Boris A. Trakhtenbrot:
Discerning Causality in Interleaving Behavior.
Logic at Botik 1989: 146-162 |
| 1988 |
|---|
| 2 | | Alexander Moshe Rabinovich,
Boris A. Trakhtenbrot:
Nets of processes and data flow.
REX Workshop 1988: 574-602 |
| 1987 |
|---|
| 1 | | Alexander Moshe Rabinovich:
Pomset semantics is consistenct with data flow semantics.
Bulletin of the EATCS 32: 107-117 (1987) |
