Advertisement

Two applications of an incremental analysis engine for (constraint) logic programs

  • Andrew D. Kelly
  • Kim Marriott
  • Harald SØndergaard
  • Peter J. Stuckey
System Descriptions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1145)

Keywords

Logic Program Logic Programming Abstract Interpretation Program Transformation Incremental Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    L. Crnogorac, A. Kelly, and H. SØndergaard. A comparison of three occur-check analysers. In this volume.Google Scholar
  2. 2.
    M. Hermenegildo, K. Marriott, G. Puebla and P. Stuckey. Incremental analysis of logic programs. In L. Sterling, editor, Proc. Twelfth Int. Conf. Logic Programming, pages 797–811. MIT Press, 1995.Google Scholar
  3. 3.
    A. Kelly, A. Macdonald, K. Marriott, P. Stuckey, and R. Yap. Effectiveness of optimizing compilation for CLP({ie386-01}). To appear in M. Maher, editor, Proc. Thirteenth Joint Int. Conf. Symp. Logic Programming. MIT Press, 1996.Google Scholar
  4. 4.
    B. Le Charlier and P. Van Hentenryck. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. ACM Transactions on Programming Languages and Systems 16 (1): 35–101, 1994.CrossRefGoogle Scholar
  5. 5.
    K. Muthukumar and M. Hermenegildo. Compile-time derivation of variable dependency using abstract interpretation. Journal of Logic Programming 13 (2&3): 315–347, 1992.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Andrew D. Kelly
    • 1
  • Kim Marriott
    • 1
  • Harald SØndergaard
    • 1
  • Peter J. Stuckey
    • 2
  1. 1.Dept. of Computer ScienceMonash UniversityClaytonAustralia
  2. 2.Dept. of Computer ScienceUniversity of MelbourneParkvilleAustralia

Personalised recommendations