References

[APG06]

E. Albert, G. Puebla, and J. Gallagher.
Non-Leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates.
In 15th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR'05), number 3901 in LNCS, pages 115--132. Springer-Verlag, April 2006.

[BGH94]

F. Bueno, M. García de la Banda, and M. V. Hermenegildo.
The PLAI Abstract Interpretation System.
Technical Report CLIP2/94.0, Computer Science Dept., Technical U. of Madrid (UPM), Facultad Informatica UPM, 28660-Boadilla del Monte, Madrid-Spain, February 1994.

[BLGH04]

F. Bueno, P. López-García, and M. V. Hermenegildo.
Multivariant Non-Failure Analysis via Standard Abstract Interpretation.
In 7th International Symposium on Functional and Logic Programming (FLOPS 2004), number 2998 in LNCS, pages 100--116, Heidelberg, Germany, April 2004. Springer-Verlag.

[CH94]

D. Cabeza and M. Hermenegildo.
Extracting Non-strict Independent And-parallelism Using Sharing and Freeness Information.
In 1994 International Static Analysis Symposium, number 864 in LNCS, pages 297--313, Namur, Belgium, September 1994. Springer-Verlag.

[CMB93]

M. Codish, A. Mulkers, M. Bruynooghe, M. García de la Banda, and M. Hermenegildo.
Improving Abstract Interpretations by Combining Domains.
In Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, pages 194--206. ACM, June 1993.

[DL93]

S. K. Debray and N. W. Lin.
Cost Analysis of Logic Programs.
ACM Transactions on Programming Languages and Systems, 15(5):826--875, November 1993.

[DLGH97]

S.K. Debray, P. López-García, and M. V. Hermenegildo.
Non-Failure Analysis for Logic Programs.
In 1997 International Conference on Logic Programming, pages 48--62, Cambridge, MA, June 1997. MIT Press, Cambridge, MA.

[DLGHL97]

S. K. Debray, P. López-García, M. V. Hermenegildo, and N.-W. Lin.
Lower Bound Cost Estimation for Logic Programs.
In 1997 International Logic Programming Symposium, pages 291--305. MIT Press, Cambridge, MA, October 1997.

[Dum94]

Veroniek Dumortier.
Freeness and Related Analyses of Constraint Logic Programs Using Abstract Interpretation.
PhD thesis, K.U.Leuven, Dept. of Computer Science, October 1994.

[DZ92]

P.W. Dart and J. Zobel.
A Regular Type Language for Logic Programs.
In Types in Logic Programming, pages 157--187. MIT Press, 1992.

[GdW94]

J.P. Gallagher and D.A. de Waal.
Fast and Precise Regular Approximations of Logic Programs.
In Pascal Van Hentenryck, editor, Proc. of the 11th International Conference on Logic Programming (ICLP'94), pages 599--613. MIT Press, 1994.

[GHM00]

M. García de la Banda, M. V. Hermenegildo, and K. Marriott.
Independence in CLP Languages.
ACM Transactions on Programming Languages and Systems, 22(2):269--339, March 2000.

[HPMS00]

M. V. Hermenegildo, G. Puebla, K. Marriott, and P. Stuckey.
Incremental Analysis of Constraint Logic Programs.
ACM Transactions on Programming Languages and Systems, 22(2):187--223, March 2000.

[HR95]

M. Hermenegildo and F. Rossi.
Strict and Non-Strict Independent And-Parallelism in Logic Programs: Correctness, Efficiency, and Compile-Time Conditions.
Journal of Logic Programming, 22(1):1--45, 1995.

[JB92]

G. Janssens and M. Bruynooghe.
Deriving Descriptions of Possible Values of Program Variables by means of Abstract Interpretation.
Journal of Logic Programming, 13(2 and 3):205--258, July 1992.

[Leu98]

M. Leuschel.
On the Power of Homeomorphic Embedding for Online Termination.
In Giorgio Levi, editor, Proceedings of SAS'98, volume 1503 of LNCS, pages 230--245, Pisa, Italy, September 1998. Springer-Verlag.

[LGHD96]

P. López-García, M. V. Hermenegildo, and S. K. Debray.
A Methodology for Granularity Based Control of Parallelism in Logic Programs.
Journal of Symbolic Computation, Special Issue on Parallel Symbolic Computation, 21(4--6):715--734, 1996.

[MBdlBH99]

K. Muthukumar, F. Bueno, M. García de la Banda, and M. Hermenegildo.
Automatic Compile-time Parallelization of Logic Programs for Restricted, Goal-level, Independent And-parallelism.
Journal of Logic Programming, 38(2):165--218, February 1999.

[MH89]

K. Muthukumar and M. Hermenegildo.
Determination of Variable Dependence Information at Compile-Time Through Abstract Interpretation.
Technical Report ACA-ST-232-89, Microelectronics and Computer Technology Corporation (MCC), Austin, TX 78759, March 1989.

[MH91]

K. Muthukumar and M. Hermenegildo.
Combined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation.
In International Conference on Logic Programming (ICLP 1991), pages 49--63. MIT Press, June 1991.

[MH92]

K. Muthukumar and M. Hermenegildo.
Compile-time Derivation of Variable Dependency Using Abstract Interpretation.
Journal of Logic Programming, 13(2/3):315--347, July 1992.

[MS94]

K. Marriott and P. Stuckey.
Approximating Interaction Between Linear Arithmetic Constraints.
In 1994 International Symposium on Logic Programming, pages 571--585. MIT Press, 1994.

[Mye86]

Eugene W Myers.
An O(ND) difference algorithm and its variations.
Algorithmica, 1(1-4):251--266, 1986.

[PAH04]

G. Puebla, E. Albert, and M. V. Hermenegildo.
Abstract Interpretation with Specialized Definitions.
Technical Report CLIP12/2004.0, Technical University of Madrid, School of Computer Science, UPM, September 2004.

[PCH03]

G. Puebla, J. Correas, and M. V. Hermenegildo.
The design of a generic framework for context-sensitive analysis of modular programs.
Technical Report CLIP7/2003.0, Technical University of Madrid, School of Computer Science, UPM, November 2003.

[PH96]

G. Puebla and M. V. Hermenegildo.
Optimized Algorithms for the Incremental Analysis of Logic Programs.
In International Static Analysis Symposium (SAS 1996), number 1145 in Lecture Notes in Computer Science, pages 270--284. Springer-Verlag, September 1996.

[SG94]

H. Saglam and J. Gallagher.
Approximating Logic Programs Using Types and Regular Descriptions.
Technical Report CSTR-94-19, Department of Computer Science, University of Bristol, Bristol BS8 1TR, 1994.

[Son86]

H. Søndergaard.
An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction.
In European Symposium on Programming, LNCS 123, pages 327--338. Springer-Verlag, 1986.

[VB02]

C. Vaucheret and F. Bueno.
More Precise yet Efficient Type Inference for Logic Programs.
In 9th International Static Analysis Symposium (SAS'02), volume 2477 of Lecture Notes in Computer Science, pages 102--116. Springer-Verlag, September 2002.

[VHCL95]

P. Van Hentenryck, A. Cortesi, and B. Le Charlier.
Type analysis of prolog using type graphs.
Journal of Logic Programming, 22(3):179--209, 1995.