Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algebraic Methodology and Software Technology

AMAST 2000: Algebraic Methodology and Software Technology pp 181–196Cite as

Analysis of Downward Closed Properties of Logic Programs

  • Conference paper
  • First Online:

  • 275 Accesses

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

Abstract

We study the analysis of downward closed properties of logic programs, which are a very abstract presentation of types. We generalise to a very large class of downward closed properties the construction of the traditional domains for groundness analysis in such a way that the results enjoy the good properties of that domain. Namely, we obtain abstract domains with a clear representation made of logical formulas and with optimal and well-known abstract operations. Moreover, they can be built using the linear refinement technique, and, therefore, are provably optimal and enjoy the condensing property, which is very important for a goal-independent analysis.

Part of this work was supported by EPSRC grant GR/M05645.

Part of this work was done while Fausto Spoto was visiting the School of Computer Studies of the University of Leeds, UK.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard. Two Classes of Boolean Functions for Dependency Analysis. Science of Computer Programming, 31(1):3–45, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  2. G. Birkhoff. Lattice Theory. In AMS Colloquium Publication, third ed., 1967.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. A. Cortesi, G. Filè, and W. Winsborough. Prop Revisited: Propositional Formula as Abstract Domain for Groundness Analysis. In Proc. Sixth IEEE Symp. on Logic In Computer Science, pages 322–327. IEEE Computer Society Press, 1991.

    Google Scholar 

  6. A. Cortesi, G. Filè, and W. Winsborough. Optimal Groundness Analysis Using Propositional Logic. Journal of Logic Programming, 27(2):137–167, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  7. P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Proc. 6th ACM Symp. on Principles of Programming Languages, pages 269–282, 1979.

    Google Scholar 

  8. P. Cousot and R. Cousot. Abstract Interpretation and Applications to Logic Programs. Journal of Logic Programming, 13(2 & 3):103–179, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  9. N.J. Cutland. Computability: An Introduction to Recursive Function Theory. Cambridge University Press, 1980.

    Google Scholar 

  10. G. Filé, R. Giacobazzi, and F. Ranzato. A Unifying View on Abstract Domain Design. ACM Computing Surveys, 28(2):333–336, 1996.

    Article  Google Scholar 

  11. R. Giacobazzi, F. Ranzato, and F. Scozzari. Building Complete Abstract Interpretations in a Linear Logic-based Setting. In G. Levi, editor, Static Analysis, Proceedings of the 5th International Static Analysis Symposium SAS 98, volume 1503 of Lecture Notes in Computer Science, pages 215–229. Springer-Verlag, 1998.

    Google Scholar 

  12. Giorgio Levi and Fausto Spoto. An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs. In Catuscia Palamidessi, Hugh Glaser, and Karl Meinke, editors, Principles of Declarative Programming, volume 1490 of Lecture Notes in Computer Science, pages 152–169, Pisa, Italy, September 1998. ©Springer-Verlag.

    Chapter  Google Scholar 

  13. 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.

    Article  Google Scholar 

  14. A. Martelli and U. Montanari. An Efficient Unification Algorithm. ACM Transactions on Programming Languages and Systems, 4:258–282, 1982.

    Article  MATH  Google Scholar 

  15. F. Scozzari. Logical Optimality of Groundness Analysis. In P. Van Hentenryck, editor, Proceedings of the 4th International Static Analysis Symposium SAS’97, volume 1302 of Lecture Notes in Computer Science, pages 83–97. Springer-Verlag, 1997.

    Google Scholar 

  16. Jan-Georg Smaus, Patricia Hill, and Andy King. Mode Analysis for Typed Logic Programs. In Proc. of the LOPSTR’99 Workshop, pages 163–170, Venice, Italy, September 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Studies, University of Leeds, Leeds, LS2 9JT, UK

    Patricia M. Hill

  2. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56100, Pisa, Italy

    Fausto Spoto

Authors
  1. Patricia M. Hill
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fausto Spoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Iowa, Iowa City, IA, 52242, USA

    Teodor Rus

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hill, P.M., Spoto, F. (2000). Analysis of Downward Closed Properties of Logic Programs. In: Rus, T. (eds) Algebraic Methodology and Software Technology. AMAST 2000. Lecture Notes in Computer Science, vol 1816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45499-3_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45499-3_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67530-3

  • Online ISBN: 978-3-540-45499-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation