Search

Prolog is a well-known logic programming language. The information on the correct partial answers (cpa) and correct call patterns (ccp) of goals is useful for static analysis of Prolog programs. Decorated tree (DT) semantics is a goal-independent denotational semantics for Prolog that has been shown to be promising in Prolog program analysis. We extend the work in [7] and propose a two-step method for achieving cpa or ccp semantics from DT semantics. This paper is mainly concerned with the design of semantic domains. [ABSTRACT FROM AUTHOR]