Worst-case groundness analysis using positive Boolean functions

Journal of Logic Programming

Volumn 41, Issue 1, 1999, Pages 125-128

  Codish, Michael ^a,b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; DECISION TABLES; ITERATIVE METHODS;

WORST-CASE GROUNDNESS ANALYSIS;

LOGIC PROGRAMMING;

EID: 0032649078     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(99)00014-X     Document Type: Article

References (12)

1. T. Armstrong, K. Marriott, P. Schachte, H. Søndergaard, Boolean functions for dependency analysis: Algebraic properties and efficient representation, Science of Computer Programming 31(1) (1998) 3-45.
2. R. Bagnara, A reactive implementation of Pos using ROBDDs, in: programming Languages: Implementations, Logics and Programs, Lecture Notes in Computer Science, vol. 1140, Springer, Berlin, 1996, pp. 107-121.
3. R. Bagnara, P. Schachte, Factorizing equaivalent variable pairs in ROBDD-based implementations of Pos, in: Proceedings of the Seventh International Conference on Algebraic Methodology and Software Technology, Springer, Berlin, January 1999, to appear.
4. R. Bryant, Graph based algorithms for Boolean function manipulation, IEEE Transactions on Computers C-35 (8) (1986) 677-691.
5. M.-M. Corsini, K. Musumbu, A. Rauzy, B. Le Charlier, Efficient bottom-up abstract interpretation of PROLOG by means of constraint solving over finite domains, in: Programming Language Implementation and Logic Programming, Lecture Notes in Computer Science, vol. 714, Springer, Berlin, 1993, pp. 75-91.
6. P. Cousot, R. Cousot, Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, in: Programming Language Implementation and Logic Programming, Lecture Notes in Computer Science, vol. 631, Springer, Berlin, 1992, pp. 269-295.
7. C. Fecht, Abstrakte Interpretation logischer Programme: Theorie, Implementierung, Generierung, PhD thesis, Universität des Saarlandes, 1997.
8. A. Heaton, M. Abo-Zaed, M. Codish, A. King, P. Hill, Widening Pos for efficient and scalable groundness analysis of logic programs, Technical report, Ben-Gurion University of the Negev, 1998, ftp://ftp.cs.bgu.ac.il/pub/people/mcodish/wpos.ps.gz.
9. A. King, J.-G. Smaus, P. Hill, Quotienting share for dependency analysis, in: D. Swierstra, (Ed.), Proceedings of the European Symposium on Programming, Lecture Notes Computer Science, Springer, Berlin, March 1999, to appear.
10. K. Marriott, H. Søndergaard, Precise and efficient groundness analysis for logic programs, ACM Lett. Program. Lang. Syst. 2 (4) (1993) 181-196.
11. S. Minato, Graph-based representations of discrete functions, in: T. Sasao, M. Fujita (Eds.), Representations of Discrete Functions, Ch. 1, Kluwer Academic Publishers, Dordrecht, 1996.
12. P. Van Hentenryck, A. Cortesi, B. Le Charlier, Evaluation of the domain, Prop. Journal of Logic Programming 23 (3) (1995) 237-278.