Skip to main content
Springer Nature Link
Log in

Abstracting s-semantics using a model-theoretic approach

  • Conference paper
  • First Online:
Programming Language Implementation and Logic Programming (PLILP 1994)

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

  • 260 Accesses

Abstract

A new approach for abstract interpretation of definite logic programs is introduced. The basic idea is to use an equality theory which safely approximates the Free Equality theory. The non-Herbrand model generated from this theory is used for safely approximating the s-semantics of definite logic programs. By taking equality theories which enforce so called non-terms elements to appear in the domain, one can obtain approximate s-models which encode non declarative properties of computed answer substitutions such as freeness. It is possible to formulate equality theories which lead to several well known abstract domains.

Supported by the Katholieke Universiteit Leuven.

Supported by the Belgian National Fund for Scientific Research.

Supported by the Katholieke Universiteit Leuven Research Coordination.

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.

Similar content being viewed by others

References

  1. Bancilhon,F., Ramakrishnan,R., An Amateur's Introduction to Recursive Query Processing Strategies, Proc. ACM-SIGMOD Conf., 1986, 16–52.

    Google Scholar 

  2. Boulanger,D., Bruynooghe,M., A Systematic Construction of Abstract Domains, Draft, June, 1994.

    Google Scholar 

  3. Boulanger,D., De Schreye,D., Compiling Control Revisited: A New Approach based upon Abstract Interpretation, Proc. 11-th Int. Conf. Logic Programming, 1994.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  8. Codish,M., Demoen,B., Analysing Logic Programs using Prop-ositional Logic Programs and a Magic Wand, Proc. 1993 Int. Symp. on Logic Prog., 1993, 114–129.

    Google Scholar 

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

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

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

    Google Scholar 

  12. Denecker,M., De Schreye,D., A Framework for Indeterministic Model Generation with Equality, Report CW124, K.U.Leuven, 1992.

    Google Scholar 

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

    Google Scholar 

  14. Falaschi,M., Levi,G., Martelli,M., Palamidessi,C., Declarative Modelling of the Operational Behaviour of Logic Languages, Theoretical Computer Science, 1989, Vol.69, No.3, 289–318.

    Google Scholar 

  15. Frühwirth,T., Shapiro,E., Vardi,M., Yardeni,E., Logic Programs as Types for Logic Programs, Proc. 6-th IEEE Symp. Logic in Comp. Sci., Amsterdam, July 1991.

    Google Scholar 

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

    Google Scholar 

  17. Giacobazzi,R., Debray,S., Levi,G., Generalised Semantics and Abstract Interpretation for Constraint Logic Programs, Proc. 5-th Int. Conf. FGCS, Tokyo, 1992.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  20. Lloyd,L., Foundations of Logic Programming, Springer, Berlin, 1987.

    Google Scholar 

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

    Google Scholar 

  22. Shepherdson,J., Language and Equality Theory in Logic Programming, Report No.PM-91-02, School of Mathematics, Bristol, England.

    Google Scholar 

Download references

Author information

Author notes

  1. Dmitri Boulanger

    Present address: Keldysh Institute for Applied Mathematics, Russian Academy of Science, Miusskaya sq., 4, 125047, Moscow, Russia

Authors and Affiliations

  1. Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200 A, B-3001, Heverlee, Belgium

    Dmitri Boulanger, Maurice Bruynooghe & Marc Denecker

Authors
  1. Dmitri Boulanger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maurice Bruynooghe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marc Denecker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dmitri Boulanger .

Editor information

Manuel Hermenegildo Jaan Penjam

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boulanger, D., Bruynooghe, M., Denecker, M. (1994). Abstracting s-semantics using a model-theoretic approach. In: Hermenegildo, M., Penjam, J. (eds) Programming Language Implementation and Logic Programming. PLILP 1994. Lecture Notes in Computer Science, vol 844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58402-1_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-58402-1_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58402-5

  • Online ISBN: 978-3-540-48695-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics