Skip to main content
SpringerLink
Log in

On the automatic generation of events in delta prolog

  • Abstract Interpretation
  • Conference paper
  • First Online:
Programming Language Implementation and Logic Programming (PLILP 1990)

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

  • 156 Accesses

Abstract

Delta Prolog is a concurrent logic programming language, which extends Prolog with AND-parallelism. Communication and synchronization between parallel processes is established by using special control structures: event goals.

To relieve the programmer from inserting these structures at the correct program points, we propose a method for automatically generating them, departing from a Prolog program together with the top-level call pattern and indications of which goalexpressions should be executed in parallel. This method is based on the technique of abstract interpretation. The gathered abstract information allows to decide at which program points an event goal has to be generated and how it is composed.

However, it turns out that only a limited class of programs can be transformed automatically. Problems impeding general automatic transformation are discussed.

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.

References

  1. Bansal, A.K., Incorporating parallelism in logic programs using program transformation, Ph.D. Thesis, Dept. of Computer Science, Case Western Reserve University, Cleveland, Ohio, July 1988.

    Google Scholar 

  2. Bansal, A.K., Sterling, L., On source-to-source transformation of sequential logic programs to AND-parallelism, Proc. Int. Conf. on Parallel Processing, St. Charles, Illinois, Aug. 1987, pp. 795–802.

    Google Scholar 

  3. Bruynooghe, M., Janssens, G., An instance of abstract interpretation integrating type and mode inferencing, Proc. 5th Int. Conf. and Symp. on Logic Programming, Seattle, Aug. 1988, pp. 669–683.

    Google Scholar 

  4. Bruynooghe, M., A practical framework for the abstract interpretation of logic programs, revised version of Report CW 62, Dept. of Computer Science, K.U.Leuven, 1989. (to appear in Journal of Logic Programming)

    Google Scholar 

  5. Cousot, P., Cousot, R., Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proc. 4th ACM POPL Symp., Los Angeles, June 1977, pp. 238–252.

    Google Scholar 

  6. Cunha, J. C., Ferreira, M. C., Pereira, L. M., Programming in Delta Prolog, Proc. 6th Int. Conf. on Logic Programming, Lisboa, 1989, pp. 487–502.

    Google Scholar 

  7. Debray, S.K., Warren, D.S., Automatic mode inferencing for Prolog Programs, Proc. 3rd Symp. on Logic Programming, Salt Lake City, Sept. 1986, IEEE Society Press, pp.78–88

    Google Scholar 

  8. Jones, N.D., Sondergaard, H., A semantics-based framework for the abstract interpretation of Prolog, in Abstract Interpretation of Declarative Languages, eds. S. Abramsky and C. Hankin, Ellis Horwood, 1987, pp. 123–142.

    Google Scholar 

  9. Kanamori, T., Kawamura, T., Analysing success patterns of logic programs by abstract hybrid interpretation, ICOT technical report TR 279, 1987.

    Google Scholar 

  10. Mellish, C.S., Abstract interpretation of Prolog programs, Proc. 3rd Int. Conf. on Logic Programming, London, July 1986, Springer Verlag, pp. 463–474, revised in Abstract Interpretation of Declarative Languages, eds. S. Abramsky and C. Hankin, Ellis Horwood, 1987, pp. 181–198.

    Google Scholar 

  11. Pereira, L. M., Monteiro, L. F., Cunha, J. H., Aparício, J. N., Concurrency and Communication in Delta-Prolog, IEEE International Specialist Seminar: the design and application of parallel digital processors, 1988, No 298, pp. 94–104.

    Google Scholar 

  12. Pereira, L. M., Monteiro, L., Cunha, J., Aparício, J. N., Delta Prolog, a distributed backtracking extension with events, Proc. 3rd Int. Conf. on Logic Programming, London, July 1986, Springer-Verlag, pp. 69–83

    Google Scholar 

  13. Pereira, L. M., Nasr, R., Delta-Prolog: a distributed logic programming language, Proc. Int. Conf. on Fifth Generation Computer Systems, Tokyo, 1984, pp. 283–291.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, K.U.Leuven, Celestijnenlaan 200A, B-3030, Heverlee

    Veroniek Dumortier & Maurice Bruynooghe

Authors
  1. Veroniek Dumortier
    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

Editor information

Pierre Deransart Jan Maluszyński

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dumortier, V., Bruynooghe, M. (1990). On the automatic generation of events in delta prolog. In: Deransart, P., Maluszyński, J. (eds) Programming Language Implementation and Logic Programming. PLILP 1990. Lecture Notes in Computer Science, vol 456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024193

Download citation

  • DOI: https://doi.org/10.1007/BFb0024193

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53010-7

  • Online ISBN: 978-3-540-46298-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation