1 / 12

Lecture 9 Illustrations

Lecture 9 Illustrations. Lattices. Fixpoints Abstract Interpretation. Partially Ordered Set (A, ≤). x ≤ x x ≤ y / y ≤ x  x = y (else it is only pre-order) x ≤ y / y ≤ z  x ≤ z Typical example: (A, ), where A  2 U for some U. Hasse diagram. Key Terminology.

hadar
Download Presentation

Lecture 9 Illustrations

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 9 Illustrations Lattices. Fixpoints Abstract Interpretation

  2. Partially Ordered Set (A, ≤) x ≤ xx≤ y /\ y ≤ x  x = y (else it is only pre-order)x ≤ y /\ y ≤ z  x ≤ z Typical example: (A,), where A  2U for some U Hasse diagram

  3. Key Terminology Let S  A. upper bound of S: bigger than all dual: lower bound maximal element of S: there’s no bigger dual: minimal element greatest element of S: upper bound on S, in S dual: least element

  4. Least Upper Bound Denoted lub(S), least upper bound of S is an element M, if it exists, such that M is the least element of the set U = {x | x is upper bound on S} In other words: • M is an upper bound on S • For every other upper bound M’ on S, we have that M ≤ M’ Note: same definition as “inf” in real analysis • applies not only to total orders, but any partial order

  5. Real Analysis Take as S the open interval of reals (0,1) = { x | 0 < x < 1 } Then • S has no maximal element • S thus has no greatest element • 2, 2.5, 3, … are all upper bounds on S • lub(S)=1 If we had rational numbers, there would be no lub(S’) in general.

  6. Shorthand a1 a2 denotes lub({a1,a2}) (…(a1 a2) ) an is, in fact, lub({a1,…, an}) So the operation is ACU • associative • commutative • idempotent

  7. Consider sets of all subsets of U Do these exist, and if so, what are they? • lub({s1,s2}) • lub(S)

  8. Two More Examples

  9. Does every pair of elements in this order have least upper bound? Dually, does it have greatest lower bound?

  10. Approximation of Sets by Supersets

  11. Domain of Intervals The domain elements, D, are • pairs (L,U) where • L is an integer or minus infinity • U is an integer or plus infinity • if L and U are integers, then L ≤ U • The special element  representing empty set The associated set of elements gamma: D  2Z

  12. Definition of gamma, ordering, lub

More Related