On-line Available Conference Papers

• A. Rabinovich
  Logic of Trace Languages
  In the Proceedings of Third International Conference on Concurrency Theory, volume 630 of Lect. Notes in Computer Science. Springer Verlag, pp. 504-517, 1992.
  
  
• A. Rabinovich
  A Complete Axiomatisation for Trace Congruence of Finite State Behaviors
  In 9th Conference on The Mathematical Foundations of Programming Semantics, Brooks, Main Melta, Mislove and Schmidt (Eds), Lecture Notes in Computer Science vol. 802 pages 530-543, 1994.
  
  
• A. R. Meyer and A. Rabinovich
  A solution of an interleaving decision problem by a partial order technique
  Proceedings of Partial Order Methods in Verification, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 29, 203-211, 1997.
  
  
• A. Rabinovich and B.A. Trakhtenbrot
  From Finite Automata toward Hybrid Systems
  Proceddings of Fundamentals of Computation Theory. Lecture Notes in Computer Science 1450, pp. 411-422, Springer, 1998.
  
  
• A. Rabinovich
  On Expressive Completeness of Duration and Mean Value Calculi
  In Proceedings of Express 97, Vol 7 of Electronic Notes in Theoretical Computer Science 1997.
  
  
• A. Rabinovich
  Expressive Completeness of Temporal Logic of Action
  In Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 1998, Lecture Notes in Computer Science 1450, pp. 229-238, Springer, 1998.
  
  
• Y. Hirshfeld and A. Rabinovich
  Quantitative Temporal Logic.
  In Computer Science Logic 1999, LNCS vol. 1683, pp. 172-187, Springer Verlag 1999.
  
  
• F. Moller and A. Rabinovich
  On the expressive power of CTL*.
  In Proceedings of fourteenth IEEE Symposium on Logic in Computer Science, pp. 360-369, 1999.
  
  
• Y. Hirshfeld and A. Rabinovich
  A Framework for Decidable Metrical Logics.
  In ICALP99, LNCS vol. 1644, pp. 422-432, Springer Verlag 1999.:
  
  
• A. Rabinovich and S. Maoz
  Why so many Temporal Logics Climb up the Trees?
  In Proc. 25th Int. Symp. Math. Found. Comp. Sci. (MFCS'2000), Bratislava, Slovakia, Aug. 2000, volume 1893 of Lecture Notes in Computer Science, pages 629--639. Springer, 2000.
  
  
• D. Beauquier, A. Rabinovich and A. Slissenko
  A logic of probability with decidable model-checking
  A logic of probability with decidable model-checking, In Proc. of the 16th Int. Conference on Comput. Sci. Logic 2002 , Lect. Notes in Comput. Sci., vol. 2471, pp. 306-321, Springer-Verlag, 2002.
  
  
• A. Rabinovich
  Expressive Power of Temporal Logics
  In Proc. 13th Int. Conf. on Concurrency Theory. Brno, Czech Republic Aug. 2002}, volume 2421 of Lecture Notes in Computer Science, pages 57--75. Springer, 2002.
  
  
• D. Beauquier, Y. Hirshfeld, A. Rabinovich and A. Slissenko
  The probability nesting game
  In the procedings of EXPRESS 2002, Electronic Notes of TCS. 68(2), (11 pages), 2002.
  
  
• P. Abdulla and A. Rabinovich
  Verification of Probabilistic Systems with Faulty Communication
  In Proc. FOSSACS03, Conf. on Foundations of Software Science and Computation Structures}, Springer LNCS 2620, 39-53, 2003.
  
  
• A. Rabinovich
  Quantitative Analysis of Probabilistic Lossy Channel Systems
  In . ICALP03, Springer LNCS 2719, 1008--1021, 2003.
  
  
• N. Immerman, A. Rabinovich, T. Reps, M. Sagiv and G. Yorsh
  Verification Via Structure Simulation
  In CAV 2004, Springer LNCS 3114, 281-294, 2004.
  
  
• N. Immerman, A. Rabinovich, T. Reps, M. Sagiv and G. Yorsh
  The Boundary Between Decidability and Undecidability for Transitive Closure Logics
  In CSL 04, Springer LNCS 3210, 160-174, 2004.
  
  
• G. Yorsh, A. Rabinovich, M. Sagiv, A. Meyer, A. Bouajjani.
  A Logic of Reachable Patterns in Linked Data-Structures.
  In FOSSACS06, Springer LNCS 3921, 94-110, 2006.
  
  
• Y. Hirshfeld and A. Rabinovich.
  Expressiveness of Metric modalities for continuous time.
  In CSR, Springer LNCS 3967, 211-220, 2006.
  
  
• A. Rabinovich.
  Church Synthesis Problem with Parameters.
  In CSL 2006, Springer LNCS 4207, 546-561, 2006.
  
  
• A. Rabinovich and W. Thomas.
  Decidable theories of the ordering of natural numbers with unary predicates.
  In CSL 2006, Springer LNCS 4207, 562-574, 2006.
  
  
• Y. Hirshfeld and A. Rabinovich.
  An Expressive Temporal Logic for Real Time
  In MFCS 2006, Springer LNCS 4162, 492-504, 2006.
  
  
• A. Rabinovich and W. Thomas.
  Logical Refinements of Church's Problem.
  In CSL 2007, Springer LNCS 4646, 69-83, 2007.
  
  
• A. Abadi, A. Rabinovich and M. Sagiv.
  Decidable Fragments of Many-Sorted Logic.
  In LPAR 2007, Springer LNCS 4790, 17-31, 2007.
  
  
• S. Demri and A. Rabinovich.
  The Complexity of Temporal Logic with Until and Since over Ordinals.
  In LPAR 2007, Springer LNCS 4790, 531-545, 2007.
  
  
• A. Rabinovich and A. Shomrat.
  Selection and Uniformization Problems in the Monadic Theory of Ordinals.
  In Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Springer LNCS 4800, 571-588, 2008.
  
  
• A. Rabinovich.
  Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities.
  In FORMATS 2008, Springer LNCS 5215, 93-108, 2008.
  
  
• A. Rabinovich.
  Decidable Extensions of Church's Problem.
  CSL 2009, LNCS 5771, 424-439, 2009.
  
  
• V. Barany, L. Kaiser and A. Rabinovich.
  Eliminating Cardinality Quantifiers from MLO over Trees.
  CSL 2009, LNCS 5771, 117-131, 2009.
• J. Ouaknine, A. Rabinovich, and J. Worrell. .
  Time-Bounded Verification.
  Concur 2009, LNCS 5710, 496-510, 2009.
• A. Rabinovich.
  Synthesis of Finite-state and Definable Winning Strategies.
  FSTTCS, pp. 359-370, 2009.
• M. Jenkins, J. Ouaknin, A. Rabinovich, and J. Worrell.
  Alternating Timed Automata over Bounded Time.
  In LICS 2010.
• A. Bes and A. Rabinovich.
  Decidable Expansions of Labelled Linear Orderings.
  Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday. LNCS 6300, 2010.
• A. Rabinovich.
  Temporal logics over linear time domains are in PSPACE.
  Reachability Problems (RP 2010). LNCS 6227, 2010.
• Y. Velner and A. Rabinovich.
  Church Synthesis Problem for Noisy Input.
  In FOSSACS 2011: 275-289.
• M. Jenkins, J. Ouaknin, A. Rabinovich, and J. Worrell.
  The Church Synthesis Problem with Metric.
  In In CSL 2011: 307-321.
• A. Rabinovich.
  A Proof of Kamp's theorem.
  CSL 2012: 516-527
• A. Rabinovich and S. Rubin.
  Interpretations in Trees with Countably Many Branches.
  LICS 2012: 551-560
• D. Pardo Ordentlich and A. Rabinovich.
  A Finite Basis for 'Almost Future' Temporal Logic over the Reals. MFCS 2012: 740-751
  Corrected Full version: No Future without (a hint of) Past. in Inf and Comp, 2016
  
• A. Rabinovich.
  An Unusual Temporal Logic.
  In MFCS 2013: 741-752.
• A. Rabinovich.
  On Almost Future Temporal Logics.
  In YURIFEST, Fields of Logic and Computation II 2015: 261-272
• A. Rabinovich.
  On Expressive Power of Regular Expressions over Infinite Orders
  In CSR 2016: 382-393.
• Yaron Velner, Kalev Alpernas, Aurojit Panda, Alexander Rabinovich, Mooly Sagiv, Scott Shenker, and Sharon Shoham
  Some Complexity Results for Stateful Network Verification.
  In TACAS 2016: 811-830.
• Alexander Rabinovich:
  Complementation of Finitely Ambiguous Büchi Automata.
  DLT 2018: 541-552
• Alexander Rabinovich, Doron Tiferet:
  Degrees of Ambiguity of Büchi Tree Automata.
  FSTTCS 2019: 50:1-50:14
• Alexander Rabinovich, Doron Tiferet:
  Ambiguity hierarchy of regular infinite tree languages.
  In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Schloss DagstuhlLeibniz-Zentrum f¨ur Informatik, 2020.
• Alexander Rabinovich:
  The Expressive Power of Temporal and First-Order Metric Logics.
  Fields of Logic and Computation III Lecture Notes in Computer Science 12180, Springer 2020: 226-246
• Alexander Rabinovich, Doron Tiferet:
  Degrees of ambiguity for parity tree automata.
  In 29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Schloss Dagstuhl-Leibniz-Zentrum f¨ur Informatik, 2021.