An experiment in domain refinement: Type domains and type representations for logic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1490, Issue , 1998, Pages 152-169

  Levi, Giorgio ^a   Spoto, Fausto ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Abstract domain; Abstract interpretation; Logic programming; Static analysis; Type analysis

Indexed keywords

COMPUTER CIRCUITS; ITERATIVE METHODS; LOGIC PROGRAMMING;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; ABSTRACT OPERATOR; DOMAIN REFINEMENT; FIXPOINTS; LOGIC PROGRAMS; TYPE ANALYSIS; TYPE SYSTEMS;

STATIC ANALYSIS;

EID: 84947807198     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056613     Document Type: Conference Paper

References (19)

1. K. R. Apt and E. Marchiori. Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing, 6(6A):743-765, 1994.
2. T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard. Boolean functions for dependency analysis: Algebraic properties and efficient representation. In B. Le Charlier, editor, Proc. Static Analysis Symposium, SAS’94, volume 864 of Lecture Notes in Computer Science, pages 266-280. Springer-Verlag, 1994.
3. R. Barbuti and R. Giacobazzi. A Bottom-up Polymorphic Type Inference in Logic Programming. Science of Computer Programming, 19(3):281-313, 1992.
4. J. Boye. Directional Types in Logic Programming. PhD thesis, Linköping University (Sweden), 1996.
5. M. Codish and B. Demoen. Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. In Proc. of the first International Symposium on Static Analysis, volume 864 of Lecture Notes in Computer Science, pages 281-296. Springer-Verlag, 1994.
6. M. Codish and V. Lagoon. Type dependencies for logic programs using ACI-unification. In Proceedings of the 1996 Israeli Symposium on Theory of Computing and Systems, pages 136-145. IEEE Press, June 1996. Extended version to appear in Theoretical Computer Science.
7. A. Cortesi, G. File, and W. Winsborough. Optimal Groundness Analysis Using Propositional Logic. Journal of Logic Programming, 27(2):137-167, 1996.
8. P. Cousot and R. Cousot. Abstract Interpretation and Applications to Logic Programs. Journal of Logic Programming, 13(2 & 3):103-179, 1992.
9. G. File, R. Giacobazzi, and F. Ranzato. A unifying view on abstract domain design. ACM Computing Surveys, 28(2):333-336, 1996.
10. T. Frühwirth, E. Shapiro, M. Y. Vardi, and E. Yardeni. Logic Programs as Types for Logic Programs. In Albert R. Meyer, editor, Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science, pages 300-309, Amsterdam, The Netherlands, July 1991. IEEE Computer Society Press.
11. J. Gallagher and D. A. de Waal. Fast and Precise Regular Approximation of Logic Programs. In Pascal Van Hentenryck, editor, Proceedings of the Eleventh, International Conference on Logic Programming, pages 599-613, Santa Margherita Ligure, Italy, 1994. The MIT Press.
12. R. Giacobazzi and F. Scozzari. Intuitionistic implication in abstract interpretation. In H. Glaser, P. Hartel, and H. Kuchen, editors, Proceedings of Ninth International Symposium on Programming Languages, Implementations, Logics and Programs PLILP’97, volume 1292 of Lecture Notes in Computer Science, pages 175-189. Springer-Verlag, 1997.
13. G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming, 13(2 & 3):205-258, 1992.
14. T. Kanomori and K. Horiuchi. Polymorphic Type Inference in Prolog by Abstract Interpretation. In Logic Programming 87-Tokyo, volume 315 of Lecture Notes in Computer Science, pages 195-214. Springer-Verlag, 1988.
15. M. Kifer and J. Wu. A first-order theory of types and polymorphism in logic programming. In IEEE Symposium on logic in Computer Science, 1991.
16. C. Pyo and U. S. Reddy. Inference of Polymorphic Types for Logic Programming. In E. Lusk and R. Overbeek, editors, Proc. North American Conf. on Logic Programming’89, pages 1115-1132. The MIT Press, 1989.
17. F. Scozzari. Logical optimality of groundness analysis. In P. Van Hentenryck, editor, Proceedings of International Static Analysis Symposium, SAS’97, volume 1302 of Lecture Notes in Computer Science, pages 83-97. Springer-Verlag, 1997.
18. J. Xu and D. S. Warren. A Type Inference System for Prolog. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth Inťl Conf. on Logic Programming, pages 604-619. The MIT Press, 1988.
19. E. Yardeni and E. Shapiro. A Type System for Logic Programs. Journal of Logic Programming, 10:125-135, 1991.