Naomi Lindenstrauss

Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: Proving Termination for Logic Programs by the Query-Mapping Pairs Approach. Program Development in Computational Logic 2004: 453-498

Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: A General Framework for Automatic Termination Analysis of Logic Programs. Appl. Algebra Eng. Commun. Comput. 12(1/2): 117-156 (2001)

Naomi Lindenstrauss, Nachum Dershowitz: Abstract and-parallel Machines. Computers and Artificial Intelligence 19(5) (2000)

Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: Automatic Termination Analysis of Programs Containing Arithmetic Predicates. CoRR cs.PL/0011036 (2000)

Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: A General Framework for Automatic Termination Analysis of Logic Programs. CoRR cs.PL/0012008 (2000)

Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: Automatic Termination Analysis of Programs Containing Arithmetic Predicates. Electr. Notes Theor. Comput. Sci. 30(1): 39-58 (1999)

Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: TermiLog: A System for Checking Termination of Queries to Logic Programs. CAV 1997: 444-447

Nachum Dershowitz, Naomi Lindenstrauss: Abstract And-Parallel Machines. Euro-Par 1997: 1221-1225

Naomi Lindenstrauss, Yehoshua Sagiv: Automatic Termination Analysis of Logic Programs. ICLP 1997: 63-77

Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: Unfolding the Mystery of Mergesort. LOPSTR 1997: 206-225

Nachum Dershowitz, Naomi Lindenstrauss (Eds.): Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13-15, 1994, Proceedings. Lecture Notes in Computer Science 968, Springer 1995, isbn 3-540-60381-6

Nachum Dershowitz, Naomi Lindenstrauss: An Abstract Concurrent Machine for Rewriting. ALP 1990: 318-331

Nachum Dershowitz, Naomi Lindenstrauss: Average Time Analyses Related to Logic Programming. ICLP 1989: 369-381

Naomi Lindenstrauss: A Parallel Implementation of Rewriting and Narrowing. RTA 1989: 569-573