Author(s)

Lunjin Lu

Department of Computer Science and Engineering, Oakland University, Rochester, USA..

A method is presented for incrementally computing success patterns of logic programs. The set of success patterns of a logic program with respect to an abstraction is formulated as the success set of an equational logic program modulo an equality theory that is induced by the abstraction. The method is exemplified via depth and stump abstractions. Also presented are algorithms for computing most general unifiers modulo equality theories induced by depth and stump abstractions.

Incremental Analysis, Success Patterns, Abstract Interpretation, Depth Abstract, Stump Abstraction, Logic Programs

L. Lu, "Incremental Computation of Success Patterns of Logic Programs," Journal of Software Engineering and Applications, Vol. 3 No. 3, 2010, pp. 198-207. doi: 10.4236/jsea.2010.33025.