A practical type analysis for verification of modular prolog programs

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 2008, Pages 61-70

  Pietrzak, Paweł S ^a   Fernández, Jesús Correas ^b   Puebla, Germán ^a   Hermenegildo, Manuel V ^c,d  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^b UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^c IMDEA SOFTWARE INSTITUTE   (Spain)

^d UNIVERSITY OF NEW MEXICO   (United States)

Author keywords

Abstract interpretation; Logic programming; Modular logic programs; Program analysis; Scalability; Types; Verification

Indexed keywords

ABSTRACT INTERPRETATION; ABSTRACT INTERPRETATIONS; LIBRARY MODULES; LOGIC PROGRAMS; POLYMORPHIC TYPE SYSTEMS; PROGRAM ANALYSIS; PROLOG PROGRAMS; REANALYSIS; SCALABLE ANALYSIS; TYPE ANALYSIS;

ABSTRACTING; LOGIC PROGRAMMING; PROGRAM INTERPRETERS; SCALABILITY; SEMANTICS;

PROLOG (PROGRAMMING LANGUAGE);

EID: 58549111478     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1328408.1328418     Document Type: Conference Paper

References (40)

1. R. Barbuti and R. Giacobazzi. A bottom-up polymorphic type inference in logic programming. Science of Computer Programming, 19(3):281-313, 1992.
2. M. Bruynooghe. A Practical Framework for the Abstract Interpretation of Logic Programs. Journal of Logic Programming, 10:91-124, 1991.
3. F. Bueno, D. Cabeza, M. Carro, M. Hermenegildo, P. López- García, and G. Puebla (Eds.). The Ciao System. Ref. Manual (v1.13). Technical report, C. S. School (UPM), 2006. Available at http://www.ciaohome. org.
4. A. Casas, D. Cabeza, and M. Hermenegildo. A Syntactic Approach to Combining Functional Notation, Lazy Evaluation and Higher-Order in LP Systems. In The 8th International Symposium on Functional and Logic Programming (FLOPS'06), Fuji Susono (Japan), April 2006.
5. M. Codish and V. Lagoon. Type Dependencies for Logic Programs using ACI-unification. Journal of Theoretical Computer Science, 238:131-159, 2000.
6. J. Correas, G. Puebla, M. Hermenegildo, and F. Bueno. Experiments in Context-Sensitive Analysis of Modular Programs. In 15th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR'05), number 3901 in LNCS, pages 163-178. Springer-Verlag, April 2006.
7. P. Cousot and R. Cousot. Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. of POPL'77, pages 238-252, 1977.
8. P. Cousot and R. Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Proceedings of the Seventh ACM Conference on Functional Programming Languages and Computer Architecture, pages 170-181, La Jolla, California, 1995. ACM Press, New York, NY.
9. P.W. Dart and J. Zobel. A Regular Type Language for Logic Programs. In Types in Logic Programming, pages 157-187. MIT Press, 1992.
10. M. García de la Banda, M. Hermenegildo, M. Bruynooghe, V. Dumortier, G. Janssens, and W. Simoens. Global Analysis of Constraint Logic Programs. ACM Transactions on Programming Languages and Systems, 18(5):564-615, September 1996.
11. W. Drabent, J. Małuszýnski, and P. Pietrzak. Using parametric set constraints for locating errors in CLP programs. Theory and Practice of Logic Programming, 2(4-5):549-611, 2002.
12. J. Gallagher and K. Henriksen. Abstract domains based on regular types. In B. Demoen and V. Lifschitz, editors, ICLP 2004, Proceedings, volume 3132 of LNCS, pages 27-42. Springer-Verlag, 2004. ISBN 3-540-22671-0.
13. 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.
14. 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.
15. N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. In Proc. 17th POPL, pages 197-209, 1990.
16. N. Heintze and J. Jaffar. Semantic types for logic programs. In Pfenning (1992), pages 141-155.
17. M. Hermenegildo, G. Puebla, F. Bueno, and P. López García. Integrated Program Debugging, Verification, and Optimization Using Abstract Interpretation (and The Ciao System Preprocessor). Science of Computer Programming, 58(1-2):115-140, October 2005.
18. 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.
19. P.M. Hill and J.W. Lloyd. The Gödel Programming Language. Logic Programming Series. MIT Pres, 1994.
20. 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.
21. J.W. Lloyd. Foundations of Logic Programming. Springer, 2nd Ext. Ed., 1987.
22. L. Lu. Type Analysis of Logic Programs in the Presence of Type Definitions. In Proceedings of the 1995 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based program manipulation, pages 241-252. The ACM Press, 1995. URL http://www.oakland.edu/ l2lu/pubs/DetType.ps.
23. L. Lu. Polymorphic Type Analysis of Logic Programs by Abstract Interpretation. Journal of Logic Programming, 36(1):1-54, 1998. URL http://www.oakland.edu/ l2lu/pubs/PolyType.ps.
24. L. Lu. On Dart-Zobel Algorithm for Testing Regular Type Inclusion. SIGPLAN NOTICES, 36(9):81-85, 2001. URL http://www.oakland.edu/ L2LU/pubs/DartZobel.ps.
25. P. Mildner. Type Domains for Abstract Interpretation: A Critical Study. PhD thesis, Computing Science Department - Uppsala University, Uppsala, 1999.
26. P. Mishra. Towards a theory of types in prolog. In International Symposium on Logic Programming, pages 289-298, Silver Spring, MD, February 1984. Atlantic City, IEEE Computer Society.
27. K. Muthukumar and M. Hermenegildo. The CDG, UDG, and MEL Methods for Automatic Compile-time Parallelization of Logic Programs for Independent And-parallelism. In Int'l. Conference on Logic Programming, pages 221-237. MIT Press, June 1990.
28. 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.
29. A. Mycroft and R.A. O'Keefe. A Polymorphic Type System for Prolog. Artificial Intelligence, 23:295-307, 1984.
30. F. Pfenning, editor. Types in Logic Programming. MIT Press, 1992.
31. Benjamin C. Pierce. Types and Programming Languages. MIT Press, February 2002.
32. P. Pietrzak, J. Correas, G. Puebla, and M. Hermenegildo. Context-Sensitive Multivariant Assertion Checking in Modular Programs. In 13th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR'06), number 4246 in LNCS, pages 392-406. Springer-Verlag, November 2006.
33. G. Puebla, F. Bueno, and M. Hermenegildo. An Assertion Language for Constraint Logic Programs. In Analysis and Visualization Tools for Constraint Programming, pages 23-61. Springer LNCS 1870, 2000.
34. G. Puebla, J. Correas, M. Hermenegildo, F. Bueno, M. García de la Banda, K. Marriott, and P. J. Stuckey. A Generic Framework for Context-Sensitive Analysis of Modular Programs. In M. Bruynooghe and K. Lau, editors, Program Development in Computational Logic, A Decade of Research Advances in Logic-Based Program Development, number 3049 in LNCS, pages 234-261. Springer-Verlag, Heidelberg, Germany, August 2004. ISBN 3-540-22152-2.
35. H. Saglam and J. Gallagher. Approximating constraint logic programs using polymorphic types and regular descriptions. Technical Report CSTR-95-117, Department of Computer Science, University of Bristol, Bristol BS8 1TR, 1995.
36. Z. Somogyi, F. Henderson, and T. Conway. The Execution Algorithm of Mercury: an Efficient Purely Declarative Logic Programming Language. JLP, 29(1-3), October 1996.
37. 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.
38. P. Van Hentenryck, O. Degimbe, B. Le Charlier, and L. Michael. The Impact of Granularity in Abstract Interpretation of Prolog. In Workshop on Static Analysis, number 724 in LNCS, pages 1-14. Springer-Verlag, September 1993.
39. C. Vaucheret and F. Bueno. More Precise yet Efficient Type Inference for Logic Programs. In International Static Analysis Symposium, number 2477 in LNCS, pages 102-116. Springer-Verlag, September 2002.
40. E. Yardeni and E.Y. Shapiro. A type system for logic programs. Journal of Logic Programming, 10(2):125-154, 1990.