Source: http://ciao-lang.org/ciao/build/doc/ciaopp.html/ciaopp_ref_manrefs.html
Timestamp: 2019-04-20 08:37:45+00:00

Document:
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&apos;05), number 3901 in LNCS, pages 115--132. Springer-Verlag, April 2006.
E. Albert, G. Puebla, and M. V. Hermenegildo.
An Abstract Interpretation-based Approach to Mobile Code Safety.
In Proc. of Compiler Optimization meets Compiler Verification (COCV&apos;04), Electronic Notes in Theoretical Computer Science 132(1), pages 113--129. Elsevier - North Holland, April 2004.
F. Bueno, D. Cabeza, M. Carro, M. V. Hermenegildo, P. López-García, and G. Puebla-(Eds.).
The Ciao System. Reference Manual (v1.10).
The Ciao System Documentation Series--TR CLIP3/97.1.10(04), School of Computer Science, Technical University of Madrid (UPM), Facultad de Informática, 28660 Boadilla del Monte, Madrid, Spain, August 2004.
System and on-line version of the manual available at http://ciao-lang.org.
F. Bueno, P. Deransart, W. Drabent, G. Ferrand, M. V. Hermenegildo, J. Maluszynski, and G. Puebla.
On the Role of Semantic Approximations in Validation and Diagnosis of Constraint Logic Programs.
In Proc. of the 3rd. Int&apos;l Workshop on Automated Debugging--AADEBUG&apos;97, pages 155--170, Linköping, Sweden, May 1997. U. of Linköping Press.
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.
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.
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.
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.
CHIP System Documentation, April 1996.
S.K. Debray, P. López-García, M. V. Hermenegildo, and N.-W. Lin.
Estimating the Computational Cost of Logic Programs.
In Static Analysis Symposium, SAS&apos;94, number 864 in LNCS, pages 255--265, Namur, Belgium, September 1994. Springer-Verlag.
Freeness and Related Analyses of Constraint Logic Programs Using Abstract Interpretation.
PhD thesis, K.U.Leuven, Dept. of Computer Science, October 1994.
P.W. Dart and J. Zobel.
A Regular Type Language for Logic Programs.
In Types in Logic Programming, pages 157--187. MIT Press, 1992.
M. García de la Banda, M. V. Hermenegildo, and K. Marriott.
ACM Transactions on Programming Languages and Systems, 22(2):269--339, March 2000.
J. Gallagher and G. Puebla.
Abstract Interpretation over Non-Deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs.
In Fourth International Symposium on Practical Aspects of Declarative Languages, number 2257 in LNCS, pages 243--261. Springer-Verlag, January 2002.
M. V. Hermenegildo, E. Albert, P. López-García, and G. Puebla.
Some Techniques for Automated, Resource-Aware Distributed and Mobile Computing in a Multi-Paradigm Programming System.
In Proc. of EURO--PAR 2004, number 3149 in LNCS, pages 21--37. Springer-Verlag, August 2004.
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.
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.
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.
In Giorgio Levi, editor, Proceedings of SAS&apos;98, volume 1503 of LNCS, pages 230--245, Pisa, Italy, September 1998. Springer-Verlag.
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.
Technical Report ACA-ST-232-89, Microelectronics and Computer Technology Corporation (MCC), Austin, TX 78759, March 1989.
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.
Compile-time Derivation of Variable Dependency Using Abstract Interpretation.
Journal of Logic Programming, 13(2/3):315--347, July 1992.
K. Marriott and P. Stuckey.
Approximating Interaction Between Linear Arithmetic Constraints.
In 1994 International Symposium on Logic Programming, pages 571--585. MIT Press, 1994.
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.
A Generic Preprocessor for Program Validation and Debugging.
In P. Deransart, M. V. Hermenegildo, and J. Maluszynski, editors, Analysis and Visualization Tools for Constraint Programming, number 1870 in LNCS, pages 63--107. Springer-Verlag, September 2000.
Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs.
In Logic-based Program Synthesis and Transformation (LOPSTR&apos;99), number 1817 in LNCS, pages 273--292. Springer-Verlag, March 2000.
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.
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.
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.
An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction.
In European Symposium on Programming, LNCS 123, pages 327--338. Springer-Verlag, 1986.
C. Vaucheret and F. Bueno.
More Precise yet Efficient Type Inference for Logic Programs.
In 9th International Static Analysis Symposium (SAS&apos;02), volume 2477 of Lecture Notes in Computer Science, pages 102--116. Springer-Verlag, September 2002.
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.
E. Yardeni and E. Shapiro.
A Type System for Logic Programs.
Concurrent Prolog: Collected Papers, pages 211--244, 1987.

References: V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V.