A comparison of three occur-check analysers

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

Volumn 1145, Issue , 1996, Pages 159-173

  Crnogorac, Lobel ^a   Kelly, Andrew D ^b   Søndergaard, Harald ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER CIRCUITS; LOGIC PROGRAMMING; MODEL CHECKING; PROLOG (PROGRAMMING LANGUAGE);

ABSTRACT INTERPRETATIONS; GLOBAL ANALYSIS; LOGIC PROGRAMS; PRECISE ANALYSIS; PREDICATE LOGIC; PROLOG INTERPRETERS; SHARING ANALYSIS; UNIFICATION ALGORITHMS;

STATIC ANALYSIS;

EID: 84957705687     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61739-6_40     Document Type: Conference Paper

References (20)

1. K. R. Apt and A. Pellegrini. Why the occur-check is not a problem. In M. Bruynooghe and M. Wirsing, editors, Proc. PLILP '92, LNCS 631, pages 69-86. Springer-Verlag, 1992.
2. K. R. Apt and A. Pellegrini. On the occur-check-free Prolog programs. ACM TOPLAS, 16(3):687-726, 1994.
3. T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard. Two classes of Boolean functions for dependency analysis. To appear in Sci. Comp. Prog.
4. J. Beer. The occur-check problem revisited. J. Logic Prog., 5:243-261, 1988.
5. R. Chadha and D. A. Plaisted. Correctness of unification without occur check in Prolog. J. Logic Prog., 18:99-122, 1994.
6. M. Codish, D. Dams, and E. Yardeni. Derivation and safety of an abstract unification algorithm for groundness and aliasing analysis. In K. Furukawa, editor, Logic Programming: Proc. Eighth Int. Conf., pages 79-93. MIT Press, 1991.
7. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. J. Logic Prog., 13(2&3):103-179, 1992.
8. L. Crnogorac, A. D. Kelly, and H. Søndergaard. A comparison of three occur-check analyses. Technical Report 96/20, Dept, of Computer Science, The University of Melbourne, 1996.
9. P. Deransart, G. Ferrand, and M. Téguia. NSTO programs (Not Subject To Occur-check). In V. Saraswat and K. Ueda, editors, Logic Programming: Proc. 1991 Int. Symp., pages 533-547. MIT Press, 1991.
10. P. Deransart and J. Maluszyński. Relating logic programs and attribute grammars. J. Logic Prog., 2(2):119-156, 1985.
11. B. Dumant. Checking the soundness of resolution schemes. In K. Apt, editor, Logic Programming: Proc. Joint Int. Conf. Symp., pages 37-51. MIT Press, 1992.
12. M. Hermenegildo, G. Puebla, K. Marriott, and P. Stuckey. Incremental analysis of logic programs. In L. Sterling, editor, Logic Programming: Proc. Twelfth Int. Conf., pages 797-811. MIT Press, 1995.
13. A. D. Kelly, A. Macdonald, K. Marriott, H. Søndergaard, P. Stuckey, and R. Yap. An optimizing compiler for CLP(7Z). In U. Montanari and F. Rossi, editors, Proc. CP'95, LNCS 976, pages 222-239. Springer-Verlag, 1995.
14. B. Le Charlier and P. Van Hentenryck. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. ACM TOPLAS, 16(1):35-101, 1994.
15. K. Marriott and H. Søndergaard. On Prolog and the occur check problem. SIGPLAN Notices, 24(5):76-82, 1989.
16. K. Marriott and H. Søndergaard. Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems, 2:181-196, 1993.
17. K. Marriott, H. Søndergaard, and N. Jones. Denotationał abstract interpretation of logic programs. ACM TOPLAS, 16(3):607-648, 1994.
18. K. Muthukumar and M. Hermenegildo. Compile-time derivation of variable dependency using abstract interpretation. J. Logic Prog., 13(2&3):315-347, 1992.
19. D. A. Plaisted. The occur-check problem in Prolog. New Generation Computing, 2(4):309-322, 1984.
20. H. Søndergaard. An application of abstract interpretation of logic programs: Occur check reduction. In B. Robinet and R. Wilhelm, editors, Proc. European Symposium on Programming, LNCS 213, pages 327-338. Springer-Verlag, 1986.