Nachum Dershowitz

SOME FAVORITE PUBLICATIONS

     
  1. Nachum Dershowitz and Zohar Manna, Aug. 1979, “Proving Termination With Multiset Orderings”, Communications of the ACM, vol. 22, no. 8, pp. 465-476.
  2. Nachum Dershowitz, Mar. 1982, “Orderings for Term-Rewriting Systems”, Theoretical Computer Science, vol. 17, no. 3, pp. 279-301.
  3. Nachum Dershowitz, 1983, The Evolution of Programs, Birkhauser, Boston, MA.
  4. Jieh Hsiang and Nachum Dershowitz, July 1983, “Rewrite Methods for Clausal and Non-Clausal Theorem Proving”, European Association of Theoretical Computer Science, Proceedings of the Tenth International Colloquium on Automata, Languages and Programming (Barcelona, Spain), Lecture Notes in Computer Science, vol. 154, Springer-Verlag, Berlin, pp. 331-346.
  5. Nachum Dershowitz, Mitsuhiro Okada, and G. Sivakumar, July 1987, “Confluence of Conditional Rewrite Systems”, Proceedings of the First International Workshop on Conditional Term Rewriting Systems (Orsay, France), S. Kaplan and J.-P. Jouannaud, eds., Lecture Notes in Computer Science, vol. 308, Springer-Verlag, Berlin, pp. 31-44.
  6. Nachum Dershowitz and David A. Plaisted, 1988, “Equational Programming”, in: Machine Intelligence 11: The logic and acquisition of knowledge, J. E. Hayes, D. Michie and J. Richards, eds., chap. 2, Oxford Press, Oxford, pp. 21-56.
  7. Nachum Dershowitz and Shmuel Zaks, 1989, “Patterns in Trees”, Discrete Applied Mathematics, vol. 25, no. 3, pp. 241-255.
  8. Nachum Dershowitz, 1989, “Completion and Its Applications”, in: Resolution of Equations in Algebraic Structures, vol. 2: Rewriting Techniques, H. Ait-Kaci and M. Nivat, eds., chap. 2, Academic Press, New York, pp. 31-86.
  9. Leo Bachmair, Nachum Dershowitz and David A. Plaisted, 1989, “Completion Without Failure”, in: Resolution of Equations in Algebraic Structures, vol. 2: Rewriting Techniques, H. Ait-Kaci and M. Nivat, eds., chap. 1, Academic Press, New York, pp. 1-30.
  10. Nachum Dershowitz and Jean-Pierre Jouannaud, 1990, “Rewrite Systems”, in: Handbook of Theoretical Computer Science, vol. B: Formal Methods and Semantics, chap. 6, pp. 243-320, J. van Leeuwen, ed., North-Holland, Amsterdam.
  11. Nachum Dershowitz, Stéphane Kaplan, and David A. Plaisted, 1991, “Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, ...”, Theoretical Computer Science, vol. 83, no. 1, pp. 71-96.
  12. Nachum Dershowitz and Uday Reddy, 1993, “Deductive and Inductive Synthesis of Equational Programs”, J. of Symbolic Computation, vol. 15, pp. 467-494.
  13. Leo Bachmair and Nachum Dershowitz, Mar. 1994, “Equational Inference, Canonical Proofs, and Proof Orderings”, J. of the Association of Computing Machinery, vol. 41, no. 2, pp. 236-276.
  14. Nachum Dershowitz, 1995, “Hierarchical Termination”, Proceedings of the International Workshop on Conditional and Typed Rewriting Systems (Jerusalem, Israel, July 1994), N. Dershowitz and N. Lindenstrauss, eds., Lecture Notes in Computer Science, vol. 968, Springer-Verlag, Berlin, Germany, pp. 89-105.
  15. Nachum Dershowitz and Charles Hoot, May 1995, “Natural Termination”, Theoretical Computer Science, vol. 142, no. 2, pp. 179-207.
  16. Nachum Dershowitz and Subrata Mitra, July 1999, “Jeopardy”, Proceedings of the Tenth International Conference on Rewriting Techniques and Applications (Trento, Italy), P. Narendran and M. Rusinowitch, eds., Lecture Notes in Computer Science, vol. 1631, Springer-Verlag, Berlin, pp. 16-29.
  17. Nachum Dershowitz and Edward M. Reingold, 2002, Calendrical Tabulations, Cambridge University Press.
  18. Nachum Dershowitz and Iddo Tzameret, August 2003, “Gap Embedding for Well-quasi Orderings”, Proceedings of the 10th Workshop on Logic, Language, Information and Computation, Ouro Preto, Minas Gerais, Brazil; Electronic Notes in Computer Science, vol. 84, Sept. 2003.
  19. Nachum Dershowitz, editor, 2003, Verification — Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, Lecture Notes in Computer Science, vol. 2772, Springer-Verlag, Berlin, Germany.
  20. Nachum Dershowitz, Sept. 2004, “Termination by Abstraction”, Proceedings of the Twentieth International Conference on Logic Programming, St. Malo, France, Lecture Notes in Computer Science, vol. 3132, Springer-Verlag, Berlin, pp. 1-18.
  21. Nachum Dershowitz and Claude Kirchner, 2006, “Abstract Canonical Presentations”, Theoretical Computer Science, vol. 357, nos. 1-3, pp. 53-69.
  22. Maria Paola Bonacina and Nachum Dershowitz, 2006, “Abstract Canonical Inference”, ACM Transactions on Computational Logic, vol. 8, no. 1, article 6.
  23. Udi Boker and Nachum Dershowitz, 2006, “Comparing Computational Power”, Logic Journal of the IGPL, vol. 14, no. 5, pp. 633-648.
  24. Nachum Dershowitz and Edward M. Reingold, 2008, Calendrical Calculations (3rd ed.), Cambridge University Press.
  25. Yuri Gurevich and Nachum Dershowitz, Sept. 2008, “A Natural Axiomatization of Church's Thesis”, Bulletin of Symbolic Logic, vol. 14, no. 3, pp. 299-350.
  26. Lior Wolf, Rotem Littman, Naama Mayer, Tanya German, Nachum Dershowitz, Roni Shweka, and Yaacov Choueka, October 2010, “Automatically Identifying Join Candidates in the Cairo Genizah”, International Journal of Computer Vision, pp. 1-18.