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.

[BCC04]

F. Bueno, D. Cabeza, M. Carro, M. Hermenegildo, P. López-García, and G. Puebla-(Eds.).
The Ciao System. Reference Manual (v1.10).
Technical report, School of Computer Science (UPM), 2004.
Available at http://www.ciaohome.org.

[BCHP96]

F. Bueno, D. Cabeza, M. Hermenegildo, and G. Puebla.
Global Analysis of Standard Prolog Programs.
In European Symposium on Programming, number 1058 in LNCS, pages 108--124, Sweden, April 1996. Springer-Verlag.

[BGH94]

F. Bueno, M. García de la Banda, and M. 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. 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.

[BLGPH06]

F. Bueno, P. López-García, G. Puebla, and M. Hermenegildo.
A Tutorial on Program Development and Optimization using the Ciao Preprocessor.
Technical Report CLIP2/06, Technical University of Madrid (UPM), Facultad de Informática, 28660 Boadilla del Monte, Madrid, Spain, January 2006.

[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.

[COS96]

The COSYTEC Team.
CHIP System Documentation, April 1996.

[DEDC96]

P. Deransart, A. Ed-Dbali, and L. Cervoni.
Prolog: The Standard.
Springer-Verlag, 1996.

[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. 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. 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.

[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, pages 599--613. MIT Press, 1994.

[GHM00]

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

[Her99]

M. Hermenegildo.
A Documentation Generator for Logic Programming Systems.
Technical Report CLIP10/99.0, Facultad de Informática, UPM, September 1999.

[HPMS00]

M. 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.

[JL88]

D. Jacobs and A. Langen.
Compilation of Logic Programs for Restricted And-Parallelism.
In European Symposium on Programming, pages 284--297, 1988.

[Knu84]

D. Knuth.
Literate programming.
Computer Journal, 27:97--111, 1984.

[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.

[LGHD96a]

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

[LGHD96b]

P. López-García, M. 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.

[MH89a]

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.

[MH89b]

K. Muthukumar and M. Hermenegildo.
Determination of Variable Dependence Information at Compile-Time Through Abstract Interpretation.
In 1989 North American Conference on Logic Programming, pages 166--189. MIT Press, October 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.

[PAH04]

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

[PBH00]

G. Puebla, F. Bueno, and M. Hermenegildo.
An Assertion Language for Constraint Logic Programs.
In P. Deransart, M. Hermenegildo, and J. Maluszynski, editors, Analysis and Visualization Tools for Constraint Programming, number 1870 in LNCS, pages 23--61. Springer-Verlag, September 2000.

[PRO]

The PROLOG IV Team.
PROLOG IV Manual.

[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 International Static Analysis Symposium, 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.