Naomi Lindenstrauss

Research interests:

Logic Programming

Rewriting Systems

Project:

TermiLog - a system for checking termination of queries to logic programs

Selected Papers

N. Dershowitz and N. Lindenstrauss, Average Time Analyses Related to Logic Programming, ICLP'89

N. Dershowitz and N. Lindenstrauss, An Abstract Concurrent Machine for Rewriting, ALP'90

N. Dershowitz and N. Lindenstrauss, A Parallel Implementation of Equational Programming, 5th Jerusalem Conference on Information Technology, 1990

N. Dershowitz and N. Lindenstrauss, Abstract And-Parallel Machines, EUROPAR'97

N. Dershowitz and N. Lindenstrauss, Abstract And-Parallel Machines (Full Version)

N.Lindenstrauss and Y. Sagiv, Checking Termination of Queries to Logic Programs

N.Lindenstrauss and Y. Sagiv, Automatic Termination Analysis of Logic Programs, ICLP'97

N.Lindenstrauss and Y. Sagiv, Automatic Termination Analysis of Logic Programs (with Detailed experimental Results)

N.Lindenstrauss, Y. Sagiv and A.Serebrenik, TermiLog:A System for Checking Termination of Queries to Logic Programs, CAV'97

N.Lindenstrauss, Y. Sagiv and A.Serebrenik, An Example Session with TermiLog

N.Lindenstrauss, Y.Sagiv and A.Serebrenik, Unfolding the Mystery of Mergesort, LOPSTR 97, Springer LNCS

N. Dershowitz, N. Lindenstrauss and Y. Sagiv, What norms are useful for logic programs? (Transparencies of lecture presented at the 3rd International Workshop on Termination, 1997)

N. Dershowitz, N. Lindenstrauss, Y. Sagiv, and A. Serebrenik, "A General Framework for Automatic Termination Analysis of Logic Programs", Applicable Algebra in Engineering, Communication and Computing, vol. 2001, no. 1/2, pp. 117-156.

N. Lindenstrauss,Y. Sagiv and A. Serebrenik, Proving Termination for Logic Programs by the Query-Mapping Pairs Approach, in "Program Development in Computational Logic", Maurice Bruynooghe and Kung-Kiu Lau Eds., pp. 453-498, Springer LNCS 3049, 2004

Benchmark Collections

The benchmarks from D. De Schreye and S. Decorte, Termination of Logic Programs: the Never-Ending Story, J. Logic Programming, 19/20:199-260, 1994 --- zipped.

The benchmarks from D. De Schreye and S. Decorte, Termination of Logic Programs: the Never-Ending Story, J. Logic Programming, 19/20:199-260, 1994 --- unzipped.

The benchmarks from L. Plumer, Termination Proofs for Logic Programs, Springer Verlag, LNAI 446, 1990 --- zipped.

The benchmarks from L. Plumer, Termination Proofs for Logic Programs, Springer Verlag, LNAI 446, 1990 --- unzipped.

The benchmarks from K. R. Apt and D. Pedreschi, Modular Termination Proofs for Logic and Pure Proog Programs, in 'Advances in Logic Programming Theory', 183-229, Oxford University Press, 1994 --- zipped.

The benchmarks from K. R.Apt and D. Pedreschi, Modular Termination Proofs for Logic and Pure Proog Programs, in 'Advances in Logic Programming Theory', 183-229, Oxford University Press, 1994 --- unzipped.

The benchmarks from F. Bueno, M. Garcia de la Banda and M. Hermenegildo, Effectiveness of Global Analysis in Strict Independence-Based Automatic Program Parallelization, International Symposium on Logic Programming, 320-336, MIT Press, 1994 --- zipped. See also http://www.clip.dia.fi.upm.es/

The benchmarks from F. Bueno, M. Garcia de la Banda and M. Hermenegildo, Effectiveness of Global Analysis in Strict Independence-Based Automatic Program Parallelization, International Symposium on Logic Programming, 320-336, MIT Press, 1994 --- unzipped.

Various Examples --- zipped

Various Examples --- unzipped

Errata