Nothing Special   »   [go: up one dir, main page]

Skip to main content

A systematic construction of abstract domains

  • Conference paper
  • First Online:
Static Analysis (SAS 1994)

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

Included in the following conference series:

Abstract

An abstract domain construction technique for static analysis of definite logic programs is presented. A complete family of preinterpretations, induced by equality theories with non-term elements, is used as a family of abstract domains, allowing all possible levels of precision.

Supported by the K.U.Leuven.

Supported by the Belgian National Fund for Scientific Research

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Boulanger,D., Bruynooghe,M., Denecker,M., Abstracting s-semantics: A Model-Theoretic Approach, Proc. PLILP'94. (to appear)

    Google Scholar 

  2. Bossi,A., Gabrielli,M., Levi,G., Martelli,M., The s-semantics Approach: Theory and Applications, J. Logic Programming, 1994. (to appear)

    Google Scholar 

  3. Bruynooghe,M., Boulanger,D., Abstract Interpretation for (Constraint) Logic Programming, in: Constraint Programming, Eds. B.Mayoh, E.Tõugu, J.Penjam, NATO Advanced Sci. Series, Comput. and System Sci., Springer, 1994. (to appear)

    Google Scholar 

  4. Bruynooghe,M., Codish,M., Freeness, Sharing, Linearity and Correctness — All at Once, Proc. 3-rd Int. Workshop WSA'93, Springer, 1993.

    Google Scholar 

  5. Bry,F., Decker,H., Mathey,R., A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability in Deductive Databases, Proc. Extended Database Technology 1988, Venice, LNCS, Springer, 1988.

    Google Scholar 

  6. Codish,M., Dams,D., File,G., Bruynooghe,M., Freeness Analysis for Logic Programs — And Correctness?, Proc. 10-th Int. Conf. Logic Prog., 1993, 116–131.

    Google Scholar 

  7. Codish,M., Mulkers,A., Bruynooghe,M., Garcia de la Banda,M., Hermenegildo,M., Improving Abstract interpretations by Combining Domains, Proc. ACM Symp. on Partial Evaluation and Semantics based Program Manipulation, 1993.

    Google Scholar 

  8. Cousot,P., Cousot,R., Systematic Design of Program Analysis Frameworks, Proc. 6-th ACM Symp. Principles Prog. Languages, San Antonio, USA, 1979, 269–282.

    Google Scholar 

  9. Codognet,P., File, G., Computations, Abstractions and Constraints in Logic Programs, Proc. 4-th Int. Conf. Programming Languages, Oakland, USA, 1992.

    Google Scholar 

  10. Denecker,M., Knowledge Representation and Reasoning in Incomplete Logic Programming, Ph.D. Thesis, Dept. Comp. Science, K.U.Leuven, September, 1993.

    Google Scholar 

  11. Eder,E., Properties of Substitutions and Unifications, J. Symbolic Computation, 1985, Vol.1, No.1, 31–46.

    Google Scholar 

  12. Giacobazzi,R., Debray,S., Levi,G., Generalised Semantics and Abstract Interpretation for Constraint Logic Programs, J. Logic Programming, 1994. (to appear)

    Google Scholar 

  13. Gallagher,J., de Waal,D.A., Fast and Precise Regular Approximations of Logic Programs, Proc. 11-th Int. Conf. Logic Programming, 1994.

    Google Scholar 

  14. Goguen,J., Thatcher,E., Waggner,E., Wright,J., Initial Algebra Semantics and Continuous Algebras, J. ACM, 1977, Vol.24, No.1, 68–95.

    Article  Google Scholar 

  15. Janssens,G., Bruynooghe,M., Deriving Descriptions of Possible Values of Program Variables by Means of Abstract Interpretation, J. Logic Programming, 1992, Vol.13, Nos.2–3, 205–258.

    MathSciNet  Google Scholar 

  16. Jacobs,L., Langen,A., Static Analysis of Logic Programs for Independent And-Parallelism, J. Logic Programming, 1992, Vol.13, Nos.2–3, 291–314.

    Article  Google Scholar 

  17. Lassez,J.-L., Maher,M., Mariott,K., Unification Revisited, Foundations of Deductive Databases and Logic Programming, Morgan-Kaufmann, 1988, 587–625.

    Google Scholar 

  18. Mac Lane,S., Categories for the Working Mathematician, Springer-Verlag, 1971.

    Google Scholar 

  19. Lloyd,L., Foundations of Logic Programming, Springer-Verlag, Berlin, 1987.

    Google Scholar 

  20. Martelli,A., Montanari,U., An Efficient Unification Algorithm, Transaction on Programming Languages and Systems, 1982, Vol.2, No.4, 258–282.

    Article  Google Scholar 

  21. Mariott,K. Sondergaard,H., Semantics-based Data Flow Analysis of Logic Programs, Information Processing, April 1989, 601–606.

    Google Scholar 

  22. Sondergaard,H., An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction, LNCS, Vol.123, 1986, Springer, 327–338.

    Google Scholar 

  23. Shepherdson,J., Language and Equality Theory in Logic Programming, Report No.PM-88-08, School of Mathematics, Bristol, England.

    Google Scholar 

  24. Wirsing,W., Algebraic Specifications, in: Handbook of Theoretical Computer Science, North Holland, 1990, 678–778.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dmitri Boulanger .

Editor information

Baudouin Le Charlier

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boulanger, D., Bruynooghe, M. (1994). A systematic construction of abstract domains. In: Le Charlier, B. (eds) Static Analysis. SAS 1994. Lecture Notes in Computer Science, vol 864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58485-4_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-58485-4_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58485-8

  • Online ISBN: 978-3-540-49005-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics