Immediate fixpoints and their use in groundness analysis

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

Volumn 1180, Issue , 1996, Pages 359-370

  Søndergaard, Harald ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; INTELLIGENT DATABASES; LOGIC PROGRAMMING;

ABSTRACT INTERPRETATIONS; CLOSED FORM; DECLARATIVE PROGRAMS; DISTRIBUTIVE LATTICE; FIRST-ORDER FUNCTIONAL PROGRAMS; LOGIC PROGRAMS; RECURSIVE DEFINITIONS; STRICTNESS ANALYSIS;

APPLICATION PROGRAMS;

EID: 77957815096     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62034-6_63     Document Type: Conference Paper

References (13)

1. T. Armstrong, K. Maxriott, P. Schachte and H. Søndergaard. Two classes of Boolean functions for dependency analysis. To appear in Science of Computer Programming.
2. T.-R. Chuang and B. Goldberg. A syntactic approach to fixed point computation on finite domains. Proc. 1992 ACM Conf. Lisp and Functional Programming, pages 109-118. ACM Press, 1992.
3. A. Cortesi, G. File and W. Winsborough. Prop revisited: Propositional formula as abstract domain for groundness analysis. Proc. Sixth Ann. IEEE Symp. Logic in Computer Science, pages 322-327. Amsterdam, The Netherlands, 1991.
4. A. Cortesi, B. Le Charlier and P. Van Hentenryck. Evaluation of the domain Prop. Journal of Logic Programming 23 (3): 237-278, 1995.
5. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming 13 (2&3): 103-179, 1992.
6. K. Marriott and H. Søndergaard. Notes for a tutorial on abstract interpretation of logic programs. North American Conf. Logic Programming, Cleveland, Ohio, 1989.
7. K. Marriott and H. Søndergaard. Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems 2 (1-4): 181-196, 1993.
8. A. Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD Thesis, University of Edinburgh, Scotland, 1981.
9. F. Nielson and H. R. Nielson. Finiteness conditions for fixed point iteration. Proc. 1992 ACM Conf. Lisp and Functional Programming, pages 96-108. ACM Press, 1992.
10. F. Nielson and H. R. Nielson. Finiteness conditions for strictness analysis. In P. Cousot et al., Static Analysis: Proc. Third Int. Workshop. Lecture Notes in Computer Science 724, pages 194-205. Springer-Verlag, 1993.
11. H. R. Nielson and F. Nielson. Bounded fixed point iteration. Proc. Nineteenth Ann. ACM SIGPLAN-SIGACT Symp. Principles of Programming Languages, pages 71-82. ACM Press, 1992.
12. S. Rudeanu. Boolean Functions and Equations. North-Holland, 1974.
13. R. Sekar and I. V. Ramakrishnan. Fast strictness analysis based on demand propagation. ACM Trans. Programming Languages and Systems 17 (6): 896-937, 1995.