Soundness, Idempotence and Commutativity of Set-Sharing

Details Soundness, Idempotence and Commutativity of Set-Sharing Soundness, Idempotence and Commutativity of Set-Sharing

2001-02-27

arxiv.org/abs/cs/0102030v1

Computer Science

Programming Languages

48 pages

Scientific paper

It is important that practical data-flow analyzers are backed by reliably proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic properties for an abstract domain to be well-defined and sound with respect to the concrete semantics. In logic programming, the abstract domain Sharing is a standard choice for sharing analysis for both practical work and further theoretical study. In spite of this, we found that there were no satisfactory proofs for the key properties of commutativity and idempotence that are essential for Sharing to be well-defined and that published statements of the soundness of Sharing assume the occurs-check. This paper provides a generalization of the abstraction function for Sharing that can be applied to any language, with or without the occurs-check. Results for soundness, idempotence and commutativity for abstract unification using this abstraction function are proven.

Affiliated with

Also associated with

No associations

Rating

Soundness, Idempotence and Commutativity of Set-Sharing 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 Soundness, Idempotence and Commutativity of Set-Sharing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Soundness, Idempotence and Commutativity of Set-Sharing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-563316