The success pattern of Query with Call is Succ in the analysis domain AbsInt. The predicate called is identified by QKey, and RFlag says if it is recursive or not. The goal Query has variables Qv, and the call pattern is uniquely identified by N.
Cleans up the database of analysis of temporary information.
Cleanups the database of analysis, of both temporary as well as permanent information regarding abstract domain AbsInt.
Traverses the body of a clause (first argument) obtaining the Exit for a given Entry (represented by Call, since it is both the Entry of the clause and the Call for the first subgoal).
This predicate obtains the list of Prime corresponding to each non recursive clause of Sg for a given Call. It first reads those non recursive clauses by means of a bagof and then proccess each one with a loop. If there is no non recursive clause, the answer will be ['$bottom'].
It analyzes each recursive clause clause.
This complete has changed. So we add the change in the $change_list of all parents.
Id: Id of the complete of the predicate that changed Lit_Key: Key of the Literal of the complete that needs recomputing. Literal: Literal with the term F/A/C/L. Parents: Program points in which the literal is called (0 means an entry) AbsInt: Abstract Domain.
This complete has changed. So we add the change in the $change_list of all parents. If the parent is in the same SCC then we recursively mark its parents as well.
Lit_Key may be free when a clause is marked to analyze from the begining (see second clause of compute_change).
It obtains the Prime for the recursive predicate Sg with Call (which has been assigned to node Id), and the list of nodes it depends on In doing this it performs an iteration over the recursive clauses of Sg by calling to compute_change/13 and then checks if the fixpoint has been reached by calling to fixpoint/13. Fixpoint is reached if either NewList is empty (it means that Id does not depend on any node) or if Flag is a variable (it means that the information has not been modified within the iteration) LEntryInf is the list of (Entry,ExtraInfo) couples for each Clause. It will be computed in the first iteration and used in subsequent ones