The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexander Moshe Rabinovich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich
    Sequence Based Methods for Data Transmission and Source Compression. [Citation Graph (0, 0)][DBLP]
    AAECC, 1993, pp:1-12 [Conf]
  2. Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
    Verification via Structure Simulation. [Citation Graph (0, 0)][DBLP]
    CAV, 2004, pp:281-294 [Conf]
  3. Alexander Moshe Rabinovich
    Expressive Power of Temporal Logics. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:57-75 [Conf]
  4. Alexander Moshe Rabinovich
    Logic of Trace Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:504-517 [Conf]
  5. Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko
    A Logic of Probability with Decidable Model-Checking. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:306-321 [Conf]
  6. Yoram Hirshfeld, Alexander Moshe Rabinovich
    Quantitative Temporal Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:172-187 [Conf]
  7. Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
    The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. [Citation Graph (0, 0)][DBLP]
    CSL, 2004, pp:160-174 [Conf]
  8. Alexander Moshe Rabinovich
    Church Synthesis Problem with Parameters. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:546-561 [Conf]
  9. Alexander Moshe Rabinovich, Wolfgang Thomas
    Decidable Theories of the Ordering of Natural Numbers with Unary Predicates. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:562-574 [Conf]
  10. Yoram Hirshfeld, Alexander Moshe Rabinovich
    Expressiveness of Metric Modalities for Continuous Time. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:211-220 [Conf]
  11. Yoram Hirshfeld, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
    Discerning Causality in Interleaving Behavior. [Citation Graph (0, 0)][DBLP]
    Logic at Botik, 1989, pp:146-162 [Conf]
  12. Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
    From Finite Automata toward Hybrid Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:411-422 [Conf]
  13. Alexander Moshe Rabinovich
    Decidability and Expressive Power of Real Time Logics. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2006, pp:32- [Conf]
  14. Parosh Aziz Abdulla, Alexander Moshe Rabinovich
    Verification of Probabilistic Systems with Faulty Communication. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:39-53 [Conf]
  15. Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
    A Logic of Reachable Patterns in Linked Data-Structures. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2006, pp:94-110 [Conf]
  16. Yoram Hirshfeld, Alexander Moshe Rabinovich
    A Framework for Decidable Metrical Logics. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:422-432 [Conf]
  17. Alexander Moshe Rabinovich
    Quantitative Analysis of Probabilistic Lossy Channel Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:1008-1021 [Conf]
  18. Alexander Moshe Rabinovich
    Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:696-707 [Conf]
  19. Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
    Communication among Relations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:294-307 [Conf]
  20. Alexander Moshe Rabinovich
    Non Modularity and Expressibility for Nets of Relations. [Citation Graph (0, 0)][DBLP]
    LFCS, 1992, pp:394-405 [Conf]
  21. Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
    Nets and Data Flow Interpreters [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:164-174 [Conf]
  22. Faron Moller, Alexander Moshe Rabinovich
    On the Expressive Power of CTL. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:360-369 [Conf]
  23. Yoram Hirshfeld, Alexander Moshe Rabinovich
    An Expressive Temporal Logic for Real Time. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:492-504 [Conf]
  24. Alexander Moshe Rabinovich
    Expressive Completeness of Temporal Logic of Action. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:229-238 [Conf]
  25. Alexander Moshe Rabinovich, Shahar Maoz
    Why so Many Temporal Logics Climb up the Trees? [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:629-639 [Conf]
  26. Alexander Moshe Rabinovich
    A Complete Axiomatisation for Trace Congruence of Finite State Behaviors. [Citation Graph (0, 0)][DBLP]
    MFPS, 1993, pp:530-543 [Conf]
  27. Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
    Nets of processes and data flow. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1988, pp:574-602 [Conf]
  28. Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
    On Nets, Algebras and Modularity. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:176-203 [Conf]
  29. Alexander Moshe Rabinovich
    Modularity and Expressibility for Nets of Relations. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:4, pp:293-327 [Journal]
  30. Alexander Moshe Rabinovich
    Pomset semantics is consistenct with data flow semantics. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1987, v:32, n:, pp:107-117 [Journal]
  31. Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko
    The Probability Nesting Game. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:68, n:2, pp:- [Journal]
  32. Alexander Moshe Rabinovich
    Composition Theorems for Generalized Sum and Recursively Defined Types. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:123, n:, pp:209-211 [Journal]
  33. Alexander Moshe Rabinovich
    On expressive completeness of duration and mean value calculi. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:7, n:, pp:- [Journal]
  34. Yoram Hirshfeld, Alexander Moshe Rabinovich
    Logics for Real Time: Decidability and Complexity. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:62, n:1, pp:1-28 [Journal]
  35. D. Pardo, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
    Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:62, n:1, pp:123-137 [Journal]
  36. Alexander Moshe Rabinovich
    Succinctness Gap between Monadic Logic and Duration Calculus. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:42, n:2, pp:201-210 [Journal]
  37. Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Ph. Schnoebelen
    Verification of probabilistic systems with faulty communication. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:202, n:2, pp:141-165 [Journal]
  38. Y. Abramson, Alexander Moshe Rabinovich
    Decidability of Split Equivalence. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:173, n:1, pp:15-39 [Journal]
  39. Yoram Hirshfeld, Alexander Moshe Rabinovich
    Future temporal logic needs infinitely many modalities. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:187, n:2, pp:196-208 [Journal]
  40. Yoram Hirshfeld, Alexander Moshe Rabinovich
    Timer formulas and decidable metric temporal logic. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:198, n:2, pp:148-178 [Journal]
  41. Faron Moller, Alexander Moshe Rabinovich
    Counting on CTL*: on the expressive power of monadic path logic. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:184, n:1, pp:147-159 [Journal]
  42. Alexander Moshe Rabinovich
    Expressive Completeness of Duration Calculus. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:156, n:1-2, pp:320-344 [Journal]
  43. Alexander Moshe Rabinovich
    On Schematological Equivalence of Dataflow Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:124, n:2, pp:154-167 [Journal]
  44. Alexander Moshe Rabinovich
    On Schematological Equivalence of Partially Interpreted Dataflow Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:138, n:1, pp:49-87 [Journal]
  45. Alexander Moshe Rabinovich
    Complexity of Equivalence Problems for Concurrent Systems of Finite Agents. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:139, n:2, pp:111-129 [Journal]
  46. Alexander Moshe Rabinovich, Shahar Maoz
    An Infinite Hierarchy of Temporal Logics over Branching Time. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:171, n:2, pp:306-332 [Journal]
  47. Alexander Moshe Rabinovich
    Selection and Uniformization in Generalized Product. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2004, v:12, n:2, pp:125-134 [Journal]
  48. Alexander Moshe Rabinovich
    Non-Elementary Lower Bound for Propositional Duration Calculus. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:1, pp:7-11 [Journal]
  49. Albert R. Meyer, Alexander Moshe Rabinovich
    Valid Identity Problem for Shuffle Regular Expressions. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:1, pp:109-125 [Journal]
  50. Yuri Gurevich, Alexander Moshe Rabinovich
    Definability and Undefinability with Real Order at The Background. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:2, pp:946-958 [Journal]
  51. Danièle Beauquier, Alexander Moshe Rabinovich
    Monadic Logic of Order over Naturals has no Finite Base. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2002, v:12, n:2, pp:243-253 [Journal]
  52. Yuri Gurevich, Alexander Moshe Rabinovich
    Definability in Rationals with Real Order in the Background. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2002, v:12, n:1, pp:1-11 [Journal]
  53. Alexander Moshe Rabinovich
    On the Decidability of Continuous Time Specification Formalisms. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1998, v:8, n:5, pp:669-678 [Journal]
  54. Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko
    A Logic of Probability with Decidable Model Checking. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2006, v:16, n:4, pp:461-487 [Journal]
  55. Antoni W. Mazurkiewicz, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
    Connectedness and Synchronization. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:90, n:1, pp:171-184 [Journal]
  56. Alexander Moshe Rabinovich
    Star free expressions over the reals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:233, n:1-2, pp:233-245 [Journal]
  57. Alexander Moshe Rabinovich
    Symbolic model checking for µ-calculus requires exponential time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:467-475 [Journal]
  58. Alexander Moshe Rabinovich
    Finite variability interpretation of monadic logic of order. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:111-125 [Journal]
  59. Alexander Moshe Rabinovich
    Automata over continuous time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:300, n:1-3, pp:331-363 [Journal]
  60. Alexander Moshe Rabinovich
    On Translations of Temporal Logic of Actions Into Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:193, n:1-2, pp:197-214 [Journal]
  61. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:2, pp:441-447 [Journal]
  62. A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich
    Covering properties of convolutional codes and associated lattices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:3, pp:732-746 [Journal]
  63. Aharon Abadi, Alexander Rabinovich, Mooly Sagiv
    Decidable Fragments of Many-Sorted Logic. [Citation Graph (0, 0)][DBLP]
    LPAR, 2007, pp:17-31 [Conf]
  64. Greta Yorsh, Alexander Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
    A Logic of Reachable Patterns in Linked Data-Structures [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

Search in 0.033secs, Finished in 0.037secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002