Skip to main content

Abstracting Properties in Concurrent Constraint Programming

  • Conference paper
Book cover Logic for Programming and Automated Reasoning (LPAR 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1705))

  • 271 Accesses

Abstract

We present a denotational semantics for concurrent constraint programming based on derivations containing sequences of interactions of a process with the environment. Our semantic is then used as collecting semantics for abstracting properties of computations by applying techniques of abstract interpretation.

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

  2. P. Cousot and R. Cousot. Abstract Interpretation Frameworks. Journal of Logic and Computation, 2(4):511–549, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  3. F. S. de Boer and C. Palamidessi. A Fully Abstract Model of Concurrent Logic Languages. Technical report, Dipartimento di Informatica, Università di Pisa, 1990.

    Google Scholar 

  4. R. Gerth, M. Codish, Y. Lichtenstein, and E. Shapiro. Fully abstract denotational semantics for Concurrent Prolog. In Proc. Third IEEE Symp. on Logic In Computer Science, pages 320–335. IEEE Computer Society Press, 1988.

    Google Scholar 

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

    Google Scholar 

  6. R. Moreno. A Semantic Framework for the Analysis of Concurrent Constraint Programming. In M. Falaschi, M. Navarro, and A. Policriti, editors, Proceedings of the APPIA-GULP-PRODE’97 Joint Conference on Declarative Programming, 1997.

    Google Scholar 

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

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moreno, R. (1999). Abstracting Properties in Concurrent Constraint Programming. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds) Logic for Programming and Automated Reasoning. LPAR 1999. Lecture Notes in Computer Science(), vol 1705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48242-3_14

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics