Skip to main content

Joining Abstract and Concrete Computations in Constraint Logic Programming

  • Conference paper
Book cover Algebraic Methodology and Software Technology (AMAST’93)

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 122 Accesses

Abstract

The use of standard instances of the CLP framework (e.g. CLP(Bool) and CLP (R)) for non-standard (possibly abstract) interpretations, weakens the distinction between concrete and abstract computations in semantics and analysis. We formalize this idea by applying the well known approximation techniques (e.g. the standard theory of closure operators) in conjunction with a generalized notion of constraint system, supporting any program evaluation. The “generalized semantics” resulting from this process, abstracts away from standard semantic objects, by focusing on the general properties of any (possibly non-standard) semantic definition. In constraint logic programming, this corresponds to a suitable definition of the constraint system supporting the semantic definition. Both top-down and a bottom-up semantics are considered.

The work of R. Giacobazzi and G. Levi was supported by the Esprit Basic Research Action 3012-Compulog and by “Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo” of C.N.R. under grants no. 9100880.PF69. The work of S. Debray was supported in part by the National Science Foundation under grants CCR-8901283 and CCR-9123520.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley Publishing Company, 1974.

    Google Scholar 

  2. R. Barbuti, R. Giacobazzi, and G. Levi. A General Framework for Semantics-based Bottom-up Abstract Interpretation of Logic Programs. ACM Transactions on Programming Languages and Systems, 15(l):133–181, 1993.

    Article  Google Scholar 

  3. R. Barbuti and A. Martelli. A Structured Approach to Semantics Correctness. Science of Computer Programming, 3:279–311, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. Cirulis. An Algebraization of First Order Logic with Terms. Colloquia Mathematica Societatis Jànos Bolyai, 54:125–146, 1991.

    MathSciNet  Google Scholar 

  5. P. Codognet and G. Filé. Computations, Abstractions and Constraints in Logic Programs. In Proc. Fourth Int. Conf. on Programming Languages, 1992.

    Google Scholar 

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

  7. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. Fourth ACM Symp. Principles of Programming Languages, pages 238–252, 1977.

    Google Scholar 

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

    Google Scholar 

  9. P. Cousot and N. Halbwachs. Automatic Discovery of Linear Restraints Among Variables of a Program. In Proc. Fifth ACM Symp. Principles of Programming Languages, pages 84–96, 1978.

    Google Scholar 

  10. M. Gabbrielli and G. Levi. Modeling Answer Constraints in Constraint Logic Programs. In K. Furukawa, editor, Proc. Eighth Int’l Conf. on Logic Programming, pages 238–252. The MIT Press, Cambridge, Mass., 1991.

    Google Scholar 

  11. A. Van Gelder. Deriving Constraints Among Argument Sizes in Logic Programs. In Proc. of the eleventh ACM Conference on Principles of Database Systems, pages 47–60. ACM, 1990.

    Google Scholar 

  12. R. Giacobazzi, S. K. Debray, and G. Levi. A Generalized Semantics for Constraint Logic Programs. In Proceedings of the International Conference on Fifth Generation Computer Systems 1992, pages 581–591, 1992.

    Google Scholar 

  13. L. Henkin, J.D. Monk, and A. Tarski. Cylindric Algebras. Part I and II. North-Holland, Amsterdam, 1971.

    Google Scholar 

  14. M. Hermenegildo, R. Warren, and S.K. Debray. Global flow analysis as a practical compilation tool. Journal of Logic Programming, 13(4):349–366, 1992.

    Article  Google Scholar 

  15. J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. Fourteenth Annual ACM Symp. on Principles of Programming Languages, pages 111–119. ACM, 1987.

    Google Scholar 

  16. J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems, 14(3):339–395, 1992.

    Article  Google Scholar 

  17. M. Karr. Affine Relationships Among Variables of a Program. Acta Informatica, 6:133–151, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  18. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987. Second edition.

    Google Scholar 

  19. K. Marriott and H. Sondergaard. Analysis of Constraint Logic Programs. In S. K. Debray and M. Hermenegildo, editors, Proc. North American Conf. on Logic Programming’90, pages 531–547. The MIT Press, Cambridge, Mass., 1990.

    Google Scholar 

  20. Oystein Ore. Combinations of Closure Relations. Annals of Mathematics, 44(3):514–533, 1943.

    Article  MATH  MathSciNet  Google Scholar 

  21. V. A. Saraswat, M. Rinard, and P. Panangaden. Semantic Foundation of Concurrent Constraint Programming. In Proc. Eighteenth Annual ACM Symp. on Principles of Programming Languages, pages 333–353. ACM, 1991.

    Google Scholar 

  22. Jichang Tan and I-Peng Lin. Compiling Dataflow Analysis of Logic Programs. In A CM Programming Language Design and Implementation, volume 27 of SIGPLAN Notices, pages 106–115. ACM Press, 1992.

    Google Scholar 

  23. M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733–742, 1976.

    Article  MATH  Google Scholar 

  24. K. Verschaetse and D. De Schreye. Derivation of Linear Size Relations by abstract interpretation. In M. Bruynooghe and M. Wirsing, editors, Proc. of PLILP’92, volume 631 of Lecture Notes in Computer Science, pages 296–310. Springer-Verlag, Berlin, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 British Computer Society

About this paper

Cite this paper

Giacobazzi, R., Levi, G., Debray, S.K. (1994). Joining Abstract and Concrete Computations in Constraint Logic Programming. In: Nivat, M., Rattray, C., Rus, T., Scollo, G. (eds) Algebraic Methodology and Software Technology (AMAST’93). Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3227-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3227-1_10

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19852-9

  • Online ISBN: 978-1-4471-3227-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics