Skip to main content
Springer Nature Link
Log in

Abstract interpretation of Prolog programs

  • Session 5a: Program Analysis
  • Conference paper
  • First Online:
Third International Conference on Logic Programming (ICLP 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 225))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

12. References

  • Cousot, P. and Cousot, R., "Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints", Principles of Programming Languages, 1977.

    Google Scholar 

  • Debray, S. K., "Automatic Mode Inference for Prolog programs", Technical Report #85/019, State University of New York at Stony Brook, 1985.

    Google Scholar 

  • Jones, N. D., "Concerning the Abstract Interpretation of Prolog", draft paper, DIKU, Copenhagen, 1985.

    Google Scholar 

  • Jones, N. D. and Mycroft, A., "Data Flow Analysis of Applicative Programs using Minimal Function Graphs", Principles of Programming Languages, Florida, USA, 1986.

    Google Scholar 

  • Mellish, C. S., "The Automatic Generation of Mode Declarations for Prolog Programs", Paper presented at the Workshop on Logic Programming for Intelligent Systems, Los Angeles, 1981 (also DAI Research Paper 163, Dept of Artificial Intelligence, University of Edinburgh).

    Google Scholar 

  • Mellish, C. S., "Some Global Optimisations for a Prolog Compiler", Journal of Logic Programming, Vol 2, No 1, 1985.

    Google Scholar 

  • Mycroft, A., "The Theory and Practice of Transforming Call-by-need into Call-by-value", in Springer Lecture Notes in Computer Science, No 83, Springer Verlag, 1980.

    Google Scholar 

  • Plaisted, D., "The Occur-Check problem in Prolog", Procs of the International Symposium on Logic Programming, Atlantic City, USA, 1984.

    Google Scholar 

  • Sickel, S., "A Search Technique for Clause Interconnectivity Graphs" IEEE Trans. on Computers, C-25(8), 1976.

    Google Scholar 

  • Sintzoff, M., "Calculating Properties of Programs by Valuations on Specific Models", in Sigplan Notices Vol 7, No 1, 1972.

    Google Scholar 

  • Sondergaard, H., "An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction", DIKU, Copenhagen, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cognitive Studies Programme, University of Sussex, UK

    C. S. Mellish

Authors
  1. C. S. Mellish
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ehud Shapiro

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mellish, C.S. (1986). Abstract interpretation of Prolog programs. In: Shapiro, E. (eds) Third International Conference on Logic Programming. ICLP 1986. Lecture Notes in Computer Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16492-8_95

Download citation

  • DOI: https://doi.org/10.1007/3-540-16492-8_95

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16492-0

  • Online ISBN: 978-3-540-39831-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics