Conclusions

• We have identified the types of incremental change needed for logic programs.
• And given one or more practical algorithms to handle each of these types of changes.
• We also have introduced a simple formalization of fixpoint algorithms used in generic analyzers.
• The experimental results obtained in the CIAO /&-Prolog compiler are very encouraging and show the practicality of incremental analysis.