Deriving Abstract Semantics for Forward Analysis of Normal Logic Programs

Details Deriving Abstract Semantics for Forward Analysis of Normal Logic Programs Deriving Abstract Semantics for Forward Analysis of Normal Logic Programs

1998-11-06

arxiv.org/abs/cs/9811012v1

Computer Science

Programming Languages

39 pages

Scientific paper

The problem of forward abstract interpretation of {\em normal} logic programs has not been formally addressed in the literature although negation as failure is dealt with through the built-in predicate ! in the way it is implemented in Prolog. This paper proposes a solution to this problem by deriving two generic fixed-point abstract semantics $F^b and $F^\diamond for forward abstract interpretation of {\em normal} logic programs. $F^b$ is intended for inferring data descriptions for edges in the program graph where an edge denotes the possibility that the control of execution transfers from its source program point to its destination program point. $F^\diamond$ is derived from $F^b$ and is intended for inferring data descriptions for textual program points.

Affiliated with

Also associated with

No associations

Rating

Deriving Abstract Semantics for Forward Analysis of Normal Logic Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deriving Abstract Semantics for Forward Analysis of Normal Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deriving Abstract Semantics for Forward Analysis of Normal Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-584508