K. Marriott, H. Sndergaard, and N. D. Jones, “Denota- tional abstract interpretation of logic programs,” ACM Transactions on Programming Languages and Systems, Vol. 16, No. 3, pp. 607–648, 1994. - References

Browse Menu >>

Browse Subjects >>

Biomedical & Life Sciences

Business & Economics

Chemistry & Materials Science

Computer Science & Communications

Earth & Environmental Sciences

Engineering

Medicine & Healthcare

Physics & Mathematics

Social Sciences & Humanities

Why Us? >>

- Open Access
- Peer-reviewed
- Rapid publication
- Lifetime hosting
- Free indexing service
- Free promotion service
- More citations
- Search engine friendly

Free SCIRP Newsletters>>

Add your e-mail address to receive free newsletters from SCIRP.

Contact Us >>

customer@scirp.org

+86 18163351462(WhatsApp)

1655362766

Paper Publishing WeChat

Book Publishing WeChat

(or Email:book@scirp.org)

Article citations
More>>

K. Marriott, H. S?ndergaard, and N. D. Jones, “Denota- tional abstract interpretation of logic programs,” ACM Transactions on Programming Languages and Systems, Vol. 16, No. 3, pp. 607–648, 1994.

has been cited by the following article:

TITLE: Incremental Computation of Success Patterns of Logic Programs

AUTHORS: Lunjin Lu

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

JOURNAL NAME: Journal of Software Engineering and Applications, Vol.3 No.3, April 8, 2010

ABSTRACT: 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.