Skip to main content
SpringerLink
Log in

An efficient and precise sharing domain for logic programs

  • Posters and Demonstrations
  • Conference paper
  • First Online:
Programming Languages: Implementations, Logics, and Programs (PLILP 1996)

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

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

References

  1. Christian Fecht. GENA — a Tool for Generating Prolog Analyzers from Specifications. In Alan Mycroft, editor, Second International Symposium on Static Analysis (SAS'95), pages 418–419. Springer Verlag, LNCS 983, 1995.

    Google Scholar 

  2. D. Jacobs and A. Langen. Static analysis of logic programs for independent and-parallelism. Journal of Logic Programming, 13:291–314, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität des Saarlandes, 66041, Saarbrücken

    Christian Fecht

Authors
  1. Christian Fecht
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Herbert Kuchen S. Doaitse Swierstra

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fecht, C. (1996). An efficient and precise sharing domain for logic programs. In: Kuchen, H., Doaitse Swierstra, S. (eds) Programming Languages: Implementations, Logics, and Programs. PLILP 1996. Lecture Notes in Computer Science, vol 1140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61756-6_104

Download citation

  • DOI: https://doi.org/10.1007/3-540-61756-6_104

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61756-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation